%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN980+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 : n011.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 5.08s 21.14s
% Output : Proof 5.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 13 ~; 11 |; 8 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 2 sgn 9 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [B] :
( ! [Y] :
( ( r(B)
=> r(Y) )
=> p(f(Y),Y) )
=> ? [X,Y] :
( ( q(f(B),B)
=> q(X,Y) )
& p(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ! [B] :
( ! [Y] :
( ( r(B)
=> r(Y) )
=> p(f(Y),Y) )
=> ? [X,Y] :
( ( q(f(B),B)
=> q(X,Y) )
& p(X,Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [B] :
( ! [X,Y] :
( ( ~ q(X,Y)
& q(f(B),B) )
| ~ p(X,Y) )
& ! [Y] :
( p(f(Y),Y)
| ( ~ r(Y)
& r(B) ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y,X] :
( ( ( ~ q(X,Y)
& q(f(sk0),sk0) )
| ~ p(X,Y) )
& ( p(f(Y),Y)
| ( ~ r(Y)
& r(sk0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c2,plain,
( q(f(sk0),sk0)
| ~ p(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c0,plain,
( p(f(X1),X1)
| r(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p5,plain,
( r(sk0)
| q(f(sk0),sk0) ),
inference(resolution,[status(thm)],[c2,c0]) ).
cnf(c3,plain,
( ~ q(X2,X1)
| ~ p(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p4,plain,
( r(sk0)
| ~ q(f(X0),X0) ),
inference(resolution,[status(thm)],[c3,c0]) ).
cnf(p6,plain,
( r(sk0)
| r(sk0) ),
inference(resolution,[status(thm)],[p5,p4]) ).
cnf(p7,plain,
r(sk0),
inference(factoring,[status(thm)],[p6]) ).
cnf(c1,plain,
( p(f(X1),X1)
| ~ r(X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p8,plain,
p(f(sk0),sk0),
inference(resolution,[status(thm)],[p7,c1]) ).
cnf(p10,plain,
q(f(sk0),sk0),
inference(resolution,[status(thm)],[p8,c2]) ).
cnf(p9,plain,
~ q(f(sk0),sk0),
inference(resolution,[status(thm)],[p8,c3]) ).
cnf(p11,plain,
$false,
inference(resolution,[status(thm)],[p10,p9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/20.43 % CPULimit : 300
% 0.08/20.43 % WCLimit : 300
% 0.08/20.43 % DateTime : Fri Sep 25 02:42:42 UTC 2026
% 0.08/20.43 % CPUTime :
% 0.08/20.43 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.08/21.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.08/21.14 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------