%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN326-1 : TPTP v9.3.1. Released v1.2.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:34:21 PM UTC 2026
% Result : Unsatisfiable 4.48s 1.09s
% Output : Proof 4.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 19 ( 2 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
( f(X,X)
| g(y(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [X] :
( f(X,X)
| g(y(X)) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( f(X,X)
| g(y(X)) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( f(X0,X0)
| g(y(X0)) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(f6,negated_conjecture,
~ f(z(X),z(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
fof(f6_nnf,plain,
! [X] : ~ f(z(X),z(X)),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [X] : ~ f(z(X),z(X)),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
~ f(z(X0),z(X0)),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p7,plain,
g(y(z(X0))),
inference(resolution,[status(thm)],[c1,c6]) ).
cnf(f4,negated_conjecture,
( h(z(X))
| ~ g(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
fof(f4_nnf,plain,
! [X] :
( h(z(X))
| ~ g(X) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X] :
( h(z(X))
| ~ g(X) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( h(z(X0))
| ~ g(X0) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p9,plain,
h(z(y(z(X0)))),
inference(resolution,[status(thm)],[p7,c4]) ).
cnf(f2,negated_conjecture,
( f(X,X)
| ~ h(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
fof(f2_nnf,plain,
! [X] :
( f(X,X)
| ~ h(X) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] :
( f(X,X)
| ~ h(X) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( f(X0,X0)
| ~ h(X0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p10,plain,
f(z(y(z(X0))),z(y(z(X0)))),
inference(resolution,[status(thm)],[p9,c2]) ).
cnf(p12,plain,
$false,
inference(resolution,[status(thm)],[p10,c6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN326-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n011.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 00:50:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.48/1.09 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.48/1.09 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------