%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : LCL234-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 02:59:38 PM UTC 2026
% Result : Unsatisfiable 3.96s 4.27s
% Output : Proof 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 53
% Syntax : Number of formulae : 142 ( 64 unt; 0 typ; 0 def)
% Number of atoms : 415 ( 45 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 495 ( 230 ~; 220 |; 0 &)
% ( 45 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of FOOLs : 8 ( 8 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 226 ( 209 !; 0 ?; 226 :)
% Comments :
%------------------------------------------------------------------------------
tff(theorem_type,type,
theorem: $i > $o ).
tff(implies_type,type,
implies: ( $i * $i ) > $i ).
tff(or_type,type,
or: ( $i * $i ) > $i ).
tff(not_type,type,
not: $i > $i ).
tff(q_type,type,
q: $i ).
tff(p_type,type,
p: $i ).
tff(axiom_type,type,
axiom: $i > $o ).
tff(and_type,type,
and: ( $i * $i ) > $i ).
tff(1,plain,
^ [Y: $i,X: $i] :
refl(( ( implies(X,Y) = or(not(X),Y) )
<=> ( implies(X,Y) = or(not(X),Y) ) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
<=> ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
<=> ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
tff(5,plain,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(or(not(p),not(q)),or(not(q),not(p))) = or(not(or(not(p),not(q))),or(not(q),not(p))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
implies(or(not(p),not(q)),or(not(q),not(p))) = or(not(or(not(p),not(q))),or(not(q),not(p))),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
or(not(or(not(p),not(q))),or(not(q),not(p))) = implies(or(not(p),not(q)),or(not(q),not(p))),
inference(symmetry,[status(thm)],[9]) ).
tff(11,plain,
( theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
<=> theorem(implies(or(not(p),not(q)),or(not(q),not(p)))) ),
inference(monotonicity,[status(thm)],[10]) ).
tff(12,plain,
( theorem(implies(or(not(p),not(q)),or(not(q),not(p))))
<=> theorem(or(not(or(not(p),not(q))),or(not(q),not(p)))) ),
inference(symmetry,[status(thm)],[11]) ).
tff(13,plain,
^ [B: $i,A: $i] :
refl(( axiom(implies(or(A,B),or(B,A)))
<=> axiom(implies(or(A,B),or(B,A))) )),
inference(bind,[status(th)],[]) ).
tff(14,plain,
( ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))) ),
inference(rewrite,[status(thm)],[]) ).
tff(16,axiom,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
tff(17,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(skolemize,[status(sab)],[17]) ).
tff(19,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(modus_ponens,[status(thm)],[18,14]) ).
tff(20,plain,
( ~ ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
| axiom(implies(or(not(p),not(q)),or(not(q),not(p)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(21,plain,
axiom(implies(or(not(p),not(q)),or(not(q),not(p)))),
inference(unit_resolution,[status(thm)],[20,19]) ).
tff(22,plain,
^ [X: $i] :
refl(( ( theorem(X)
| ~ axiom(X) )
<=> ( theorem(X)
| ~ axiom(X) ) )),
inference(bind,[status(th)],[]) ).
tff(23,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(quant_intro,[status(thm)],[22]) ).
tff(24,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(25,axiom,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
tff(26,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(skolemize,[status(sab)],[26]) ).
tff(28,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[27,23]) ).
tff(29,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),not(q)),or(not(q),not(p))))
| ~ axiom(implies(or(not(p),not(q)),or(not(q),not(p)))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),not(q)),or(not(q),not(p))))
| ~ axiom(implies(or(not(p),not(q)),or(not(q),not(p)))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(30,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),not(q)),or(not(q),not(p))))
| ~ axiom(implies(or(not(p),not(q)),or(not(q),not(p)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(31,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(p),not(q)),or(not(q),not(p))))
| ~ axiom(implies(or(not(p),not(q)),or(not(q),not(p)))) ),
inference(modus_ponens,[status(thm)],[30,29]) ).
tff(32,plain,
theorem(implies(or(not(p),not(q)),or(not(q),not(p)))),
inference(unit_resolution,[status(thm)],[31,28,21]) ).
tff(33,plain,
theorem(or(not(or(not(p),not(q))),or(not(q),not(p)))),
inference(modus_ponens,[status(thm)],[32,12]) ).
tff(34,plain,
^ [B: $i,A: $i,C: $i] :
refl(( axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
<=> axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) )),
inference(bind,[status(th)],[]) ).
tff(35,plain,
( ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
<=> ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ),
inference(quant_intro,[status(thm)],[34]) ).
tff(36,plain,
( ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
<=> ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ),
inference(rewrite,[status(thm)],[]) ).
tff(37,axiom,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
tff(38,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(modus_ponens,[status(thm)],[37,36]) ).
tff(39,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(skolemize,[status(sab)],[38]) ).
tff(40,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(modus_ponens,[status(thm)],[39,35]) ).
tff(41,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
| axiom(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(42,plain,
axiom(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))),
inference(unit_resolution,[status(thm)],[41,40]) ).
tff(43,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p)))))
| ~ axiom(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p)))))
| ~ axiom(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(44,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p)))))
| ~ axiom(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(45,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p)))))
| ~ axiom(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ),
inference(modus_ponens,[status(thm)],[44,43]) ).
tff(46,plain,
theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))),
inference(unit_resolution,[status(thm)],[45,28,42]) ).
tff(47,plain,
^ [Y: $i,X: $i] :
refl(( ( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
<=> ( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) )),
inference(bind,[status(th)],[]) ).
tff(48,plain,
( ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
<=> ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) ),
inference(quant_intro,[status(thm)],[47]) ).
tff(49,plain,
( ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
<=> ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(50,plain,
^ [Y: $i,X: $i] :
rewrite(( ( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) )
<=> ( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) )),
inference(bind,[status(th)],[]) ).
tff(51,plain,
( ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) )
<=> ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ) ),
inference(quant_intro,[status(thm)],[50]) ).
tff(52,axiom,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
tff(53,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[52,51]) ).
tff(54,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[53,49]) ).
tff(55,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(skolemize,[status(sab)],[54]) ).
tff(56,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[55,48]) ).
tff(57,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(58,plain,
( ( theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) )
<=> ( ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(59,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ) ),
inference(monotonicity,[status(thm)],[58]) ).
tff(60,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ) ),
inference(transitivity,[status(thm)],[59,57]) ).
tff(61,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(62,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(or(not(p),not(q))),or(not(q),not(p))),or(not(q),or(not(or(not(p),not(q))),not(p))))) ),
inference(modus_ponens,[status(thm)],[61,60]) ).
tff(63,plain,
( ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| theorem(or(not(q),or(not(or(not(p),not(q))),not(p)))) ),
inference(unit_resolution,[status(thm)],[62,56,46]) ).
tff(64,plain,
theorem(or(not(q),or(not(or(not(p),not(q))),not(p)))),
inference(unit_resolution,[status(thm)],[63,33]) ).
tff(65,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(q,and(p,q)) = or(not(q),and(p,q)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(66,plain,
implies(q,and(p,q)) = or(not(q),and(p,q)),
inference(unit_resolution,[status(thm)],[65,7]) ).
tff(67,plain,
or(not(q),and(p,q)) = implies(q,and(p,q)),
inference(symmetry,[status(thm)],[66]) ).
tff(68,plain,
^ [Q: $i,P: $i] :
refl(( ( and(P,Q) = not(or(not(P),not(Q))) )
<=> ( and(P,Q) = not(or(not(P),not(Q))) ) )),
inference(bind,[status(th)],[]) ).
tff(69,plain,
( ! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) )
<=> ! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) ) ),
inference(quant_intro,[status(thm)],[68]) ).
tff(70,plain,
( ! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) )
<=> ! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(71,axiom,
! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
tff(72,plain,
! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) ),
inference(modus_ponens,[status(thm)],[71,70]) ).
tff(73,plain,
! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) ),
inference(skolemize,[status(sab)],[72]) ).
tff(74,plain,
! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) ),
inference(modus_ponens,[status(thm)],[73,69]) ).
tff(75,plain,
( ~ ! [Q: $i,P: $i] : ( and(P,Q) = not(or(not(P),not(Q))) )
| ( and(p,q) = not(or(not(p),not(q))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(76,plain,
and(p,q) = not(or(not(p),not(q))),
inference(unit_resolution,[status(thm)],[75,74]) ).
tff(77,plain,
not(or(not(p),not(q))) = and(p,q),
inference(symmetry,[status(thm)],[76]) ).
tff(78,plain,
or(not(q),not(or(not(p),not(q)))) = or(not(q),and(p,q)),
inference(monotonicity,[status(thm)],[77]) ).
tff(79,plain,
or(not(q),not(or(not(p),not(q)))) = implies(q,and(p,q)),
inference(transitivity,[status(thm)],[78,67]) ).
tff(80,plain,
or(not(p),or(not(q),not(or(not(p),not(q))))) = or(not(p),implies(q,and(p,q))),
inference(monotonicity,[status(thm)],[79]) ).
tff(81,plain,
implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))) = implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q)))),
inference(monotonicity,[status(thm)],[80]) ).
tff(82,plain,
( theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
<=> theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))) ),
inference(monotonicity,[status(thm)],[81]) ).
tff(83,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
| axiom(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(84,plain,
axiom(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))),
inference(unit_resolution,[status(thm)],[83,40]) ).
tff(85,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(86,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(87,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q)))))))
| ~ axiom(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))) ),
inference(modus_ponens,[status(thm)],[86,85]) ).
tff(88,plain,
theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),or(not(q),not(or(not(p),not(q))))))),
inference(unit_resolution,[status(thm)],[87,28,84]) ).
tff(89,plain,
theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))),
inference(modus_ponens,[status(thm)],[88,82]) ).
tff(90,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(p,implies(q,and(p,q))) = or(not(p),implies(q,and(p,q))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(91,plain,
implies(p,implies(q,and(p,q))) = or(not(p),implies(q,and(p,q))),
inference(unit_resolution,[status(thm)],[90,7]) ).
tff(92,plain,
or(not(p),implies(q,and(p,q))) = implies(p,implies(q,and(p,q))),
inference(symmetry,[status(thm)],[91]) ).
tff(93,plain,
( theorem(or(not(p),implies(q,and(p,q))))
<=> theorem(implies(p,implies(q,and(p,q)))) ),
inference(monotonicity,[status(thm)],[92]) ).
tff(94,plain,
( theorem(implies(p,implies(q,and(p,q))))
<=> theorem(or(not(p),implies(q,and(p,q)))) ),
inference(symmetry,[status(thm)],[93]) ).
tff(95,plain,
( ~ theorem(implies(p,implies(q,and(p,q))))
<=> ~ theorem(or(not(p),implies(q,and(p,q)))) ),
inference(monotonicity,[status(thm)],[94]) ).
tff(96,plain,
( ~ theorem(implies(p,implies(q,and(p,q))))
<=> ~ theorem(implies(p,implies(q,and(p,q)))) ),
inference(rewrite,[status(thm)],[]) ).
tff(97,axiom,
~ theorem(implies(p,implies(q,and(p,q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(98,plain,
~ theorem(implies(p,implies(q,and(p,q)))),
inference(modus_ponens,[status(thm)],[97,96]) ).
tff(99,plain,
~ theorem(or(not(p),implies(q,and(p,q)))),
inference(modus_ponens,[status(thm)],[98,95]) ).
tff(100,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),implies(q,and(p,q))))
| ~ theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),implies(q,and(p,q))))
| ~ theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(101,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),implies(q,and(p,q))))
| ~ theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(102,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(p),implies(q,and(p,q))))
| ~ theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))) ),
inference(modus_ponens,[status(thm)],[101,100]) ).
tff(103,plain,
( theorem(or(not(p),implies(q,and(p,q))))
| ~ theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(q),or(not(p),not(or(not(p),not(q))))),or(not(p),implies(q,and(p,q))))) ),
inference(unit_resolution,[status(thm)],[102,56]) ).
tff(104,plain,
~ theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))),
inference(unit_resolution,[status(thm)],[103,99,89]) ).
tff(105,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(106,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(107,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(q),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))) ),
inference(modus_ponens,[status(thm)],[106,105]) ).
tff(108,plain,
( ~ theorem(or(not(q),or(not(or(not(p),not(q))),not(p))))
| ~ theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))) ),
inference(unit_resolution,[status(thm)],[107,56,104]) ).
tff(109,plain,
~ theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))),
inference(unit_resolution,[status(thm)],[108,64]) ).
tff(110,plain,
( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
| ( implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))) = or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(111,plain,
implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))) = or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),
inference(unit_resolution,[status(thm)],[110,7]) ).
tff(112,plain,
or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))) = implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),
inference(symmetry,[status(thm)],[111]) ).
tff(113,plain,
( theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))))
<=> theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))) ),
inference(monotonicity,[status(thm)],[112]) ).
tff(114,plain,
( theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))))
<=> theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q)))))) ),
inference(symmetry,[status(thm)],[113]) ).
tff(115,plain,
( ~ ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
| axiom(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(116,plain,
axiom(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))),
inference(unit_resolution,[status(thm)],[115,19]) ).
tff(117,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))))
| ~ axiom(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))))
| ~ axiom(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(118,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))))
| ~ axiom(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(119,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))))
| ~ axiom(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))) ),
inference(modus_ponens,[status(thm)],[118,117]) ).
tff(120,plain,
theorem(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q)))))),
inference(unit_resolution,[status(thm)],[119,28,116]) ).
tff(121,plain,
theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q)))))),
inference(modus_ponens,[status(thm)],[120,114]) ).
tff(122,plain,
implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))) = implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))),
inference(monotonicity,[status(thm)],[111]) ).
tff(123,plain,
( theorem(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))))
<=> theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(monotonicity,[status(thm)],[122]) ).
tff(124,plain,
^ [B: $i,A: $i,C: $i] :
refl(( axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
<=> axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) )),
inference(bind,[status(th)],[]) ).
tff(125,plain,
( ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
<=> ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) ),
inference(quant_intro,[status(thm)],[124]) ).
tff(126,plain,
( ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
<=> ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) ),
inference(rewrite,[status(thm)],[]) ).
tff(127,axiom,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
tff(128,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(modus_ponens,[status(thm)],[127,126]) ).
tff(129,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(skolemize,[status(sab)],[128]) ).
tff(130,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(modus_ponens,[status(thm)],[129,125]) ).
tff(131,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
| axiom(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(132,plain,
axiom(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))),
inference(unit_resolution,[status(thm)],[131,130]) ).
tff(133,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))))
| ~ axiom(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))))
| ~ axiom(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(134,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))))
| ~ axiom(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(135,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q))))))))
| ~ axiom(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(modus_ponens,[status(thm)],[134,133]) ).
tff(136,plain,
theorem(implies(implies(or(not(or(not(p),not(q))),not(p)),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))),
inference(unit_resolution,[status(thm)],[135,28,132]) ).
tff(137,plain,
theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))),
inference(modus_ponens,[status(thm)],[136,123]) ).
tff(138,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))
| ~ theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))
| ~ theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(139,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))
| ~ theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(140,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))
| ~ theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(modus_ponens,[status(thm)],[139,138]) ).
tff(141,plain,
( theorem(implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))
| ~ theorem(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))))
| ~ theorem(implies(or(not(or(not(or(not(p),not(q))),not(p))),or(not(p),not(or(not(p),not(q))))),implies(or(not(q),or(not(or(not(p),not(q))),not(p))),or(not(q),or(not(p),not(or(not(p),not(q)))))))) ),
inference(unit_resolution,[status(thm)],[140,56]) ).
tff(142,plain,
$false,
inference(unit_resolution,[status(thm)],[141,137,121,109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL234-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : run_E %s %d THM
% 0.07/0.33 % Computer : n002.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Sat Sep 5 15:32:22 UTC 2026
% 0.07/0.33 % CPUTime :
% 3.96/4.27 % SZS status Unsatisfiable
% 3.96/4.27 % SZS output start Proof
% See solution above
% 4.06/4.35 % E exiting
%------------------------------------------------------------------------------