%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : KRS003-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 : n002.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:53 PM UTC 2026
% Result : Unsatisfiable 5.13s 1.20s
% Output : Proof 5.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 91 ( 48 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f10,axiom,
( ~ s(X1,X2)
| ~ s(X1,X3)
| ~ s1most(X1)
| equalish(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
fof(f10_nnf,plain,
! [X3,X2,X1] :
( ~ s(X1,X2)
| ~ s(X1,X3)
| ~ s1most(X1)
| equalish(X3,X2) ),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
! [X3,X2,X1] :
( ~ s(X1,X2)
| ~ s(X1,X3)
| ~ s1most(X1)
| equalish(X3,X2) ),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
( ~ s(X2,X1)
| ~ s(X2,X0)
| ~ s1most(X2)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(f15,axiom,
( ~ f(X1)
| d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
fof(f15_nnf,plain,
! [X1] :
( ~ f(X1)
| d(X1) ),
inference(nnf_transformation,[status(thm)],[f15]) ).
fof(f15_sk,plain,
! [X1] :
( ~ f(X1)
| d(X1) ),
inference(skolemisation,[status(esa)],[f15_nnf]) ).
cnf(c15,plain,
( ~ f(X0)
| d(X0) ),
inference(cnf_transformation,[status(esa)],[f15_sk]) ).
cnf(f1,negated_conjecture,
f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f1_nnf,plain,
f(exist),
inference(nnf_transformation,[status(thm)],[f1]) ).
cnf(c1,plain,
f(exist),
inference(cnf_transformation,[status(esa)],[f1_nnf]) ).
cnf(p20,plain,
d(exist),
inference(resolution,[status(thm)],[c15,c1]) ).
cnf(f8,axiom,
( ~ d(X1)
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
fof(f8_nnf,plain,
! [X1] :
( ~ d(X1)
| s1most(X1) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [X1] :
( ~ d(X1)
| s1most(X1) ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
( ~ d(X0)
| s1most(X0) ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p22,plain,
s1most(exist),
inference(resolution,[status(thm)],[p20,c8]) ).
cnf(p29,plain,
( ~ s(exist,X1)
| ~ s(exist,X0)
| equalish(X0,X1) ),
inference(resolution,[status(thm)],[c10,p22]) ).
cnf(f6,axiom,
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f6_nnf,plain,
! [X1] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
! [X1] :
( ~ s2least(X1)
| s(X1,u1r2(X1)) ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
( ~ s2least(X0)
| s(X0,u1r2(X0)) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(f14,axiom,
( ~ e(X1)
| c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
fof(f14_nnf,plain,
! [X1] :
( ~ e(X1)
| c(X1) ),
inference(nnf_transformation,[status(thm)],[f14]) ).
fof(f14_sk,plain,
! [X1] :
( ~ e(X1)
| c(X1) ),
inference(skolemisation,[status(esa)],[f14_nnf]) ).
cnf(c14,plain,
( ~ e(X0)
| c(X0) ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
cnf(f0,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
e(exist),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
e(exist),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(p16,plain,
c(exist),
inference(resolution,[status(thm)],[c14,c0]) ).
cnf(f2,axiom,
( ~ c(X1)
| s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
! [X1] :
( ~ c(X1)
| s2least(X1) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X1] :
( ~ c(X1)
| s2least(X1) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ c(X0)
| s2least(X0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p17,plain,
s2least(exist),
inference(resolution,[status(thm)],[p16,c2]) ).
cnf(p21,plain,
s(exist,u1r2(exist)),
inference(resolution,[status(thm)],[c6,p17]) ).
cnf(p32,plain,
( ~ s(exist,X0)
| equalish(u1r2(exist),X0) ),
inference(resolution,[status(thm)],[p29,p21]) ).
cnf(f5,axiom,
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f5_nnf,plain,
! [X1] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X1] :
( ~ s2least(X1)
| s(X1,u1r1(X1)) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
( ~ s2least(X0)
| s(X0,u1r1(X0)) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(p19,plain,
s(exist,u1r1(exist)),
inference(resolution,[status(thm)],[p17,c5]) ).
cnf(p37,plain,
equalish(u1r2(exist),u1r1(exist)),
inference(resolution,[status(thm)],[p32,p19]) ).
cnf(f4,axiom,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f4_nnf,plain,
! [X1] :
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
! [X1] :
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ s2least(X1) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p18,plain,
~ equalish(u1r2(exist),u1r1(exist)),
inference(resolution,[status(thm)],[p17,c4]) ).
cnf(p38,plain,
$false,
inference(resolution,[status(thm)],[p37,p18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n002.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 19:16:19 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.13/1.20 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.13/1.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------