G4 Prover

Result of the test for sequent top--> (p(a)/\p(b)->q)->X#(p(X)->q)

G4 Prover: a Prolog Prover for Roy Dyckhoff's Sequent Calculus G4 This prover is a fork made by Joseph Vidal-Rosset (joseph.vidal-rosset@gmail.com), from seqprover.pl, the sequent prover for CL-X, written by Naoyuki Tamura (tamura@kobe-u.ac.jp). Type "help." if you need some help. fol(g4i)> fol(g4i). yes fol(g4i)> output(pretty). yes fol(g4i)> top-->(p(a)/\p(b)->q)->_5600#(p(_5600)->q). Trying to prove with threshold = 0 1 Succeed in proving top --> (p(a)/\p(b)->q)->_5600#(p(_5600)->q) (23 msec.) pretty:1 = ----------------- Ax q,p(a),p(b) --> q ----------------------- L0->1 p(b),p(a),p(b)->q --> q ------------------------ R-> p(a),p(b)->q --> p(b)->q ---------------------------- R# p(a),p(b)->q --> X#(p(X)->q) ----------------------------- L/\ p(a)/\p(b)->q --> X#(p(X)->q) --------------------------------- R-> --> (p(a)/\p(b)->q)->X#(p(X)->q) ------------------------------------ Ltop top --> (p(a)/\p(b)->q)->X#(p(X)->q) yes fol(g4i)> quit. yes Exit from Sequent Calculus Prover... Total CPU time = 27 msec. true

Back to g4-prover

Maintained by Joseph Vidal-Rosset