%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN969+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 : n004.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:26 PM UTC 2026
% Result : Theorem 3.21s 0.81s
% Output : Proof 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 39 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 34 ( 12 ~; 6 |; 8 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 15 ( 0 sgn 10 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [B] :
( ( r(B)
& ! [X] :
( p(X)
=> q(X) ) )
=> ( ! [Y] :
( r(Y)
=> p(Y) )
=> q(B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ! [B] :
( ( r(B)
& ! [X] :
( p(X)
=> q(X) ) )
=> ( ! [Y] :
( r(Y)
=> p(Y) )
=> q(B) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [B] :
( ~ q(B)
& ! [Y] :
( p(Y)
| ~ r(Y) )
& r(B)
& ! [X] :
( q(X)
| ~ p(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y] :
( ~ q(sk0)
& ( p(Y)
| ~ r(Y) )
& r(sk0)
& ( q(X)
| ~ p(X) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c2,plain,
( p(X2)
| ~ r(X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(r(X0),true,p(X0),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(c1,plain,
r(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
r(sk0) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h0,plain,
p(sk0) = true,
inference(hyper_resolution,[status(thm)],[hi2,hi1]) ).
cnf(c0,plain,
( q(X1)
| ~ p(X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
ifeq(p(X0),true,q(X0),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t1,plain,
q(sk0) = true,
inference(hyper_resolution,[status(thm)],[hi0,h0]) ).
cnf(t13,plain,
q(sk0) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(c3,plain,
~ q(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
q(sk0) != true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t13]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN969+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35 % Computer : n004.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 25 02:40:20 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.21/0.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.21/0.81 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------