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



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<-->bot.
Trying to prove with threshold = 0
Succeed in proving p/\bot --> bot (1 msec.)
pretty:1 =
------------- Ax
p,bot --> bot
-------------- L/\
p/\bot --> bot
Trying to prove with threshold = 0
Succeed in proving bot --> p/\bot (1 msec.)
pretty:2 =
--------- Lbot  ----------- Ax
bot --> p       bot --> bot
--------------------------- R/\
      bot --> p/\bot
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