%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : LCL173-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : run_E %s %d THM
% Computer : n013.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:26 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.40s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 23 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 58 ( 27 ~; 23 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of FOOLs : 2 ( 2 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 39 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
tff(axiom_type,type,
axiom: $i > $o ).
tff(or_type,type,
or: ( $i * $i ) > $i ).
tff(r_type,type,
r: $i ).
tff(not_type,type,
not: $i > $i ).
tff(p_type,type,
p: $i ).
tff(q_type,type,
q: $i ).
tff(theorem_type,type,
theorem: $i > $o ).
tff(1,plain,
^ [B: $i,A: $i,C: $i] :
refl(( axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))
<=> axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))
<=> ! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))
<=> ! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
tff(5,plain,
! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [B: $i,A: $i,C: $i] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))
| axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
<=> ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) ),
inference(rewrite,[status(thm)],[]) ).
tff(11,axiom,
~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(12,plain,
~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
^ [X: $i] :
refl(( ( theorem(X)
| ~ axiom(X) )
<=> ( theorem(X)
| ~ axiom(X) ) )),
inference(bind,[status(th)],[]) ).
tff(14,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
<=> ! [X: $i] :
( theorem(X)
| ~ axiom(X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(16,axiom,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
tff(17,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(skolemize,[status(sab)],[17]) ).
tff(19,plain,
! [X: $i] :
( theorem(X)
| ~ axiom(X) ),
inference(modus_ponens,[status(thm)],[18,14]) ).
tff(20,plain,
( ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
| ~ axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) )
<=> ( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
| ~ axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(21,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
| ~ axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(22,plain,
( ~ ! [X: $i] :
( theorem(X)
| ~ axiom(X) )
| theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
| ~ axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) ),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
$false,
inference(unit_resolution,[status(thm)],[22,19,12,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL173-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_E %s %d THM
% 0.08/0.34 % Computer : n013.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 4 16:19:06 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.13/0.40 % SZS status Unsatisfiable
% 0.13/0.40 % SZS output start Proof
% See solution above
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------