%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL076-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n006.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:52 PM UTC 2026
% Result : Unsatisfiable 6.28s 6.21s
% Output : Proof 6.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 32 ( 7 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 : 4 ( 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 : 27 ( 0 sgn 10 !; 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(f3,axiom,
is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).
fof(f3_nnf,plain,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f4,axiom,
is_a_theorem(implies(not(not(X1)),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extra_lemma) ).
fof(f4_nnf,plain,
! [X1] : is_a_theorem(implies(not(not(X1)),X1)),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X1] : is_a_theorem(implies(not(not(X1)),X1)),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
is_a_theorem(implies(not(not(X0)),X0)),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi4,axiom,
is_a_theorem(implies(not(not(X0)),X0)) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t2,plain,
is_a_theorem(implies(X1,not(not(X1)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,hi4]) ).
cnf(t29,plain,
is_a_theorem(implies(X1,not(not(X1)))) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(f5,negated_conjecture,
~ is_a_theorem(implies(a,not(not(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_40) ).
fof(f5_nnf,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
~ is_a_theorem(implies(a,not(not(a)))),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(implies(a,not(not(a)))) != true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t29]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL076-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/5.38 % Computer : n006.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Wed Sep 23 21:50:01 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.28/6.21 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.28/6.21 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------