%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN935+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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:36:21 PM UTC 2026
% Result : Theorem 3.40s 1.08s
% Output : Proof 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 45 ( 17 ~; 14 |; 8 &)
% ( 2 <=>; 4 =>; 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 : 11 ( 1 sgn 5 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ? [X] :
( p(X)
=> c )
<=> ( ! [X] : p(X)
=> c ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ( ? [X] :
( p(X)
=> c )
<=> ( ! [X] : p(X)
=> c ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ( c
| ? [X] : ~ p(X) )
& ! [X] :
( ~ c
& p(X) ) )
| ( ~ c
& ! [X] : p(X)
& ? [X] :
( c
| ~ p(X) ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ( ( c
| ~ p(sk1) )
& ~ c
& p(X) )
| ( ~ c
& p(X)
& ( c
| ~ p(sk0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c2,plain,
( c
| ~ p(sk1)
| c
| ~ p(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p11,plain,
( ~ p(sk1)
| c
| ~ p(sk0) ),
inference(factoring,[status(thm)],[c2]) ).
cnf(c3,plain,
( p(X0)
| p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p10,plain,
p(X0),
inference(factoring,[status(thm)],[c3]) ).
cnf(p12,plain,
( ~ p(sk1)
| c ),
inference(resolution,[status(thm)],[p11,p10]) ).
cnf(p13,plain,
c,
inference(resolution,[status(thm)],[p12,p10]) ).
cnf(c7,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
~ c,
inference(factoring,[status(thm)],[c7]) ).
cnf(p14,plain,
$false,
inference(resolution,[status(thm)],[p13,p9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN935+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 02:35:48 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.40/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.40/1.08 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------