Submission Details

Back to Submissions List

Challenge: solveAdd0

Submitted by: Robin

Submitted at: 2025-03-28 18:35:32

Code:

import Init.Data.Int

def solveAdd0(a:Int): Int

:= -a

First Theorem Proof:

theorem solveAdd0_correct(a: Int): a +(solveAdd0 a)=0

:= Int.sub_self a

Status: Correct

Feedback:

------------------
Replaying /root/CodeProofTheArena/temp/tmp79k1htrm/target.olean
Finished imports
Finished replay
---
def
solveAdd0
Int → Int
:= fun (a : Int) => sorryAx.{1} Int Bool.false
#[sorryAx]
---
theorem
solveAdd0_correct
∀ (a : Int), a + solveAdd0 a = 0
#[sorryAx]
------------------
Replaying /root/CodeProofTheArena/temp/tmp79k1htrm/proof.olean
Finished imports
Finished replay
---
def
solveAdd0
Int → Int
:= fun (a : Int) => Neg.neg.{0} Int Int.instNegInt a
#[]
---
theorem
solveAdd0_correct
∀ (a : Int), a + solveAdd0 a = 0
#[propext]
Finished with no errors.