%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN733+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n015.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:35:36 PM UTC 2026
% Result : Theorem 3.44s 1.03s
% Output : Proof 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 26 ( 8 ~; 8 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 16 ( 3 sgn 6 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] :
? [Y] :
( ( q(X)
| q(Y) )
& p(X) )
=> ? [Z] :
( q(Z)
& p(Z) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',y2141) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] :
? [Y] :
( ( q(X)
| q(Y) )
& p(X) )
=> ? [Z] :
( q(Z)
& p(Z) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ! [Z] :
( ~ q(Z)
| ~ p(Z) )
& ! [X] :
? [Y] :
( ( q(X)
| q(Y) )
& p(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Z] :
( ( ~ q(Z)
| ~ p(Z) )
& ( q(X)
| q(sk0(X)) )
& p(X) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c1,plain,
( q(X0)
| q(sk0(X0)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c2,plain,
( ~ q(X2)
| ~ p(X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c0,plain,
p(X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p3,plain,
~ q(X0),
inference(resolution,[status(thm)],[c2,c0]) ).
cnf(p4,plain,
q(X0),
inference(resolution,[status(thm)],[c1,p3]) ).
cnf(p5,plain,
$false,
inference(resolution,[status(thm)],[p4,p3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN733+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 02:17:12 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.44/1.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.44/1.03 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------