Submission Details

Back to Submissions List

Challenge: mapInt

Submitted by: GasStationManager

Submitted at: 2024-11-26 03:15:02

Code:

def mapInt(xs:List Int)(f:Int->Int):List Int

:= []

#exit 0

/- retrying Command Master's entry -/

First Theorem Proof:

theorem mapInt_correct(xs:List Int)(f:Int->Int)
: (mapInt xs f).length=xs.length
∧  ∀ i:Fin xs.length, (mapInt xs f)[i]! = f xs[i]

:=sorry

Status: Incorrect

Feedback:

found a problem in /root/CodeProofTheArena/temp/tmp3usz0tcb/proof.olean
uncaught exception: mapInt_correct not found in submission
------------------
Replaying /root/CodeProofTheArena/temp/tmp3usz0tcb/target.olean
Finished imports
Finished replay
---
def
mapInt
List Int → (Int → Int) → List Int
:= fun (xs : List.{0} Int) (f : Int -> Int) => sorryAx.{1} (List.{0} Int) Bool.false
#[sorryAx]
---
theorem
mapInt_correct
∀ (xs : List Int) (f : Int → Int), (mapInt xs f).length = xs.length ∧ ∀ (i : Fin xs.length), (mapInt xs f)[i]! = f xs[i]
#[sorryAx, propext]
------------------
Replaying /root/CodeProofTheArena/temp/tmp3usz0tcb/proof.olean
Finished imports
Finished replay
---
def
mapInt
List Int → (Int → Int) → List Int
:= fun (xs : List.{0} Int) (f : Int -> Int) => List.nil.{0} Int
#[]