G4 Prover
    
Result of the test for sequent X@p(X) --> X#p(X) 



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)> _5580@p(_5580)-->_5580#p(_5580).
Trying to prove with threshold = 0 1 2
Succeed in proving _5580@p(_5580) --> _5580#p(_5580) (25 msec.)
pretty:1 =
-------------------- Ax
p(Y),X@p(X) --> p(Y)
---------------------- R#
p(Y),X@p(X) --> X#p(X)
---------------------- L@
  X@p(X) --> X#p(X)
yes
fol(g4i)> quit.
yes
Exit from Sequent Calculus Prover...
Total CPU time = 26 msec.
true 


  

Back to g4-prover
   
Maintained by  Joseph Vidal-Rosset