%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL469+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 : n003.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:08 PM UTC 2026
% Result : Theorem 24.58s 9.07s
% Output : Proof 24.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 21 unt; 0 def)
% Number of atoms : 61 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 20 ~; 16 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(f31,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or) ).
fof(f31_nnf,plain,
op_or,
inference(nnf_transformation,[status(thm)],[f31]) ).
cnf(c60,plain,
op_or,
inference(cnf_transformation,[status(esa)],[f31_nnf]) ).
cnf(p83,plain,
or(X0,X1) = not(and(not(X0),not(X1))),
inference(resolution,[status(thm)],[c55,c60]) ).
fof(f28,axiom,
( op_implies_and
=> ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f28_nnf,plain,
( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(nnf_transformation,[status(thm)],[f28]) ).
fof(f28_sk,plain,
! [X,Y] :
( implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(skolemisation,[status(esa)],[f28_nnf]) ).
cnf(c57,plain,
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[status(esa)],[f28_sk]) ).
fof(f40,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f40_nnf,plain,
op_implies_and,
inference(nnf_transformation,[status(thm)],[f40]) ).
cnf(c69,plain,
op_implies_and,
inference(cnf_transformation,[status(esa)],[f40_nnf]) ).
cnf(p78,plain,
implies(X0,X1) = not(and(X0,not(X1))),
inference(resolution,[status(thm)],[c57,c69]) ).
cnf(p86,plain,
implies(not(X0),X1) = or(X0,X1),
inference(superposition,[status(thm)],[p83,p78]) ).
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]) ).
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(p74,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(resolution,[status(thm)],[c41,c65]) ).
cnf(p91,plain,
is_a_theorem(implies(X0,or(X0,X1))),
inference(demodulation,[status(thm)],[p86,p74]) ).
fof(f9,axiom,
( or_1
<=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_1) ).
fof(f9_nnf,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,or(X,Y)))
| or_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,or(X,Y)))
| ~ or_1 ) ),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
! [X,Y] :
( ( ~ is_a_theorem(implies(sk19,or(sk19,sk20)))
| or_1 )
& ( is_a_theorem(implies(X,or(X,Y)))
| ~ or_1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk19,sk20])],[f9_nnf]) ).
cnf(c22,plain,
( ~ is_a_theorem(implies(sk19,or(sk19,sk20)))
| or_1 ),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(p101,plain,
or_1,
inference(resolution,[status(thm)],[p91,c22]) ).
fof(f42,conjecture,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f42_neg,negated_conjecture,
~ or_1,
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f42_nnf,plain,
~ or_1,
inference(nnf_transformation,[status(thm)],[f42_neg]) ).
fof(f42_sk,plain,
~ or_1,
inference(skolemisation,[status(esa)],[f42_nnf]) ).
cnf(c71,plain,
~ or_1,
inference(cnf_transformation,[status(esa)],[f42_sk]) ).
cnf(p102,plain,
$false,
inference(resolution,[status(thm)],[p101,c71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL469+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/5.37 % Computer : n003.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Wed Sep 23 23:31:26 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 24.58/9.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.58/9.07 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------