%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN367+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n008.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:31 PM UTC 2026
% Result : Theorem 2.57s 0.78s
% Output : Proof 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 34 ( 12 ~; 8 |; 12 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 3 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] :
( ( big_r(X)
& ~ p )
| ( big_q(X)
& p ) )
=> ( ! [X] : big_r(X)
| ! [X] : big_q(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2118) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] :
( ( big_r(X)
& ~ p )
| ( big_q(X)
& p ) )
=> ( ! [X] : big_r(X)
| ! [X] : big_q(X) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ? [X] : ~ big_r(X)
& ? [X] : ~ big_q(X)
& ! [X] :
( ( big_r(X)
& ~ p )
| ( big_q(X)
& p ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ~ big_r(sk1)
& ~ big_q(sk0)
& ( ( big_r(X)
& ~ p )
| ( big_q(X)
& p ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c1,plain,
( big_r(X0)
| p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c5,plain,
~ big_r(sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p6,plain,
p,
inference(resolution,[status(thm)],[c1,c5]) ).
cnf(c2,plain,
( ~ p
| big_q(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p7,plain,
big_q(X0),
inference(resolution,[status(thm)],[p6,c2]) ).
cnf(c4,plain,
~ big_q(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p8,plain,
$false,
inference(resolution,[status(thm)],[p7,c4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN367+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35 % Computer : n008.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 25 01:00:54 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.57/0.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.57/0.78 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------