%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL043-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:45 PM UTC 2026
% Result : Unsatisfiable 4.09s 1.06s
% Output : Proof 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 27 unt; 0 def)
% Number of atoms : 39 ( 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; 2 con; 0-4 aty)
% Number of variables : 40 ( 6 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,axiom,
is_a_theorem(implies(X,implies(Y,X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
fof(f2_nnf,plain,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
is_a_theorem(implies(X0,implies(X1,X0))) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h0,plain,
is_a_theorem(implies(a,implies(not(not(a)),a))) = true,
inference(hyper_resolution,[status(thm)],[hi2]) ).
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(f5,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).
fof(f5_nnf,plain,
! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi5,axiom,
is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(h1,plain,
is_a_theorem(implies(implies(not(a),implies(not(not(a)),a)),implies(not(not(a)),a))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi5,h0]) ).
cnf(f1,axiom,
is_a_theorem(implies(X,implies(not(X),Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
fof(f1_nnf,plain,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
is_a_theorem(implies(X0,implies(not(X0),X1))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t2,plain,
is_a_theorem(implies(not(not(a)),a)) = true,
inference(hyper_resolution,[status(thm)],[hi0,h1,hi1]) ).
cnf(t14,plain,
is_a_theorem(implies(not(not(a)),a)) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(f6,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).
fof(f6_nnf,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(implies(not(not(a)),a)) != true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t14]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL043-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.52 % Computer : n001.cluster.edu
% 0.10/0.52 % Model : x86_64 x86_64
% 0.10/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.52 % Memory : 8046.5625MB
% 0.10/0.52 % OS : Linux 6.8.0-71-generic
% 0.10/0.52 % CPULimit : 300
% 0.10/0.52 % WCLimit : 300
% 0.10/0.52 % DateTime : Wed Sep 23 21:48:22 UTC 2026
% 0.10/0.53 % CPUTime :
% 0.10/0.53 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.09/1.06 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.09/1.06 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------