%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN053+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/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 03:33:36 PM UTC 2026
% Result : Theorem 2.54s 0.77s
% Output : Proof 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 3 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 45 ( 15 ~; 20 |; 8 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 14 ( 4 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] :
( big_f(X)
| p )
<=> ( ! [X1] : big_f(X1)
| p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel23) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] :
( big_f(X)
| p )
<=> ( ! [X1] : big_f(X1)
| p ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ( ! [X1] : big_f(X1)
| p )
& ? [X] :
( ~ big_f(X)
& ~ p ) )
| ( ? [X1] : ~ big_f(X1)
& ~ p
& ! [X] :
( big_f(X)
| p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,X1] :
( ( ( big_f(X1)
| p )
& ~ big_f(sk1)
& ~ p )
| ( ~ big_f(sk0)
& ~ p
& ( big_f(X)
| p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c2,plain,
( big_f(X1)
| p
| big_f(X0)
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p11,plain,
( p
| big_f(X0)
| p ),
inference(factoring,[status(thm)],[c2]) ).
cnf(p12,plain,
( big_f(X0)
| p ),
inference(factoring,[status(thm)],[p11]) ).
cnf(c7,plain,
( ~ big_f(sk1)
| ~ big_f(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p13,plain,
( ~ big_f(sk1)
| p ),
inference(resolution,[status(thm)],[p12,c7]) ).
cnf(p14,plain,
( p
| p ),
inference(resolution,[status(thm)],[p13,p12]) ).
cnf(p15,plain,
p,
inference(factoring,[status(thm)],[p14]) ).
cnf(c3,plain,
( ~ p
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
~ p,
inference(factoring,[status(thm)],[c3]) ).
cnf(p16,plain,
$false,
inference(resolution,[status(thm)],[p15,p9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN053+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.34 % Computer : n013.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Thu Sep 24 23:56:51 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.54/0.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.54/0.77 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------