%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : run_E %s %d THM
% Computer : n007.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:13 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.40s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 22
% Syntax : Number of formulae : 48 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 162 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 192 ( 89 ~; 83 |; 0 &)
% ( 20 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of FOOLs : 11 ( 11 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 102 ( 92 !; 0 ?; 102 :)
% Comments :
%------------------------------------------------------------------------------
tff(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
tff(implies_type,type,
implies: ( $i * $i ) > $i ).
tff(a_type,type,
a: $i ).
tff(not_type,type,
not: $i > $i ).
tff(1,plain,
^ [Y: $i,X: $i] :
refl(( is_a_theorem(implies(X,implies(Y,X)))
<=> is_a_theorem(implies(X,implies(Y,X))) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X)))
<=> ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X))) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X)))
<=> ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X))) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
tff(5,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X))),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X))),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X))),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(Y,X)))
| is_a_theorem(implies(a,implies(not(not(a)),a))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
is_a_theorem(implies(a,implies(not(not(a)),a))),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
^ [Y: $i,X: $i] :
refl(( is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y)))
<=> is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))) )),
inference(bind,[status(th)],[]) ).
tff(11,plain,
( ! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y)))
<=> ! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))) ),
inference(quant_intro,[status(thm)],[10]) ).
tff(12,plain,
( ! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y)))
<=> ! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))) ),
inference(rewrite,[status(thm)],[]) ).
tff(13,axiom,
! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_54) ).
tff(14,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
inference(skolemize,[status(sab)],[14]) ).
tff(16,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
inference(modus_ponens,[status(thm)],[15,11]) ).
tff(17,plain,
( ~ ! [Y: $i,X: $i] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y)))
| is_a_theorem(implies(implies(a,implies(not(not(a)),a)),implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(18,plain,
is_a_theorem(implies(implies(a,implies(not(not(a)),a)),implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))),
inference(unit_resolution,[status(thm)],[17,16]) ).
tff(19,plain,
^ [Y: $i,X: $i] :
refl(( ( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
<=> ( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) )),
inference(bind,[status(th)],[]) ).
tff(20,plain,
( ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
<=> ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(quant_intro,[status(thm)],[19]) ).
tff(21,plain,
( ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
<=> ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(22,plain,
^ [Y: $i,X: $i] :
trans(monotonicity(rewrite(( ( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
<=> ( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) )),
( ( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) )
<=> ( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ) )),
rewrite(( ( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) )
<=> ( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) )),
( ( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) )
<=> ( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) )),
inference(bind,[status(th)],[]) ).
tff(23,plain,
( ! [Y: $i,X: $i] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) )
<=> ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(quant_intro,[status(thm)],[22]) ).
tff(24,axiom,
! [Y: $i,X: $i] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
tff(25,plain,
! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(modus_ponens,[status(thm)],[24,23]) ).
tff(26,plain,
! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(modus_ponens,[status(thm)],[25,21]) ).
tff(27,plain,
! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(skolemize,[status(sab)],[26]) ).
tff(28,plain,
! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(modus_ponens,[status(thm)],[27,20]) ).
tff(29,plain,
( ( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(a,implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(a,implies(not(not(a)),a)),implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))) )
<=> ( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(a,implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(a,implies(not(not(a)),a)),implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(30,plain,
( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(a,implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(a,implies(not(not(a)),a)),implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(31,plain,
( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(a,implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(a,implies(not(not(a)),a)),implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a)))) ),
inference(modus_ponens,[status(thm)],[30,29]) ).
tff(32,plain,
is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a))),
inference(unit_resolution,[status(thm)],[31,28,18,9]) ).
tff(33,plain,
^ [Y: $i,X: $i] :
refl(( is_a_theorem(implies(X,implies(not(X),Y)))
<=> is_a_theorem(implies(X,implies(not(X),Y))) )),
inference(bind,[status(th)],[]) ).
tff(34,plain,
( ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y)))
<=> ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y))) ),
inference(quant_intro,[status(thm)],[33]) ).
tff(35,plain,
( ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y)))
<=> ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y))) ),
inference(rewrite,[status(thm)],[]) ).
tff(36,axiom,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
tff(37,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y))),
inference(modus_ponens,[status(thm)],[36,35]) ).
tff(38,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y))),
inference(skolemize,[status(sab)],[37]) ).
tff(39,plain,
! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y))),
inference(modus_ponens,[status(thm)],[38,34]) ).
tff(40,plain,
( ~ ! [Y: $i,X: $i] : is_a_theorem(implies(X,implies(not(X),Y)))
| is_a_theorem(implies(not(a),implies(not(not(a)),a))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(41,plain,
is_a_theorem(implies(not(a),implies(not(not(a)),a))),
inference(unit_resolution,[status(thm)],[40,39]) ).
tff(42,plain,
( ~ is_a_theorem(implies(not(not(a)),a))
<=> ~ is_a_theorem(implies(not(not(a)),a)) ),
inference(rewrite,[status(thm)],[]) ).
tff(43,axiom,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_39) ).
tff(44,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(modus_ponens,[status(thm)],[43,42]) ).
tff(45,plain,
( ( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(not(not(a)),a))
| ~ is_a_theorem(implies(not(a),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a))) )
<=> ( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(not(not(a)),a))
| ~ is_a_theorem(implies(not(a),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(46,plain,
( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(not(not(a)),a))
| ~ is_a_theorem(implies(not(a),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(47,plain,
( ~ ! [Y: $i,X: $i] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) )
| is_a_theorem(implies(not(not(a)),a))
| ~ is_a_theorem(implies(not(a),implies(not(not(a)),a)))
| ~ is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a))) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
$false,
inference(unit_resolution,[status(thm)],[47,28,44,41,32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_E %s %d THM
% 0.06/0.34 % Computer : n007.cluster.edu
% 0.06/0.34 % Model : x86_64 x86_64
% 0.06/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.34 % Memory : 8046.5625MB
% 0.06/0.34 % OS : Linux 6.8.0-71-generic
% 0.06/0.34 % CPULimit : 300
% 0.06/0.34 % WCLimit : 300
% 0.06/0.34 % DateTime : Sat Sep 5 09:22:11 UTC 2026
% 0.06/0.34 % CPUTime :
% 0.13/0.40 % SZS status Unsatisfiable
% 0.13/0.40 % SZS output start Proof
% See solution above
% 0.13/0.40 % E exiting
%------------------------------------------------------------------------------