G4 Prover

Result of the test for sequent p\/ ~p <--> top

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\/ ~p<-->top. Trying to prove with threshold = 0 Succeed in proving p\/ ~p --> top (1 msec.) pretty:1 = -------------- Rtop p\/ ~p --> top Trying to prove with threshold = 0 1 2 3 4 5 Fail to prove top --> p\/ ~p (7 msec.) yes fol(g4i)> quit. yes Exit from Sequent Calculus Prover... Total CPU time = 8 msec. true

Back to g4-prover

Maintained by Joseph Vidal-Rosset