%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN051+1 : TPTP v9.3.1. Released v2.0.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 03:33:36 PM UTC 2026
% Result : Theorem 2.77s 1.08s
% Output : Proof 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 33 ( 14 ~; 11 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 2 sgn 2 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X] :
( big_f(X)
=> p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel21_2) ).
fof(f1_nnf,plain,
? [X] :
( p
| ~ big_f(X) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
( p
| ~ big_f(sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f1_nnf]) ).
cnf(c1,plain,
( p
| ~ big_f(sk1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
fof(f2,conjecture,
? [X] :
( p
<=> big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel21) ).
fof(f2_neg,negated_conjecture,
~ ? [X] :
( p
<=> big_f(X) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f2_nnf,plain,
! [X] :
( ( big_f(X)
& ~ p )
| ( ~ big_f(X)
& p ) ),
inference(nnf_transformation,[status(thm)],[f2_neg]) ).
fof(f2_sk,plain,
! [X] :
( ( big_f(X)
& ~ p )
| ( ~ big_f(X)
& p ) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c3,plain,
( big_f(X0)
| p ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p6,plain,
( p
| p ),
inference(resolution,[status(thm)],[c1,c3]) ).
cnf(p7,plain,
p,
inference(factoring,[status(thm)],[p6]) ).
fof(f0,axiom,
? [X] :
( p
=> big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel21_1) ).
fof(f0_nnf,plain,
? [X] :
( big_f(X)
| ~ p ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
( big_f(sk0)
| ~ p ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c0,plain,
( big_f(sk0)
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p8,plain,
big_f(sk0),
inference(resolution,[status(thm)],[p7,c0]) ).
cnf(c4,plain,
( ~ p
| ~ big_f(X0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p9,plain,
~ p,
inference(resolution,[status(thm)],[p8,c4]) ).
cnf(p10,plain,
$false,
inference(resolution,[status(thm)],[p9,p7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN051+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35 % Computer : n005.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 23:56:48 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.77/1.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.77/1.08 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------