%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN052+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 : n026.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.30s 0.76s
% Output : Proof 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 39 ( 14 ~; 11 |; 8 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 13 ( 4 sgn 8 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] :
( p
<=> big_f(X) )
=> ( p
<=> ! [X1] : big_f(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel22) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] :
( p
<=> big_f(X) )
=> ( p
<=> ! [X1] : big_f(X1) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ( ! [X1] : big_f(X1)
& ~ p )
| ( ? [X1] : ~ big_f(X1)
& p ) )
& ! [X] :
( ( ~ big_f(X)
| p )
& ( big_f(X)
| ~ p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,X1] :
( ( ( big_f(X1)
& ~ p )
| ( ~ big_f(sk0)
& p ) )
& ( ~ big_f(X)
| p )
& ( big_f(X)
| ~ p ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c3,plain,
( big_f(X1)
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c1,plain,
( ~ big_f(X0)
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p6,plain,
( p
| p ),
inference(resolution,[status(thm)],[c3,c1]) ).
cnf(p7,plain,
p,
inference(factoring,[status(thm)],[p6]) ).
cnf(c0,plain,
( big_f(X0)
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p8,plain,
big_f(X0),
inference(resolution,[status(thm)],[p7,c0]) ).
cnf(c4,plain,
( ~ p
| ~ big_f(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_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.03 % Problem : SYN052+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 00:00:09 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.30/0.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.30/0.76 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------