G4 Prover
    
Result of the test for sequent (p-> ~q)-->((p->q)-> ~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-> ~q-->(p->q)-> ~p.
Trying to prove with threshold = 0
Succeed in proving p-> ~q --> (p->q)-> ~p (2 msec.)
pretty:1 =
--------------- Ax
bot,q,p --> bot
------------------ L0->1
q,q->bot,p --> bot
--------------------- L0->1
q,p,p->q->bot --> bot
------------------------ L0->1
p,p->q,p->q->bot --> bot
------------------------ R~
 p->q,p->q->bot --> ~p
 ------------------------- R->
 p->q->bot --> (p->q)-> ~p
 ------------------------- L~def
  p-> ~q --> (p->q)-> ~p
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