%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN382+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:33 PM UTC 2026
% Result : Theorem 0.14s 0.90s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 7 ~; 7 |; 4 &)
% ( 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-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 23 ( 3 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [Z] :
? [X] :
( big_q(X,Z)
| ! [Y] : big_p(X,Y) )
=> ! [Y] :
? [X] :
( big_q(X,Y)
| big_p(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2134) ).
fof(f0_neg,negated_conjecture,
~ ( ! [Z] :
? [X] :
( big_q(X,Z)
| ! [Y] : big_p(X,Y) )
=> ! [Y] :
? [X] :
( big_q(X,Y)
| big_p(X,Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ? [Y] :
! [X] :
( ~ big_q(X,Y)
& ~ big_p(X,Y) )
& ! [Z] :
? [X] :
( big_q(X,Z)
| ! [Y] : big_p(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Z,Y,X] :
( ~ big_q(X,sk1)
& ~ big_p(X,sk1)
& ( big_q(sk0(Z),Z)
| big_p(sk0(Z),Y) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c0,plain,
( big_q(sk0(X0),X0)
| big_p(sk0(X0),X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c1,plain,
~ big_p(X1,sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p3,plain,
big_q(sk0(X0),X0),
inference(resolution,[status(thm)],[c0,c1]) ).
cnf(c2,plain,
~ big_q(X1,sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p4,plain,
$false,
inference(resolution,[status(thm)],[p3,c2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN382+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 01:07:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.90 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------