G4 Prover
    
Result of the test for sequent ~ ~ p <--> 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<-->p.
Trying to prove with threshold = 0 1 2 3 4 5
Fail to prove ~ ~p --> p (10 msec.)
Trying to prove with threshold = 0
Succeed in proving p --> ~ ~p (1 msec.)
pretty:1 =
------------- Ax
p,bot --> bot
---------------- L0->1
p->bot,p --> bot
---------------- L~def
  ~p,p --> bot
  ------------ R~
   p --> ~ ~p
yes
fol(g4i)> quit.
yes
Exit from Sequent Calculus Prover...
Total CPU time = 13 msec.
true 


  

Back to g4-prover
   
Maintained by  Joseph Vidal-Rosset