%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN315-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 : n018.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:19 PM UTC 2026
% Result : Unsatisfiable 4.96s 11.19s
% Output : Proof 4.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 17 ( 9 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f3,negated_conjecture,
( f(y(X))
| p(a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
fof(f3_nnf,plain,
! [X] :
( f(y(X))
| p(a) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X] :
( f(y(X))
| p(a) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( f(y(X0))
| p(a) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(f0,negated_conjecture,
( p(a)
| ~ f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
fof(f0_nnf,plain,
! [X] :
( p(a)
| ~ f(X) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] :
( p(a)
| ~ f(X) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( p(a)
| ~ f(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p4,plain,
( p(a)
| p(a) ),
inference(resolution,[status(thm)],[c3,c0]) ).
cnf(p5,plain,
p(a),
inference(factoring,[status(thm)],[p4]) ).
cnf(f1,negated_conjecture,
( f(X)
| ~ p(a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
fof(f1_nnf,plain,
! [X] :
( f(X)
| ~ p(a) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( f(X)
| ~ p(a) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( f(X0)
| ~ p(a) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p6,plain,
f(X0),
inference(resolution,[status(thm)],[p5,c1]) ).
cnf(f2,negated_conjecture,
( ~ p(a)
| ~ f(y(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
fof(f2_nnf,plain,
! [X] :
( ~ p(a)
| ~ f(y(X)) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] :
( ~ p(a)
| ~ f(y(X)) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ p(a)
| ~ f(y(X0)) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p7,plain,
~ p(a),
inference(resolution,[status(thm)],[p6,c2]) ).
cnf(p8,plain,
$false,
inference(resolution,[status(thm)],[p7,p5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN315-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/10.39 % Computer : n018.cluster.edu
% 0.12/10.39 % Model : x86_64 x86_64
% 0.12/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39 % Memory : 8046.5625MB
% 0.12/10.39 % OS : Linux 6.8.0-71-generic
% 0.12/10.39 % CPULimit : 300
% 0.12/10.39 % WCLimit : 300
% 0.12/10.39 % DateTime : Fri Sep 25 00:50:44 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.12/10.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.96/11.19 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.96/11.19 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------