%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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:01:46 PM UTC 2026
% Result : Unsatisfiable 3.03s 0.85s
% Output : Proof 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 17 unt; 0 def)
% Number of atoms : 29 ( 8 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 : 7 ( 7 usr; 5 con; 0-4 aty)
% Number of variables : 25 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f1_nnf,plain,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h0,plain,
is_a_theorem(implies(implies(x,y),implies(implies(y,z),implies(x,z)))) = true,
inference(hyper_resolution,[status(thm)],[hi1]) ).
cnf(f0,axiom,
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
file('/export/starexec/sandbox2/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(h1,plain,
is_a_theorem(implies(implies(implies(implies(y,z),implies(x,z)),implies(implies(implies(x,z),u),implies(implies(y,z),u))),implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,h0]) ).
cnf(t5,plain,
is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h1,hi1]) ).
cnf(t9,plain,
is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(f4,negated_conjecture,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_06) ).
fof(f4_nnf,plain,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))) != true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t9]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n018.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 22:59:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.03/0.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.03/0.85 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------