%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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 : Sun Sep 27 07:45:52 AM UTC 2026
% Result : Unsatisfiable 0.15s 5.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 35 ~; 29 |; 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 : 28 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_15,axiom,
! [VAR_0] :
( ~ e(VAR_0)
| c(VAR_0) ),
file('theBenchmark.p',clause_15) ).
cnf(c_1,plain,
( ~ e(A)
| c(A) ),
inference(clausify,[status(thm)],[clause_15]) ).
fof(clause_1,axiom,
e(exist),
file('theBenchmark.p',clause_1) ).
cnf(c_2,plain,
e(exist),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_2,axiom,
f(exist),
file('theBenchmark.p',clause_2) ).
cnf(c_3,plain,
f(exist),
inference(clausify,[status(thm)],[clause_2]) ).
fof(clause_16,axiom,
! [VAR_0] :
( ~ f(VAR_0)
| d(VAR_0) ),
file('theBenchmark.p',clause_16) ).
cnf(c_4,plain,
( ~ f(A)
| d(A) ),
inference(clausify,[status(thm)],[clause_16]) ).
fof(clause_3,axiom,
! [VAR_0] :
( ~ c(VAR_0)
| s2least(VAR_0) ),
file('theBenchmark.p',clause_3) ).
cnf(c_6,plain,
( ~ c(A)
| s2least(A) ),
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_5,axiom,
! [VAR_0] :
( ~ equalish(u1r2(VAR_0),u1r1(VAR_0))
| ~ s2least(VAR_0) ),
file('theBenchmark.p',clause_5) ).
cnf(c_7,plain,
( ~ equalish(u1r2(A),u1r1(A))
| ~ s2least(A) ),
inference(clausify,[status(thm)],[clause_5]) ).
fof(clause_6,axiom,
! [VAR_0] :
( ~ s2least(VAR_0)
| s(VAR_0,u1r1(VAR_0)) ),
file('theBenchmark.p',clause_6) ).
cnf(c_8,plain,
( ~ s2least(A)
| s(A,u1r1(A)) ),
inference(clausify,[status(thm)],[clause_6]) ).
fof(clause_7,axiom,
! [VAR_0] :
( ~ s2least(VAR_0)
| s(VAR_0,u1r2(VAR_0)) ),
file('theBenchmark.p',clause_7) ).
cnf(c_9,plain,
( ~ s2least(A)
| s(A,u1r2(A)) ),
inference(clausify,[status(thm)],[clause_7]) ).
cnf(c_11,plain,
( ~ c(A)
| s(A,u1r2(A)) ),
inference(resolve,[status(thm)],[c_9,c_6]) ).
cnf(c_13,plain,
( ~ c(A)
| s(A,u1r1(A)) ),
inference(resolve,[status(thm)],[c_8,c_6]) ).
cnf(c_14,plain,
( ~ c(A)
| ~ equalish(u1r2(A),u1r1(A)) ),
inference(resolve,[status(thm)],[c_7,c_6]) ).
cnf(c_15,plain,
c(exist),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(clause_9,axiom,
! [VAR_0] :
( ~ d(VAR_0)
| s1most(VAR_0) ),
file('theBenchmark.p',clause_9) ).
cnf(c_17,plain,
( ~ d(A)
| s1most(A) ),
inference(clausify,[status(thm)],[clause_9]) ).
fof(clause_11,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ s(VAR_2,VAR_1)
| ~ s(VAR_2,VAR_0)
| ~ s1most(VAR_2)
| equalish(VAR_0,VAR_1) ),
file('theBenchmark.p',clause_11) ).
cnf(c_18,plain,
( ~ s(C,B)
| ~ s(C,A)
| ~ s1most(C)
| equalish(A,B) ),
inference(clausify,[status(thm)],[clause_11]) ).
cnf(c_22,plain,
( ~ d(C)
| ~ s(C,B)
| ~ s(C,A)
| equalish(A,B) ),
inference(resolve,[status(thm)],[c_18,c_17]) ).
cnf(c_26,plain,
d(exist),
inference(resolve,[status(thm)],[c_3,c_4]) ).
cnf(c_27,plain,
( ~ s(exist,B)
| ~ s(exist,A)
| equalish(A,B) ),
inference(resolve,[status(thm)],[c_26,c_22]) ).
cnf(c_31,plain,
s(exist,u1r2(exist)),
inference(resolve,[status(thm)],[c_15,c_11]) ).
cnf(c_32,plain,
s(exist,u1r1(exist)),
inference(resolve,[status(thm)],[c_15,c_13]) ).
cnf(c_33,plain,
~ equalish(u1r2(exist),u1r1(exist)),
inference(resolve,[status(thm)],[c_15,c_14]) ).
cnf(c_58,plain,
( ~ s(exist,u1r1(exist))
| ~ s(exist,u1r2(exist)) ),
inference(resolve,[status(thm)],[c_27,c_33]) ).
cnf(c_59,plain,
~ s(exist,u1r2(exist)),
inference(resolve,[status(thm)],[c_58,c_32]) ).
cnf(c_57,plain,
$false,
inference(resolve,[status(thm)],[c_31,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS003-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.38 % Computer : n017.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Fri Sep 25 19:27:37 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.39 % Process 2976725 was started by sandbox2 on n017,
% 0.11/5.39 % Fri Sep 25 19:27:37 2026
% 0.11/5.39 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/5.39
% 0.11/5.39 % From the command line: assign(max_seconds, 300).
% 0.15/5.40
% 0.15/5.40 % SZS status Unsatisfiable for theBenchmark
% 0.15/5.40
% 0.15/5.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/5.40 % Length of proof is 21.
% 0.15/5.40 % Level of proof is 3.
% 0.15/5.40 % Maximum clause weight is 9.000.
% 0.15/5.40 % Given clauses 7.
% 0.15/5.40
% 0.15/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------