%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KRS017-1 : TPTP v9.3.1. Released v2.0.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 01:52:55 PM UTC 2026
% Result : Unsatisfiable 2.37s 0.71s
% Output : Proof 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 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 : 19 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f3,axiom,
( ~ r(X3,X2)
| ~ r(X1,X2)
| ~ e(X1)
| a(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f3_nnf,plain,
! [X3,X1,X2] :
( ~ r(X3,X2)
| ~ r(X1,X2)
| ~ e(X1)
| a(X3) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X3,X1,X2] :
( ~ r(X3,X2)
| ~ r(X1,X2)
| ~ e(X1)
| a(X3) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( ~ r(X0,X2)
| ~ r(X1,X2)
| ~ e(X1)
| a(X0) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(f0,negated_conjecture,
e(exists),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
e(exists),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
e(exists),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(p9,plain,
( ~ r(X0,X1)
| ~ r(exists,X1)
| a(X0) ),
inference(resolution,[status(thm)],[c3,c0]) ).
cnf(p10,plain,
( ~ r(exists,X0)
| a(exists) ),
inference(factoring,[status(thm)],[p9]) ).
cnf(f2,axiom,
( ~ e(X1)
| r(X1,u0r3(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
! [X1] :
( ~ e(X1)
| r(X1,u0r3(X1)) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X1] :
( ~ e(X1)
| r(X1,u0r3(X1)) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ e(X0)
| r(X0,u0r3(X0)) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p7,plain,
r(exists,u0r3(exists)),
inference(resolution,[status(thm)],[c2,c0]) ).
cnf(p12,plain,
a(exists),
inference(resolution,[status(thm)],[p10,p7]) ).
cnf(f1,negated_conjecture,
~ a(exists),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f1_nnf,plain,
~ a(exists),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
~ a(exists),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
~ a(exists),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p13,plain,
$false,
inference(resolution,[status(thm)],[p12,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KRS017-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Wed Sep 23 19:14:51 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.37/0.71 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.37/0.71 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------