%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL491+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 : n005.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 5.23s 1.29s
% Output : Proof 5.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 17 unt; 0 def)
% Number of atoms : 41 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 16 ~; 10 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 22 ( 3 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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]) ).
cnf(hi47,axiom,
ifeq(r2,true,is_a_theorem(implies(X0,or(X1,X0))),true) = true,
inference(equality_encoding,[status(esa)],[c47]) ).
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(hi65,axiom,
r2 = true,
inference(equality_encoding,[status(esa)],[c65]) ).
cnf(h3,plain,
is_a_theorem(implies(V0,or(V1,V0))) = true,
inference(hyper_resolution,[status(thm)],[hi47,hi65]) ).
fof(f10,axiom,
( or_2
<=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_2) ).
fof(f10_nnf,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(Y,or(X,Y)))
| or_2 )
& ( ! [X,Y] : is_a_theorem(implies(Y,or(X,Y)))
| ~ or_2 ) ),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
! [Y,X] :
( ( ~ is_a_theorem(implies(sk22,or(sk21,sk22)))
| or_2 )
& ( is_a_theorem(implies(Y,or(X,Y)))
| ~ or_2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk21,sk22])],[f10_nnf]) ).
cnf(c24,plain,
( ~ is_a_theorem(implies(sk22,or(sk21,sk22)))
| or_2 ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(hi24,axiom,
ifeq(is_a_theorem(implies(sk22,or(sk21,sk22))),true,or_2,true) = true,
inference(equality_encoding,[status(esa)],[c24]) ).
cnf(t8,plain,
true = or_2,
inference(hyper_resolution,[status(thm)],[hi24,h3]) ).
cnf(t263,plain,
or_2 = true,
inference(orient,[status(thm)],[t8]) ).
fof(f44,conjecture,
or_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_2) ).
fof(f44_neg,negated_conjecture,
~ or_2,
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f44_nnf,plain,
~ or_2,
inference(nnf_transformation,[status(thm)],[f44_neg]) ).
fof(f44_sk,plain,
~ or_2,
inference(skolemisation,[status(esa)],[f44_nnf]) ).
cnf(c73,plain,
~ or_2,
inference(cnf_transformation,[status(esa)],[f44_sk]) ).
cnf(goal_0,negated_conjecture,
true != or_2,
inference(equality_encoding,[status(esa)],[c73]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t263]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL491+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 23:32:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.23/1.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.23/1.29 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------