%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL463+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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:02:07 PM UTC 2026
% Result : Theorem 36.46s 5.16s
% Output : Proof 36.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 11
% Syntax : Number of formulae : 81 ( 61 unt; 0 def)
% Number of atoms : 133 ( 43 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 89 ( 37 ~; 31 |; 15 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-4 aty)
% Number of variables : 138 ( 32 sgn 30 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( implies_1
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_1) ).
fof(f3_nnf,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,implies(Y,X)))
| implies_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,X)))
| ~ implies_1 ) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y] :
( ( ~ is_a_theorem(implies(sk6,implies(sk7,sk6)))
| implies_1 )
& ( is_a_theorem(implies(X,implies(Y,X)))
| ~ implies_1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk6,sk7])],[f3_nnf]) ).
cnf(c10,plain,
( ~ is_a_theorem(implies(sk6,implies(sk7,sk6)))
| implies_1 ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(t55,plain,
ifeq(is_a_theorem(implies(sk6,implies(sk7,sk6))),true,implies_1,true) = true,
inference(equality_encoding,[status(esa)],[c10]) ).
fof(f18,axiom,
( cn1
<=> ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn1) ).
fof(f18_nnf,plain,
( ( ? [P,Q,R] : ~ is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))
| cn1 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))
| ~ cn1 ) ),
inference(nnf_transformation,[status(thm)],[f18]) ).
fof(f18_sk,plain,
! [P,Q,R] :
( ( ~ is_a_theorem(implies(implies(sk38,sk39),implies(implies(sk39,sk40),implies(sk38,sk40))))
| cn1 )
& ( is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))
| ~ cn1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk38,sk39,sk40])],[f18_nnf]) ).
cnf(c39,plain,
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ cn1 ),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(hi39,axiom,
ifeq(cn1,true,is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),true) = true,
inference(equality_encoding,[status(esa)],[c39]) ).
fof(f35,axiom,
cn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn1) ).
fof(f35_nnf,plain,
cn1,
inference(nnf_transformation,[status(thm)],[f35]) ).
cnf(c64,plain,
cn1,
inference(cnf_transformation,[status(esa)],[f35_nnf]) ).
cnf(hi64,axiom,
cn1 = true,
inference(equality_encoding,[status(esa)],[c64]) ).
cnf(h5,plain,
is_a_theorem(implies(implies(V0,V1),implies(implies(V1,V2),implies(V0,V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi39,hi64]) ).
fof(f0,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f0_nnf,plain,
( ( ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
| modus_ponens )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( ( ( ~ is_a_theorem(sk1)
& is_a_theorem(implies(sk0,sk1))
& is_a_theorem(sk0) )
| modus_ponens )
& ( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| ~ modus_ponens ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c0,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(modus_ponens,true,ifeq(is_a_theorem(X0),true,ifeq(is_a_theorem(implies(X0,X1)),true,is_a_theorem(X1),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
fof(f34,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_modus_ponens) ).
fof(f34_nnf,plain,
modus_ponens,
inference(nnf_transformation,[status(thm)],[f34]) ).
cnf(c63,plain,
modus_ponens,
inference(cnf_transformation,[status(esa)],[f34_nnf]) ).
cnf(hi63,axiom,
modus_ponens = true,
inference(equality_encoding,[status(esa)],[c63]) ).
cnf(h56,plain,
is_a_theorem(implies(implies(implies(implies(V0,V1),implies(V2,V1)),V3),implies(implies(V2,V0),V3))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h5,h5]) ).
fof(f19,axiom,
( cn2
<=> ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn2) ).
fof(f19_nnf,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(P,implies(not(P),Q)))
| cn2 )
& ( ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q)))
| ~ cn2 ) ),
inference(nnf_transformation,[status(thm)],[f19]) ).
fof(f19_sk,plain,
! [P,Q] :
( ( ~ is_a_theorem(implies(sk41,implies(not(sk41),sk42)))
| cn2 )
& ( is_a_theorem(implies(P,implies(not(P),Q)))
| ~ cn2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk41,sk42])],[f19_nnf]) ).
cnf(c41,plain,
( is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(cnf_transformation,[status(esa)],[f19_sk]) ).
cnf(hi41,axiom,
ifeq(cn2,true,is_a_theorem(implies(X0,implies(not(X0),X1))),true) = true,
inference(equality_encoding,[status(esa)],[c41]) ).
fof(f36,axiom,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(f36_nnf,plain,
cn2,
inference(nnf_transformation,[status(thm)],[f36]) ).
cnf(c65,plain,
cn2,
inference(cnf_transformation,[status(esa)],[f36_nnf]) ).
cnf(hi65,axiom,
cn2 = true,
inference(equality_encoding,[status(esa)],[c65]) ).
cnf(h1,plain,
is_a_theorem(implies(V0,implies(not(V0),V1))) = true,
inference(hyper_resolution,[status(thm)],[hi41,hi65]) ).
cnf(h10,plain,
is_a_theorem(implies(implies(implies(not(V0),V1),V2),implies(V0,V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h1,h5]) ).
fof(f20,axiom,
( cn3
<=> ! [P] : is_a_theorem(implies(implies(not(P),P),P)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn3) ).
fof(f20_nnf,plain,
( ( ? [P] : ~ is_a_theorem(implies(implies(not(P),P),P))
| cn3 )
& ( ! [P] : is_a_theorem(implies(implies(not(P),P),P))
| ~ cn3 ) ),
inference(nnf_transformation,[status(thm)],[f20]) ).
fof(f20_sk,plain,
! [P] :
( ( ~ is_a_theorem(implies(implies(not(sk43),sk43),sk43))
| cn3 )
& ( is_a_theorem(implies(implies(not(P),P),P))
| ~ cn3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk43])],[f20_nnf]) ).
cnf(c43,plain,
( is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ cn3 ),
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
cnf(hi43,axiom,
ifeq(cn3,true,is_a_theorem(implies(implies(not(X0),X0),X0)),true) = true,
inference(equality_encoding,[status(esa)],[c43]) ).
fof(f37,axiom,
cn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn3) ).
fof(f37_nnf,plain,
cn3,
inference(nnf_transformation,[status(thm)],[f37]) ).
cnf(c66,plain,
cn3,
inference(cnf_transformation,[status(esa)],[f37_nnf]) ).
cnf(hi66,axiom,
cn3 = true,
inference(equality_encoding,[status(esa)],[c66]) ).
cnf(h2,plain,
is_a_theorem(implies(implies(not(V0),V0),V0)) = true,
inference(hyper_resolution,[status(thm)],[hi43,hi66]) ).
cnf(h14,plain,
is_a_theorem(implies(V0,V0)) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h2,h10]) ).
cnf(h16,plain,
is_a_theorem(implies(not(implies(V0,V0)),V1)) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h14,h1]) ).
cnf(h17,plain,
is_a_theorem(implies(implies(V0,V1),implies(not(implies(V2,V2)),V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h16,h5]) ).
cnf(h19,plain,
is_a_theorem(implies(V0,implies(not(implies(V1,V1)),V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h17,h10]) ).
cnf(h49,plain,
is_a_theorem(implies(implies(implies(not(implies(V0,V0)),V1),V2),implies(V3,V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h19,h5]) ).
cnf(h69,plain,
is_a_theorem(implies(V0,implies(V1,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h2,h49]) ).
cnf(h74,plain,
is_a_theorem(implies(implies(implies(V0,V0),V1),implies(V2,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h69,h5]) ).
cnf(h9,plain,
is_a_theorem(implies(implies(V0,V1),implies(implies(not(V0),V0),V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h2,h5]) ).
cnf(h80,plain,
is_a_theorem(implies(V0,implies(implies(not(V1),V1),V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h9,h74]) ).
cnf(h94,plain,
is_a_theorem(implies(implies(implies(implies(not(V0),V0),V0),V1),implies(V2,V1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h80,h5]) ).
cnf(h383,plain,
is_a_theorem(implies(implies(V0,implies(not(V1),V1)),implies(V2,implies(V0,V1)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h94,h56]) ).
cnf(h13,plain,
is_a_theorem(implies(V0,implies(implies(V1,V2),implies(not(V0),V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h5,h10]) ).
cnf(h51,plain,
is_a_theorem(implies(implies(implies(implies(V0,V1),implies(not(V2),V1)),V3),implies(V2,V3))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h13,h5]) ).
cnf(h82,plain,
is_a_theorem(implies(implies(implies(V0,V1),V2),implies(implies(implies(V3,V3),V1),V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h74,h5]) ).
cnf(h157,plain,
is_a_theorem(implies(V0,implies(implies(implies(V1,V1),V2),V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h82,h94]) ).
cnf(h165,plain,
is_a_theorem(implies(implies(implies(implies(implies(V0,V0),V1),V1),V2),implies(V3,V2))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h157,h5]) ).
cnf(h231,plain,
is_a_theorem(implies(V0,implies(V1,implies(not(V0),V2)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h165,h51]) ).
cnf(h261,plain,
is_a_theorem(implies(implies(implies(V0,implies(not(V1),V2)),V3),implies(V1,V3))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h231,h5]) ).
cnf(h532,plain,
is_a_theorem(implies(V0,implies(V1,implies(V2,V0)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h383,h261]) ).
cnf(h540,plain,
is_a_theorem(implies(V0,implies(V1,implies(V2,V1)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h532,h383]) ).
cnf(t23,plain,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi63,h540,h540]) ).
cnf(t278,plain,
is_a_theorem(implies(X1,implies(X2,X1))) = true,
inference(orient,[status(thm)],[t23]) ).
cnf(t995,plain,
ifeq(true,true,implies_1,true) = true,
inference(step,[status(thm)],[t55,t278]) ).
cnf(t20,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t256,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t20]) ).
cnf(t996,plain,
implies_1 = true,
inference(step,[status(thm)],[t995,t256]) ).
cnf(t828,plain,
implies_1 = true,
inference(orient,[status(thm)],[t996]) ).
fof(f42,conjecture,
implies_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f42_neg,negated_conjecture,
~ implies_1,
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f42_nnf,plain,
~ implies_1,
inference(nnf_transformation,[status(thm)],[f42_neg]) ).
fof(f42_sk,plain,
~ implies_1,
inference(skolemisation,[status(esa)],[f42_nnf]) ).
cnf(c71,plain,
~ implies_1,
inference(cnf_transformation,[status(esa)],[f42_sk]) ).
cnf(goal_0,negated_conjecture,
true != implies_1,
inference(equality_encoding,[status(esa)],[c71]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t828]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL463+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.43 % Computer : n011.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Wed Sep 23 23:28:29 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 36.46/5.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 36.46/5.16 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------