G4 Prover
    
Result of the test for sequent p\/bot <--> p 



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\/bot<-->p.
Trying to prove with threshold = 0
Succeed in proving p\/bot --> p (1 msec.)
pretty:1 =
------- Ax  --------- Lbot
p --> p     bot --> p
--------------------- L\/
    p\/bot --> p
Trying to prove with threshold = 0
Succeed in proving p --> p\/bot (0 msec.)
pretty:2 =
------- Ax
p --> p
------------ R\/
p --> p\/bot
yes
fol(g4i)> quit.
yes
Exit from Sequent Calculus Prover...
Total CPU time = 4 msec.
true 


  

Back to g4-prover
   
Maintained by  Joseph Vidal-Rosset