%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : LCL190-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : run_E %s %d THM
% Computer : n015.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:30 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.39s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of formulae : 71 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 217 ( 15 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 259 ( 119 ~; 112 |; 0 &)
% ( 28 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of FOOLs : 6 ( 6 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; 3 con; 0-2 aty)
% Number of variables : 129 ( 117 !; 0 ?; 129 :)
% Comments :
%------------------------------------------------------------------------------
tff(theorem_type,type,
theorem: $i > $o ).
tff(or_type,type,
or: ( $i * $i ) > $i ).
tff(q_type,type,
q: $i ).
tff(r_type,type,
r: $i ).
tff(p_type,type,
p: $i ).
tff(not_type,type,
not: $i > $i ).
tff(implies_type,type,
implies: ( $i * $i ) > $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/sandbox/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(p,or(q,r)),or(p,or(r,q))) = or(not(or(p,or(q,r))),or(p,or(r,q))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
implies(or(p,or(q,r)),or(p,or(r,q))) = or(not(or(p,or(q,r))),or(p,or(r,q))),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
or(not(or(p,or(q,r))),or(p,or(r,q))) = implies(or(p,or(q,r)),or(p,or(r,q))),
inference(symmetry,[status(thm)],[9]) ).
tff(11,plain,
( theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
<=> theorem(implies(or(p,or(q,r)),or(p,or(r,q)))) ),
inference(monotonicity,[status(thm)],[10]) ).
tff(12,plain,
( theorem(implies(or(p,or(q,r)),or(p,or(r,q))))
<=> theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))) ),
inference(symmetry,[status(thm)],[11]) ).
tff(13,plain,
( ~ theorem(implies(or(p,or(q,r)),or(p,or(r,q))))
<=> ~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))) ),
inference(monotonicity,[status(thm)],[12]) ).
tff(14,plain,
( ~ theorem(implies(or(p,or(q,r)),or(p,or(r,q))))
<=> ~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))) ),
inference(rewrite,[status(thm)],[]) ).
tff(15,axiom,
~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(16,plain,
~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
inference(modus_ponens,[status(thm)],[16,13]) ).
tff(18,plain,
implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))) = implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q)))),
inference(monotonicity,[status(thm)],[9]) ).
tff(19,plain,
( theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
<=> theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ),
inference(monotonicity,[status(thm)],[18]) ).
tff(20,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(21,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)],[20]) ).
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(rewrite,[status(thm)],[]) ).
tff(23,axiom,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
tff(24,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(modus_ponens,[status(thm)],[23,22]) ).
tff(25,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(skolemize,[status(sab)],[24]) ).
tff(26,plain,
! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(modus_ponens,[status(thm)],[25,21]) ).
tff(27,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
| axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(28,plain,
axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))),
inference(unit_resolution,[status(thm)],[27,26]) ).
tff(29,plain,
^ [X: $i] :
refl(( ( theorem(X)
| ~ axiom(X) )
<=> ( theorem(X)
| ~ axiom(X) ) )),
inference(bind,[status(th)],[]) ).
tff(30,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(32,axiom,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
tff(33,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[32,31]) ).
tff(34,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(skolemize,[status(sab)],[33]) ).
tff(35,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[34,30]) ).
tff(36,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
| ~ axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
| ~ axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(37,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
| ~ axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(38,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
| ~ axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))) ),
inference(modus_ponens,[status(thm)],[37,36]) ).
tff(39,plain,
theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))),
inference(unit_resolution,[status(thm)],[38,35,28]) ).
tff(40,plain,
theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))),
inference(modus_ponens,[status(thm)],[39,19]) ).
tff(41,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(42,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)],[41]) ).
tff(43,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(44,axiom,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
tff(45,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(modus_ponens,[status(thm)],[44,43]) ).
tff(46,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(skolemize,[status(sab)],[45]) ).
tff(47,plain,
! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A))),
inference(modus_ponens,[status(thm)],[46,42]) ).
tff(48,plain,
( ~ ! [B: $i,A: $i] : axiom(implies(or(A,B),or(B,A)))
| axiom(implies(or(q,r),or(r,q))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(49,plain,
axiom(implies(or(q,r),or(r,q))),
inference(unit_resolution,[status(thm)],[48,47]) ).
tff(50,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(q,r),or(r,q)))
| ~ axiom(implies(or(q,r),or(r,q))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(q,r),or(r,q)))
| ~ axiom(implies(or(q,r),or(r,q))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(51,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(q,r),or(r,q)))
| ~ axiom(implies(or(q,r),or(r,q))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(52,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(implies(or(q,r),or(r,q)))
| ~ axiom(implies(or(q,r),or(r,q))) ),
inference(modus_ponens,[status(thm)],[51,50]) ).
tff(53,plain,
theorem(implies(or(q,r),or(r,q))),
inference(unit_resolution,[status(thm)],[52,35,49]) ).
tff(54,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(55,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)],[54]) ).
tff(56,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(57,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(58,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)],[57]) ).
tff(59,axiom,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
tff(60,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[59,58]) ).
tff(61,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[60,56]) ).
tff(62,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(skolemize,[status(sab)],[61]) ).
tff(63,plain,
! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) ),
inference(modus_ponens,[status(thm)],[62,55]) ).
tff(64,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(implies(or(q,r),or(r,q)))
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(implies(or(q,r),or(r,q)))
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(65,plain,
( ( theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(or(q,r),or(r,q)))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) )
<=> ( ~ theorem(implies(or(q,r),or(r,q)))
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(66,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(or(q,r),or(r,q)))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(implies(or(q,r),or(r,q)))
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ) ),
inference(monotonicity,[status(thm)],[65]) ).
tff(67,plain,
( ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(or(q,r),or(r,q)))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) )
<=> ( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(implies(or(q,r),or(r,q)))
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ) ),
inference(transitivity,[status(thm)],[66,64]) ).
tff(68,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(or(q,r),or(r,q)))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(69,plain,
( ~ ! [Y: $i,X: $i] :
( theorem(X)
| ~ theorem(Y)
| ~ theorem(implies(Y,X)) )
| ~ theorem(implies(or(q,r),or(r,q)))
| theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ),
inference(modus_ponens,[status(thm)],[68,67]) ).
tff(70,plain,
( theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))
| ~ theorem(implies(implies(or(q,r),or(r,q)),or(not(or(p,or(q,r))),or(p,or(r,q))))) ),
inference(unit_resolution,[status(thm)],[69,63,53]) ).
tff(71,plain,
$false,
inference(unit_resolution,[status(thm)],[70,40,17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL190-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : run_E %s %d THM
% 0.07/0.34 % Computer : n015.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Fri Sep 4 20:39:45 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.13/0.39 % SZS status Unsatisfiable
% 0.13/0.39 % SZS output start Proof
% See solution above
% 0.13/0.39 % E exiting
%------------------------------------------------------------------------------