%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL497+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 : n019.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:10 PM UTC 2026
% Result : Theorem 67.34s 8.99s
% Output : Proof 67.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 85 ( 46 unt; 0 def)
% Number of atoms : 161 ( 12 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 130 ( 54 ~; 50 |; 17 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 127 ( 8 sgn 48 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f29_nnf,plain,
( ! [X,Y] : implies(X,Y) = or(not(X),Y)
| ~ op_implies_or ),
inference(nnf_transformation,[status(thm)],[f29]) ).
fof(f29_sk,plain,
! [X,Y] :
( implies(X,Y) = or(not(X),Y)
| ~ op_implies_or ),
inference(skolemisation,[status(esa)],[f29_nnf]) ).
cnf(c58,plain,
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[status(esa)],[f29_sk]) ).
fof(f31,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f31_nnf,plain,
op_implies_or,
inference(nnf_transformation,[status(thm)],[f31]) ).
cnf(c60,plain,
op_implies_or,
inference(cnf_transformation,[status(esa)],[f31_nnf]) ).
cnf(p80,plain,
implies(X0,X1) = or(not(X0),X1),
inference(resolution,[status(thm)],[c58,c60]) ).
fof(f26,axiom,
( op_or
=> ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f26_nnf,plain,
( ! [X,Y] : or(X,Y) = not(and(not(X),not(Y)))
| ~ op_or ),
inference(nnf_transformation,[status(thm)],[f26]) ).
fof(f26_sk,plain,
! [X,Y] :
( or(X,Y) = not(and(not(X),not(Y)))
| ~ op_or ),
inference(skolemisation,[status(esa)],[f26_nnf]) ).
cnf(c55,plain,
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[status(esa)],[f26_sk]) ).
fof(f41,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or) ).
fof(f41_nnf,plain,
op_or,
inference(nnf_transformation,[status(thm)],[f41]) ).
cnf(c70,plain,
op_or,
inference(cnf_transformation,[status(esa)],[f41_nnf]) ).
cnf(p129,plain,
or(X0,X1) = not(and(not(X0),not(X1))),
inference(resolution,[status(thm)],[c55,c70]) ).
cnf(p131,plain,
implies(X0,X1) = not(and(not(not(X0)),not(X1))),
inference(superposition,[status(thm)],[p80,p129]) ).
cnf(p168,plain,
or(not(X0),X1) = implies(X0,X1),
inference(superposition,[status(thm)],[p131,p129]) ).
fof(f25,axiom,
( r5
<=> ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r5) ).
fof(f25_nnf,plain,
( ( ? [P,Q,R] : ~ is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| r5 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| ~ r5 ) ),
inference(nnf_transformation,[status(thm)],[f25]) ).
fof(f25_sk,plain,
! [Q,R,P] :
( ( ~ is_a_theorem(implies(implies(sk53,sk54),implies(or(sk52,sk53),or(sk52,sk54))))
| r5 )
& ( is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))
| ~ r5 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk52,sk53,sk54])],[f25_nnf]) ).
cnf(c53,plain,
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[status(esa)],[f25_sk]) ).
fof(f39,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(f39_nnf,plain,
r5,
inference(nnf_transformation,[status(thm)],[f39]) ).
cnf(c68,plain,
r5,
inference(cnf_transformation,[status(esa)],[f39_nnf]) ).
cnf(p234,plain,
is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[c53,c68]) ).
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]) ).
fof(f34,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_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(p74,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c0,c63]) ).
fof(f21,axiom,
( r1
<=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r1) ).
fof(f21_nnf,plain,
( ( ? [P] : ~ is_a_theorem(implies(or(P,P),P))
| r1 )
& ( ! [P] : is_a_theorem(implies(or(P,P),P))
| ~ r1 ) ),
inference(nnf_transformation,[status(thm)],[f21]) ).
fof(f21_sk,plain,
! [P] :
( ( ~ is_a_theorem(implies(or(sk44,sk44),sk44))
| r1 )
& ( is_a_theorem(implies(or(P,P),P))
| ~ r1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk44])],[f21_nnf]) ).
cnf(c45,plain,
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[status(esa)],[f21_sk]) ).
fof(f35,axiom,
r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r1) ).
fof(f35_nnf,plain,
r1,
inference(nnf_transformation,[status(thm)],[f35]) ).
cnf(c64,plain,
r1,
inference(cnf_transformation,[status(esa)],[f35_nnf]) ).
cnf(p76,plain,
is_a_theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[c45,c64]) ).
cnf(p87,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(or(X0,X0),X0),X1)) ),
inference(resolution,[status(thm)],[p74,p76]) ).
cnf(p721,plain,
is_a_theorem(implies(or(X0,or(X1,X1)),or(X0,X1))),
inference(resolution,[status(thm)],[p234,p87]) ).
cnf(p741,plain,
is_a_theorem(implies(implies(X0,or(X1,X1)),implies(X0,X1))),
inference(superposition,[status(thm)],[p168,p721]) ).
fof(f22,axiom,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f22_nnf,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(Q,or(P,Q)))
| r2 )
& ( ! [P,Q] : is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(nnf_transformation,[status(thm)],[f22]) ).
fof(f22_sk,plain,
! [Q,P] :
( ( ~ is_a_theorem(implies(sk46,or(sk45,sk46)))
| r2 )
& ( is_a_theorem(implies(Q,or(P,Q)))
| ~ r2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk45,sk46])],[f22_nnf]) ).
cnf(c47,plain,
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
fof(f36,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f36_nnf,plain,
r2,
inference(nnf_transformation,[status(thm)],[f36]) ).
cnf(c65,plain,
r2,
inference(cnf_transformation,[status(esa)],[f36_nnf]) ).
cnf(p77,plain,
is_a_theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c47,c65]) ).
cnf(p88,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(implies(X0,or(X1,X0)),X2)) ),
inference(resolution,[status(thm)],[p74,p77]) ).
cnf(p826,plain,
is_a_theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[p741,p88]) ).
cnf(p828,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X0,X0),X1)) ),
inference(resolution,[status(thm)],[p826,p74]) ).
fof(f23,axiom,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f23_nnf,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(or(P,Q),or(Q,P)))
| r3 )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(nnf_transformation,[status(thm)],[f23]) ).
fof(f23_sk,plain,
! [P,Q] :
( ( ~ is_a_theorem(implies(or(sk47,sk48),or(sk48,sk47)))
| r3 )
& ( is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48])],[f23_nnf]) ).
cnf(c49,plain,
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[status(esa)],[f23_sk]) ).
fof(f37,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f37_nnf,plain,
r3,
inference(nnf_transformation,[status(thm)],[f37]) ).
cnf(c66,plain,
r3,
inference(cnf_transformation,[status(esa)],[f37_nnf]) ).
cnf(p79,plain,
is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c49,c66]) ).
cnf(p83,plain,
is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[p80,p79]) ).
cnf(p833,plain,
is_a_theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[p828,p83]) ).
cnf(p854,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(or(X0,not(X0)),X1)) ),
inference(resolution,[status(thm)],[p833,p74]) ).
cnf(p722,plain,
is_a_theorem(implies(or(X0,X1),or(X0,or(X2,X1)))),
inference(resolution,[status(thm)],[p234,p88]) ).
cnf(p1420,plain,
is_a_theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[status(thm)],[p854,p722]) ).
cnf(p1448,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(or(X0,or(X1,not(X0))),X2)) ),
inference(resolution,[status(thm)],[p1420,p74]) ).
cnf(p89,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(implies(or(X0,X1),or(X1,X0)),X2)) ),
inference(resolution,[status(thm)],[p74,p79]) ).
cnf(p726,plain,
is_a_theorem(implies(or(X0,or(X1,X2)),or(X0,or(X2,X1)))),
inference(resolution,[status(thm)],[p234,p89]) ).
cnf(p9677,plain,
is_a_theorem(or(X0,implies(X0,X1))),
inference(resolution,[status(thm)],[p1448,p726]) ).
cnf(p9680,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(superposition,[status(thm)],[p168,p9677]) ).
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(c42,plain,
( ~ is_a_theorem(implies(sk41,implies(not(sk41),sk42)))
| cn2 ),
inference(cnf_transformation,[status(esa)],[f19_sk]) ).
cnf(p9709,plain,
cn2,
inference(resolution,[status(thm)],[p9680,c42]) ).
fof(f44,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(f44_neg,negated_conjecture,
~ cn2,
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f44_nnf,plain,
~ cn2,
inference(nnf_transformation,[status(thm)],[f44_neg]) ).
fof(f44_sk,plain,
~ cn2,
inference(skolemisation,[status(esa)],[f44_nnf]) ).
cnf(c73,plain,
~ cn2,
inference(cnf_transformation,[status(esa)],[f44_sk]) ).
cnf(p9779,plain,
$false,
inference(resolution,[status(thm)],[p9709,c73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.38 % Computer : n019.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Wed Sep 23 23:34:51 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 67.34/8.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 67.34/8.99 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------