Skip to content

fix prover9 proof output. #236

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

fix prover9 proof output. #236

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file modified bin/sctptpUtils.jar
View file
Open in desktop
Binary file not shown.
23 changes: 17 additions & 6 deletions lisa-sets/src/main/scala/lisa/Tests.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,25 +35,36 @@ object Tests extends lisa.Main {
def _div(x: Expr[Ind], y: Expr[Ind]): Expr[Ind] = div(x)(y)
def _mult(x: Expr[Ind], y: Expr[Ind]): Expr[Ind] = mult(x)(y)







val divide_mult_shift = Theorem(
(
∀(x, x / t1 === x),
( ∀(x, x / t1 === x),
∀(x, ∀(y, x / y === t1 / (y / x))),
∀(x, ∀(y, (x / y) * y === x))
) |- ((t2 / t3) * (t3 / t2)) / t1 === t1
):
have(thesis) by Egg

val saturation = Theorem((∀(x, x === f(f(f(x)))), ∀(x, ∀(y, x === f(f(x))))) |- ∅ === f(∅)):

val saturationEGG = Theorem((∀(x, x === f(f(f(x)))), ∀(x, ∀(y, x === f(f(x))))) |- a === f(a)):
have(thesis) by Egg

val drinkers2 = Theorem(∃(x, ∀(y, d(x) ==> d(y)))):

val drinkersGO = Theorem(∃(x, ∀(y, d(x) ==> d(y)))):
have(thesis) by Goeland

val example = Theorem((∀(x, P(x)) \/ ∀(y, Q(y))) ==> (P(∅) \/ Q(∅))):

val exampleP9 = Theorem((∀(x, P(x)) \/ ∀(y, Q(y))) ==> (P(a) \/ Q(a))):
have(thesis) by Prover9

val example2 = Theorem(∃(x, ∀(y, d(x) ==> d(y)))):

val drinkersP9 = Theorem(∃(x, ∀(y, d(x) ==> d(y)))):
have(thesis) by Prover9



}
6 changes: 5 additions & 1 deletion lisa-sets/src/main/scala/lisa/automation/atp/Prover9.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -97,7 +97,11 @@ object Prover9 extends ProofTactic with ProofSequentTactic {
val cmd = (s"java -jar $sctptpExec p9 --input $foldername$filename.p --output $foldername$outputname.p")
val res =
try {
cmd.!!
val stdoutStream = new ByteArrayOutputStream
val stderrStream = new ByteArrayOutputStream
val stdoutWriter = new PrintWriter(stdoutStream)
val stderrWriter = new PrintWriter(stderrStream)
val exitValue = cmd.!(ProcessLogger(stdoutWriter.println, stderrWriter.println))
} catch {
case e: Exception =>
throw e
Expand Down
4 changes: 2 additions & 2 deletions lisa-sets/src/main/scala/lisa/tptp/ProofParser.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -936,7 +936,7 @@ object ProofParser {
object RightSubstFun {
def unapply(ann_seq: FOFAnnotated)(using defctx: DefContext, numbermap: String => Int, sequentmap: String => FOF.Sequent)(using maps: MapTriplet): Option[(K.SCProofStep, String)] =
ann_seq match {
case FOFAnnotated(name, role, sequent: FOF.Sequent, Inference("rightSubstFun", Seq(_, StrOrNum(n), StrOrNum(_), String(xl), Prop(fl)), Seq(t1)), origin) =>
case FOFAnnotated(name, role, sequent: FOF.Sequent, Inference("rightSubstFun", Seq(_, StrOrNum(n), StrOrNum(_), Prop(fl), String(xl)), Seq(t1)), origin) =>
val f = convertToKernel(sequent.lhs(n.toInt))
def extractForall(f: K.Expression): (List[K.Variable], K.Expression, K.Expression) = f match
case K.Forall(x, phi) => val (xs, psi, psi1) = extractForall(phi); (x :: xs, psi, psi1)
Expand All @@ -954,7 +954,7 @@ object ProofParser {
object RightSubstPred {
def unapply(ann_seq: FOFAnnotated)(using defctx: DefContext, numbermap: String => Int, sequentmap: String => FOF.Sequent)(using maps: MapTriplet): Option[(K.SCProofStep, String)] =
ann_seq match {
case FOFAnnotated(name, role, sequent: FOF.Sequent, Inference("rightSubstPred", Seq(_, StrOrNum(n), StrOrNum(_), String(xl), Prop(fl)), Seq(t1)), origin) =>
case FOFAnnotated(name, role, sequent: FOF.Sequent, Inference("rightSubstPred", Seq(_, StrOrNum(n), StrOrNum(_), Prop(fl), String(xl)), Seq(t1)), origin) =>
val f = convertToKernel(sequent.lhs(n.toInt))
def extractForall(f: K.Expression): (List[K.Variable], K.Expression, K.Expression) = f match
case K.Forall(x, phi) => val (xs, psi, psi1) = extractForall(phi); (x :: xs, psi, psi1)
Expand Down