%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS069+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.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:58 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 14 unt; 0 def)
% Number of atoms : 110 ( 11 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 121 ( 47 ~; 42 |; 26 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 57 ( 0 sgn 31 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cp1_substitution_1,axiom,
! [A,B] :
( ( cp1(A)
& A = B )
=> cp1(B) ),
file('theBenchmark.p',cp1_substitution_1) ).
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( cp2(Y)
& rf3(X,Y) )
& ? [Y] :
( ~ cp1(Y)
& rf2(X,Y) )
& ? [Y] :
( cp1(Y)
& rf1(X,Y) ) ) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X,Y,Z] :
( ( rf1(X,Z)
& rf1(X,Y) )
=> Y = Z ),
file('theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X,Y,Z] :
( ( rf2(X,Z)
& rf2(X,Y) )
=> Y = Z ),
file('theBenchmark.p',axiom_4) ).
fof(axiom_7,axiom,
! [X,Y] :
( rf3(X,Y)
=> rf1(X,Y) ),
file('theBenchmark.p',axiom_7) ).
fof(axiom_8,axiom,
! [X,Y] :
( rf3(X,Y)
=> rf2(X,Y) ),
file('theBenchmark.p',axiom_8) ).
cnf(c_25,plain,
( cp1(A)
| ~ cp1(B)
| A != B ),
inference(clausify,[status(thm)],[cp1_substitution_1]) ).
fof(nnf_16,plain,
! [X] :
( ( ! [Y] :
( ~ cp2(Y)
| ~ rf3(X,Y) )
| ! [X4] :
( cp1(X4)
| ~ rf2(X,X4) )
| ! [X3] :
( ~ cp1(X3)
| ~ rf1(X,X3) )
| cUnsatisfiable(X) )
& ( ( ? [X2] :
( cp2(X2)
& rf3(X,X2) )
& ? [X1] :
( ~ cp1(X1)
& rf2(X,X1) )
& ? [X0] :
( cp1(X0)
& rf1(X,X0) ) )
| ~ cUnsatisfiable(X) ) ),
inference(fof_nnf,[status(thm)],[axiom_2]) ).
fof(sk_axiom_2_sk,plain,
! [X] :
( ( ! [Y] :
( ~ cp2(Y)
| ~ rf3(X,Y) )
| ! [X4] :
( cp1(X4)
| ~ rf2(X,X4) )
| ! [X3] :
( ~ cp1(X3)
| ~ rf1(X,X3) )
| cUnsatisfiable(X) )
& ( ( cp2(sK2(X))
& rf3(X,sK2(X))
& ~ cp1(sK1(X))
& rf2(X,sK1(X))
& cp1(sK0(X))
& rf1(X,sK0(X)) )
| ~ cUnsatisfiable(X) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0(X)),skolemize(X1,sK1(X)),skolemize(X2,sK2(X))],[nnf_16]) ).
fof(sk_axiom_2,plain,
( ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ cp2(VAR_3)
| ~ rf3(VAR_0,VAR_3)
| cp1(VAR_2)
| ~ rf2(VAR_0,VAR_2)
| ~ cp1(VAR_1)
| ~ rf1(VAR_0,VAR_1)
| cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( cp2(sK2(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( rf3(VAR_0,sK2(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( ~ cp1(sK1(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( rf2(VAR_0,sK1(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( cp1(sK0(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( rf1(VAR_0,sK0(VAR_0))
| ~ cUnsatisfiable(VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_axiom_2_sk]) ).
cnf(c_39,plain,
( rf1(A,sK0(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_40,plain,
( cp1(sK0(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_41,plain,
( rf2(A,sK1(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_42,plain,
( ~ cp1(sK1(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_43,plain,
( rf3(A,sK2(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_46,plain,
( C = B
| ~ rf1(A,C)
| ~ rf1(A,B) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_47,plain,
( C = B
| ~ rf2(A,C)
| ~ rf2(A,B) ),
inference(clausify,[status(thm)],[axiom_4]) ).
fof(axiom_6,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('theBenchmark.p',axiom_6) ).
cnf(c_49,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(clausify,[status(thm)],[axiom_6]) ).
cnf(c_50,plain,
( rf1(A,B)
| ~ rf3(A,B) ),
inference(clausify,[status(thm)],[axiom_7]) ).
cnf(c_51,plain,
( rf2(A,B)
| ~ rf3(A,B) ),
inference(clausify,[status(thm)],[axiom_8]) ).
cnf(c_54,plain,
rf3(i2003_11_14_17_18_2750,sK2(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_49,c_43]) ).
cnf(c_55,plain,
rf2(i2003_11_14_17_18_2750,sK1(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_49,c_41]) ).
cnf(c_56,plain,
cp1(sK0(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_49,c_40]) ).
cnf(c_57,plain,
rf1(i2003_11_14_17_18_2750,sK0(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_49,c_39]) ).
cnf(c_59,plain,
~ cp1(sK1(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_42,c_49]) ).
cnf(c_87,plain,
( cp1(A)
| A != sK0(i2003_11_14_17_18_2750) ),
inference(resolve,[status(thm)],[c_25,c_56]) ).
cnf(c_62,plain,
sK1(i2003_11_14_17_18_2750) != sK0(i2003_11_14_17_18_2750),
inference(resolve,[status(thm)],[c_87,c_59]) ).
cnf(c_63,plain,
rf2(i2003_11_14_17_18_2750,sK2(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_54,c_51]) ).
cnf(c_64,plain,
rf1(i2003_11_14_17_18_2750,sK2(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_54,c_50]) ).
cnf(c_88,plain,
( A = sK0(i2003_11_14_17_18_2750)
| ~ rf1(i2003_11_14_17_18_2750,A) ),
inference(resolve,[status(thm)],[c_46,c_57]) ).
cnf(c_75,plain,
~ rf1(i2003_11_14_17_18_2750,sK1(i2003_11_14_17_18_2750)),
inference(resolve,[status(thm)],[c_88,c_62]) ).
cnf(c_89,plain,
( A = sK1(i2003_11_14_17_18_2750)
| ~ rf2(i2003_11_14_17_18_2750,A) ),
inference(resolve,[status(thm)],[c_47,c_55]) ).
cnf(c_82,plain,
sK2(i2003_11_14_17_18_2750) = sK1(i2003_11_14_17_18_2750),
inference(resolve,[status(thm)],[c_89,c_63]) ).
cnf(c_90,plain,
rf1(i2003_11_14_17_18_2750,sK1(i2003_11_14_17_18_2750)),
inference(paramod,[status(thm)],[c_82,c_64]) ).
cnf(c_86,plain,
$false,
inference(resolve,[status(thm)],[c_75,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS069+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n003.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 19:39:52 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 910718 was started by sandbox2 on n003,
% 0.09/0.37 % Fri Sep 25 19:39:52 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.15/0.40
% 0.15/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.40
% 0.15/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.15/0.40 % Length of proof is 28.
% 0.15/0.40 % Level of proof is 5.
% 0.15/0.40 % Maximum clause weight is 16.000.
% 0.15/0.40 % Given clauses 42.
% 0.15/0.40
% 0.15/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------