%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL103-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n008.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:56 PM UTC 2026
% Result : Unsatisfiable 16.09s 2.45s
% Output : Proof 16.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 37 unt; 0 def)
% Number of atoms : 49 ( 24 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 : 112 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f0,axiom,
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(equivalent(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(equivalent(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(equivalent(X,Y)) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(is_a_theorem(equivalent(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(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),equivalent(equivalent(X,U),Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p_1) ).
fof(f1_nnf,plain,
! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),equivalent(equivalent(X,U),Z)))),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,Y),equivalent(equivalent(X,U),Z)))),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_3) ).
fof(f2_nnf,plain,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h0,plain,
is_a_theorem(equivalent(equivalent(V0,equivalent(equivalent(V1,V2),V3)),equivalent(equivalent(equivalent(V2,V1),V0),V3))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,hi2]) ).
cnf(h1,plain,
is_a_theorem(equivalent(equivalent(equivalent(V0,equivalent(V1,V2)),equivalent(V0,equivalent(equivalent(V2,V1),V3))),V3)) = true,
inference(hyper_resolution,[status(thm)],[hi0,h0,h0]) ).
cnf(h3,plain,
is_a_theorem(equivalent(V0,V0)) = true,
inference(hyper_resolution,[status(thm)],[hi0,h1,hi1]) ).
cnf(h4,plain,
is_a_theorem(equivalent(equivalent(V0,V1),equivalent(equivalent(V2,V0),equivalent(V2,V1)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,h3]) ).
cnf(h6,plain,
is_a_theorem(equivalent(equivalent(equivalent(V0,V1),equivalent(V0,V2)),equivalent(V1,V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h0,h4]) ).
cnf(h13,plain,
is_a_theorem(equivalent(V0,equivalent(equivalent(V1,V1),V0))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h6,hi1]) ).
cnf(h5,plain,
is_a_theorem(equivalent(equivalent(V0,equivalent(V1,V2)),equivalent(V0,equivalent(equivalent(V3,V1),equivalent(V3,V2))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h4,h4]) ).
cnf(h163,plain,
is_a_theorem(equivalent(V0,equivalent(equivalent(V1,equivalent(V2,V2)),equivalent(V1,V0)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h5,h13]) ).
cnf(h173,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(V0,V0),V1),V2),equivalent(V1,V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h0,h163]) ).
cnf(h206,plain,
is_a_theorem(equivalent(V0,equivalent(equivalent(V1,V2),equivalent(equivalent(V2,V1),V0)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h173,hi1]) ).
cnf(h11,plain,
is_a_theorem(equivalent(equivalent(V0,equivalent(V1,V2)),equivalent(equivalent(equivalent(V1,V3),V0),equivalent(V3,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi1,h6]) ).
cnf(h242,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(V0,V1),V2),V3),equivalent(V2,equivalent(equivalent(V1,V0),V3)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h11,h206]) ).
cnf(h377,plain,
is_a_theorem(equivalent(V0,equivalent(equivalent(V1,V2),equivalent(equivalent(V3,V1),equivalent(equivalent(V2,V3),V0))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h242,hi1]) ).
cnf(h793,plain,
is_a_theorem(equivalent(equivalent(V0,equivalent(V1,equivalent(equivalent(V2,V3),V4))),equivalent(V0,equivalent(equivalent(equivalent(V3,V2),V1),V4)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h4,h0]) ).
cnf(h5663,plain,
is_a_theorem(equivalent(V0,equivalent(equivalent(equivalent(V1,V2),equivalent(V1,V3)),equivalent(equivalent(V3,V2),V0)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h793,h377]) ).
cnf(h5815,plain,
is_a_theorem(equivalent(V0,equivalent(equivalent(equivalent(V1,V2),equivalent(equivalent(V3,V1),equivalent(V3,V2))),V0))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h793,h5663]) ).
cnf(h8,plain,
is_a_theorem(equivalent(equivalent(V0,equivalent(equivalent(V1,V2),equivalent(equivalent(V2,V1),V3))),equivalent(V0,V3))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h4,hi2]) ).
cnf(t160,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)) = true,
inference(hyper_resolution,[status(thm)],[hi0,h8,h5815]) ).
cnf(t435,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)) = true,
inference(orient,[status(thm)],[t160]) ).
cnf(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_2) ).
fof(f3_nnf,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)) != true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t435]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL103-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 21:56:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 16.09/2.45 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.09/2.45 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------