%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : LCL186-1 : TPTP v9.3.1. Released v1.1.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:29 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.40s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 49 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 172 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 221 ( 103 ~; 98 |; 0 &)
% ( 20 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 5 ( 5 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 116 ( 105 !; 0 ?; 116 :)
% Comments :
%------------------------------------------------------------------------------
tff(theorem_type,type,
theorem: $i > $o ).
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,
^ [B: $i,A: $i] :
refl(( axiom(or(not(A),or(B,A)))
<=> axiom(or(not(A),or(B,A))) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [B: $i,A: $i] : axiom(or(not(A),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(or(not(A),or(B,A))) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,A: $i] : axiom(or(not(A),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(or(not(A),or(B,A))) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [B: $i,A: $i] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
tff(5,plain,
! [B: $i,A: $i] : axiom(or(not(A),or(B,A))),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [B: $i,A: $i] : axiom(or(not(A),or(B,A))),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [B: $i,A: $i] : axiom(or(not(A),or(B,A))),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [B: $i,A: $i] : axiom(or(not(A),or(B,A)))
| axiom(or(not(not(p)),or(q,not(p)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
axiom(or(not(not(p)),or(q,not(p)))),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( ~ theorem(or(not(not(p)),or(not(p),q)))
<=> ~ theorem(or(not(not(p)),or(not(p),q))) ),
inference(rewrite,[status(thm)],[]) ).
tff(11,axiom,
~ theorem(or(not(not(p)),or(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(12,plain,
~ theorem(or(not(not(p)),or(not(p),q))),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(( ( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
<=> ( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) )),
inference(bind,[status(th)],[]) ).
tff(14,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(16,plain,
^ [Z: $i,Y: $i,X: $i] :
rewrite(( ( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) )
<=> ( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) )),
inference(bind,[status(th)],[]) ).
tff(17,plain,
( ! [Z: $i,Y: $i,X: $i] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) ),
inference(quant_intro,[status(thm)],[16]) ).
tff(18,axiom,
! [Z: $i,Y: $i,X: $i] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
tff(19,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
inference(modus_ponens,[status(thm)],[19,15]) ).
tff(21,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
inference(skolemize,[status(sab)],[20]) ).
tff(22,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
inference(modus_ponens,[status(thm)],[21,14]) ).
tff(23,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p)))) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p)))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(24,plain,
( ( ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(not(p),q))) )
<=> ( theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p)))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(25,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(not(p),q))) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p)))) ) ),
inference(monotonicity,[status(thm)],[24]) ).
tff(26,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(not(p),q))) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p)))) ) ),
inference(transitivity,[status(thm)],[25,23]) ).
tff(27,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p))))
| theorem(or(not(not(p)),or(not(p),q))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(28,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) )
| theorem(or(not(not(p)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(not(p)),or(q,not(p)))) ),
inference(modus_ponens,[status(thm)],[27,26]) ).
tff(29,plain,
~ theorem(or(not(or(q,not(p))),or(not(p),q))),
inference(unit_resolution,[status(thm)],[28,22,12,9]) ).
tff(30,plain,
^ [B: $i,A: $i] :
refl(( axiom(or(not(or(A,B)),or(B,A)))
<=> axiom(or(not(or(A,B)),or(B,A))) )),
inference(bind,[status(th)],[]) ).
tff(31,plain,
( ! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A))) ),
inference(quant_intro,[status(thm)],[30]) ).
tff(32,plain,
( ! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A)))
<=> ! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A))) ),
inference(rewrite,[status(thm)],[]) ).
tff(33,axiom,
! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
tff(34,plain,
! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A))),
inference(modus_ponens,[status(thm)],[33,32]) ).
tff(35,plain,
! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A))),
inference(skolemize,[status(sab)],[34]) ).
tff(36,plain,
! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A))),
inference(modus_ponens,[status(thm)],[35,31]) ).
tff(37,plain,
( ~ ! [B: $i,A: $i] : axiom(or(not(or(A,B)),or(B,A)))
| axiom(or(not(or(q,not(p))),or(not(p),q))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(38,plain,
axiom(or(not(or(q,not(p))),or(not(p),q))),
inference(unit_resolution,[status(thm)],[37,36]) ).
tff(39,plain,
^ [X: $i] :
refl(( ( theorem(X)
| ~ axiom(X) )
<=> ( theorem(X)
| ~ axiom(X) ) )),
inference(bind,[status(th)],[]) ).
tff(40,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(quant_intro,[status(thm)],[39]) ).
tff(41,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(42,axiom,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
tff(43,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[42,41]) ).
tff(44,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(skolemize,[status(sab)],[43]) ).
tff(45,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[44,40]) ).
tff(46,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(or(q,not(p))),or(not(p),q))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(or(q,not(p))),or(not(p),q))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(47,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(or(q,not(p))),or(not(p),q))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(48,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(q,not(p))),or(not(p),q)))
| ~ axiom(or(not(or(q,not(p))),or(not(p),q))) ),
inference(modus_ponens,[status(thm)],[47,46]) ).
tff(49,plain,
$false,
inference(unit_resolution,[status(thm)],[48,45,38,29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-1 : TPTP v9.3.1. Released v1.1.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.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 4 23:47:15 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.12/0.40 % SZS status Unsatisfiable
% 0.12/0.40 % SZS output start Proof
% See solution above
% 0.12/0.40 % E exiting
%------------------------------------------------------------------------------