G4 Prover
    
Result of the test for sequent p\/top <--> 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\/top<-->top.
Trying to prove with threshold = 0
Succeed in proving p\/top --> top (0 msec.)
pretty:1 =
-------------- Rtop
p\/top --> top
Trying to prove with threshold = 0
Succeed in proving top --> p\/top (0 msec.)
pretty:2 =
-------- Rtop
 --> top
----------- R\/
 --> p\/top
-------------- Ltop
top --> p\/top
yes
fol(g4i)> quit.
yes
Exit from Sequent Calculus Prover...
Total CPU time = 2 msec.
true 


  

Back to g4-prover
   
Maintained by  Joseph Vidal-Rosset