%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n013.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:09 PM UTC 2026
% Result : Theorem 22.53s 3.74s
% Output : Proof 22.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 16 unt; 0 def)
% Number of atoms : 48 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 17 ~; 13 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 3 sgn 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox/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/sandbox/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(f22,axiom,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('/export/starexec/sandbox/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/sandbox/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(p82,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[p80,p77]) ).
fof(f3,axiom,
( implies_1
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
file('/export/starexec/sandbox/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(p85,plain,
implies_1,
inference(resolution,[status(thm)],[p82,c10]) ).
fof(f44,conjecture,
implies_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f44_neg,negated_conjecture,
~ implies_1,
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f44_nnf,plain,
~ implies_1,
inference(nnf_transformation,[status(thm)],[f44_neg]) ).
fof(f44_sk,plain,
~ implies_1,
inference(skolemisation,[status(esa)],[f44_nnf]) ).
cnf(c73,plain,
~ implies_1,
inference(cnf_transformation,[status(esa)],[f44_sk]) ).
cnf(p86,plain,
$false,
inference(resolution,[status(thm)],[p85,c73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL484+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.18/0.43 % Computer : n013.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Wed Sep 23 23:31:36 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 22.53/3.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.53/3.74 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------