%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN930+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n006.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:20 PM UTC 2026
% Result : Theorem 0.14s 16.96s
% Output : Proof 0.14s
% 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 : 6 ( 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 : 12 ( 2 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] :
( c
| p(X) )
<=> ( c
| ! [X] : p(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] :
( c
| p(X) )
<=> ( c
| ! [X] : p(X) ) ),
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(X) )
& ~ c
& ~ p(sk1) )
| ( ~ c
& ~ p(sk0)
& ( c
| p(X) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c2,plain,
( c
| p(X0)
| c
| p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
( c
| c
| p(X0) ),
inference(factoring,[status(thm)],[c2]) ).
cnf(p12,plain,
( c
| p(X0) ),
inference(factoring,[status(thm)],[p9]) ).
cnf(c3,plain,
( ~ p(sk1)
| ~ p(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p13,plain,
( ~ p(sk1)
| c ),
inference(resolution,[status(thm)],[p12,c3]) ).
cnf(p14,plain,
( c
| c ),
inference(resolution,[status(thm)],[p13,p12]) ).
cnf(p15,plain,
c,
inference(factoring,[status(thm)],[p14]) ).
cnf(c7,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p11,plain,
~ c,
inference(factoring,[status(thm)],[c7]) ).
cnf(p16,plain,
$false,
inference(resolution,[status(thm)],[p15,p11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN930+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/16.21 % Computer : n006.cluster.edu
% 0.10/16.21 % Model : x86_64 x86_64
% 0.10/16.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/16.21 % Memory : 8046.5625MB
% 0.10/16.21 % OS : Linux 6.8.0-71-generic
% 0.10/16.21 % CPULimit : 300
% 0.10/16.21 % WCLimit : 300
% 0.10/16.21 % DateTime : Fri Sep 25 02:35:15 UTC 2026
% 0.10/16.22 % CPUTime :
% 0.10/16.22 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/16.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/16.96 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------