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