G4 Prover

Result of the test for sequent p->q, q->r --> p->r

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)> p->q,q->r-->p->r. Trying to prove with threshold = 0 Succeed in proving p->q,q->r --> p->r (1 msec.) pretty:1 = ----------- Ax r,p,q --> r -------------- L0->1 q,p,q->r --> r ----------------- L0->1 p,p->q,q->r --> r ------------------ R-> p->q,q->r --> p->r yes fol(g4i)> quit. yes Exit from Sequent Calculus Prover... Total CPU time = 3 msec. true

Back to g4-prover

Maintained by Joseph Vidal-Rosset