%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL035-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 : n014.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:43 PM UTC 2026
% Result : Unsatisfiable 5.57s 1.19s
% Output : Proof 5.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 19 unt; 0 def)
% Number of atoms : 31 ( 10 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 : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 51 ( 19 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(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_CAMeredith) ).
fof(f1_nnf,plain,
! [X,Y,Z,U,V] : is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y,Z,U,V] : is_a_theorem(implies(implies(implies(implies(implies(X,Y),implies(Z,falsehood)),U),V),implies(implies(V,X),implies(Z,X)))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h0,plain,
is_a_theorem(implies(implies(implies(implies(V0,V1),implies(V2,V1)),implies(V1,V3)),implies(V4,implies(V1,V3)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,hi1]) ).
cnf(h2,plain,
is_a_theorem(implies(implies(implies(V0,implies(falsehood,V1)),V2),implies(V3,V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,h0]) ).
cnf(h8,plain,
is_a_theorem(implies(V0,implies(V1,implies(falsehood,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h2,h2]) ).
cnf(h12,plain,
is_a_theorem(implies(V0,implies(falsehood,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h8,h8]) ).
cnf(t0,plain,
is_a_theorem(implies(falsehood,X1)) = true,
inference(hyper_resolution,[status(thm)],[hi0,h12,h12]) ).
cnf(t33,plain,
is_a_theorem(implies(falsehood,X1)) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(f2,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_4) ).
fof(f2_nnf,plain,
~ is_a_theorem(implies(falsehood,a)),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
~ is_a_theorem(implies(falsehood,a)),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
~ is_a_theorem(implies(falsehood,a)),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(implies(falsehood,a)) != true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t33]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL035-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 21:40:47 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.57/1.19 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.57/1.19 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------