%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL040-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n001.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 : Fri Sep 25 02:00:44 PM UTC 2026
% Result : Unsatisfiable 14.79s 2.36s
% Output : Proof 14.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 29 unt; 0 def)
% Number of atoms : 41 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 35 ( 3 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f0,axiom,
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f0_nnf,plain,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(is_a_theorem(implies(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f1,axiom,
is_a_theorem(implies(X,implies(Y,X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
fof(f1_nnf,plain,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
is_a_theorem(implies(X0,implies(X1,X0))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h10,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(implies(a,b),implies(a,c)),implies(b,implies(implies(a,b),implies(a,c)))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,hi1]) ).
cnf(f2,axiom,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
fof(f2_nnf,plain,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h11,plain,
is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))),implies(implies(a,implies(b,c)),implies(b,implies(implies(a,b),implies(a,c)))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi2,h10]) ).
cnf(h12,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(implies(a,b),implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h11,hi2]) ).
cnf(h4,plain,
is_a_theorem(implies(b,implies(a,b))) = true,
inference(hyper_resolution,[status(thm)],[hi1]) ).
cnf(h6,plain,
is_a_theorem(implies(implies(b,implies(implies(a,b),implies(a,c))),implies(b,implies(a,b)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,h4]) ).
cnf(h5,plain,
is_a_theorem(implies(implies(implies(b,implies(implies(a,b),implies(a,c))),implies(b,implies(a,b))),implies(implies(b,implies(implies(a,b),implies(a,c))),implies(b,implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi2,hi2]) ).
cnf(h7,plain,
is_a_theorem(implies(implies(b,implies(implies(a,b),implies(a,c))),implies(b,implies(a,c)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h5,h6]) ).
cnf(h8,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(b,implies(implies(a,b),implies(a,c))),implies(b,implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,h7]) ).
cnf(h9,plain,
is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(b,implies(implies(a,b),implies(a,c)))),implies(implies(a,implies(b,c)),implies(b,implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi2,h8]) ).
cnf(t5,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h9,h12]) ).
cnf(t13,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(f6,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_21) ).
fof(f6_nnf,plain,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))) != true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t13]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL040-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 21:48:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 14.79/2.36 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.79/2.36 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------