%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN358+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 : n016.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:34:29 PM UTC 2026
% Result : Theorem 1.93s 11.35s
% Output : Proof 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 54 ( 22 ~; 18 |; 12 &)
% ( 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 : 15 ( 5 sgn 3 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ? [X] :
( big_q(X)
& p )
<=> ( ? [X] : big_q(X)
& p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2109) ).
fof(f0_neg,negated_conjecture,
~ ( ? [X] :
( big_q(X)
& p )
<=> ( ? [X] : big_q(X)
& p ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ? [X] : big_q(X)
& p
& ! [X] :
( ~ big_q(X)
| ~ p ) )
| ( ( ! [X] : ~ big_q(X)
| ~ p )
& ? [X] :
( big_q(X)
& p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ( big_q(sk1)
& p
& ( ~ big_q(X)
| ~ p ) )
| ( ( ~ big_q(X)
| ~ p )
& big_q(sk0)
& p ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c6,plain,
( ~ big_q(X0)
| ~ p
| ~ big_q(X0)
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p16,plain,
( ~ p
| ~ big_q(X0)
| ~ p ),
inference(factoring,[status(thm)],[c6]) ).
cnf(p17,plain,
( ~ big_q(X0)
| ~ p ),
inference(factoring,[status(thm)],[p16]) ).
cnf(c1,plain,
( p
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
p,
inference(factoring,[status(thm)],[c1]) ).
cnf(p18,plain,
~ big_q(X0),
inference(resolution,[status(thm)],[p17,p9]) ).
cnf(c3,plain,
( ~ big_q(X0)
| ~ p
| big_q(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p10,plain,
( ~ big_q(X0)
| big_q(sk0) ),
inference(resolution,[status(thm)],[c3,p9]) ).
cnf(c5,plain,
( big_q(sk1)
| big_q(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p11,plain,
( big_q(sk0)
| big_q(sk0) ),
inference(resolution,[status(thm)],[p10,c5]) ).
cnf(p12,plain,
big_q(sk0),
inference(factoring,[status(thm)],[p11]) ).
cnf(p19,plain,
$false,
inference(resolution,[status(thm)],[p18,p12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN358+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/10.60 % Computer : n016.cluster.edu
% 0.11/10.60 % Model : x86_64 x86_64
% 0.11/10.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.60 % Memory : 8046.5625MB
% 0.11/10.60 % OS : Linux 6.8.0-71-generic
% 0.11/10.60 % CPULimit : 300
% 0.11/10.60 % WCLimit : 300
% 0.11/10.60 % DateTime : Fri Sep 25 01:03:26 UTC 2026
% 0.11/10.60 % CPUTime :
% 0.11/10.60 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.93/11.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.93/11.35 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------