%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN979+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n012.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:27 PM UTC 2026
% Result : Theorem 0.08s 11.86s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 59 ( 6 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 58 ( 13 ~; 7 |; 30 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 22 ( 8 sgn 8 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [A,B] :
? [X,Y] :
( ( s(A)
& ( s(A)
=> p(X,Y) )
& r(B)
& r(A)
& ( r(Y)
=> p(B,Y) )
& q(B)
& q(A)
& ( q(X)
=> p(X,A) ) )
=> p(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ! [A,B] :
? [X,Y] :
( ( s(A)
& ( s(A)
=> p(X,Y) )
& r(B)
& r(A)
& ( r(Y)
=> p(B,Y) )
& q(B)
& q(A)
& ( q(X)
=> p(X,A) ) )
=> p(A,B) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [A,B] :
! [X,Y] :
( ~ p(A,B)
& s(A)
& ( p(X,Y)
| ~ s(A) )
& r(B)
& r(A)
& ( p(B,Y)
| ~ r(Y) )
& q(B)
& q(A)
& ( p(X,A)
| ~ q(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y] :
( ~ p(sk0,sk1)
& s(sk0)
& ( p(X,Y)
| ~ s(sk0) )
& r(sk1)
& r(sk0)
& ( p(sk1,Y)
| ~ r(Y) )
& q(sk1)
& q(sk0)
& ( p(X,sk0)
| ~ q(X) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c6,plain,
( p(X2,X3)
| ~ s(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi6,negated_conjecture,
ifeq(s(sk0),true,p(X0,X1),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(c7,plain,
s(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi7,negated_conjecture,
s(sk0) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(t5,plain,
p(X1,X2) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi7]) ).
cnf(t14,plain,
p(X1,X2) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(c8,plain,
~ p(sk0,sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
p(sk0,sk1) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t14]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN979+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.03/11.36 % Computer : n012.cluster.edu
% 0.03/11.36 % Model : x86_64 x86_64
% 0.03/11.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/11.36 % Memory : 8046.5625MB
% 0.03/11.36 % OS : Linux 6.8.0-71-generic
% 0.03/11.36 % CPULimit : 300
% 0.03/11.36 % WCLimit : 300
% 0.03/11.36 % DateTime : Fri Sep 25 02:42:05 UTC 2026
% 0.03/11.36 % CPUTime :
% 0.03/11.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/11.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/11.86 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------