%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS075+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 : n013.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:59 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 15 unt; 0 def)
% Number of atoms : 119 ( 16 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 132 ( 53 ~; 45 |; 27 &)
% ( 1 <=>; 6 =>; 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 : 64 ( 0 sgn 34 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cp_substitution_1,axiom,
! [A,B] :
( ( cp(A)
& A = B )
=> cp(B) ),
file('theBenchmark.p',cp_substitution_1) ).
fof(rs_substitution_2,axiom,
! [A,B,C] :
( ( rs(C,A)
& A = B )
=> rs(C,B) ),
file('theBenchmark.p',rs_substitution_2) ).
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( cp(Y)
& rf(X,Y) )
& ? [Y] :
( cowlThing(Y)
& rs(X,Y) )
& ? [Y] :
( ~ cp(Y)
& rf1(X,Y) ) ) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X,Y,Z] :
( ( rf(X,Z)
& rf(X,Y) )
=> Y = Z ),
file('theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X,Y,Z] :
( ( rf1(X,Z)
& rf1(X,Y) )
=> Y = Z ),
file('theBenchmark.p',axiom_4) ).
fof(axiom_10,axiom,
! [X,Y] :
( rs(X,Y)
=> rf1(X,Y) ),
file('theBenchmark.p',axiom_10) ).
fof(axiom_11,axiom,
! [X,Y] :
( rs(X,Y)
=> rf(X,Y) ),
file('theBenchmark.p',axiom_11) ).
cnf(c_33,plain,
( cp(A)
| ~ cp(B)
| A != B ),
inference(clausify,[status(thm)],[cp_substitution_1]) ).
cnf(c_45,plain,
( rs(C,A)
| ~ rs(C,B)
| A != B ),
inference(clausify,[status(thm)],[rs_substitution_2]) ).
fof(nnf_21,plain,
! [X] :
( ( ! [Y] :
( ~ cp(Y)
| ~ rf(X,Y) )
| ! [X4] :
( ~ cowlThing(X4)
| ~ rs(X,X4) )
| ! [X3] :
( cp(X3)
| ~ rf1(X,X3) )
| cUnsatisfiable(X) )
& ( ( ? [X2] :
( cp(X2)
& rf(X,X2) )
& ? [X1] :
( cowlThing(X1)
& rs(X,X1) )
& ? [X0] :
( ~ cp(X0)
& rf1(X,X0) ) )
| ~ cUnsatisfiable(X) ) ),
inference(fof_nnf,[status(thm)],[axiom_2]) ).
fof(sk_axiom_2_sk,plain,
! [X] :
( ( ! [Y] :
( ~ cp(Y)
| ~ rf(X,Y) )
| ! [X4] :
( ~ cowlThing(X4)
| ~ rs(X,X4) )
| ! [X3] :
( cp(X3)
| ~ rf1(X,X3) )
| cUnsatisfiable(X) )
& ( ( cp(sK2(X))
& rf(X,sK2(X))
& cowlThing(sK1(X))
& rs(X,sK1(X))
& ~ cp(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_21]) ).
fof(sk_axiom_2,plain,
( ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ cp(VAR_3)
| ~ rf(VAR_0,VAR_3)
| ~ cowlThing(VAR_2)
| ~ rs(VAR_0,VAR_2)
| cp(VAR_1)
| ~ rf1(VAR_0,VAR_1)
| cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( cp(sK2(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( rf(VAR_0,sK2(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( cowlThing(sK1(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( rs(VAR_0,sK1(VAR_0))
| ~ cUnsatisfiable(VAR_0) )
& ! [VAR_0] :
( ~ cp(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_52,plain,
( rf1(A,sK0(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_53,plain,
( ~ cp(sK0(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_54,plain,
( rs(A,sK1(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_55,plain,
( rf(A,sK2(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_56,plain,
( cp(sK2(A))
| ~ cUnsatisfiable(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_2]) ).
cnf(c_59,plain,
( C = B
| ~ rf(A,C)
| ~ rf(A,B) ),
inference(clausify,[status(thm)],[axiom_3]) ).
cnf(c_60,plain,
( C = B
| ~ rf1(A,C)
| ~ rf1(A,B) ),
inference(clausify,[status(thm)],[axiom_4]) ).
fof(axiom_9,axiom,
cUnsatisfiable(i2003_11_14_17_19_02584),
file('theBenchmark.p',axiom_9) ).
cnf(c_68,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
inference(clausify,[status(thm)],[axiom_9]) ).
cnf(c_69,plain,
( rf1(A,B)
| ~ rs(A,B) ),
inference(clausify,[status(thm)],[axiom_10]) ).
cnf(c_70,plain,
( rf(A,B)
| ~ rs(A,B) ),
inference(clausify,[status(thm)],[axiom_11]) ).
cnf(c_72,plain,
cp(sK2(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_68,c_56]) ).
cnf(c_73,plain,
rf(i2003_11_14_17_19_02584,sK2(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_68,c_55]) ).
cnf(c_74,plain,
rs(i2003_11_14_17_19_02584,sK1(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_68,c_54]) ).
cnf(c_75,plain,
rf1(i2003_11_14_17_19_02584,sK0(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_68,c_52]) ).
cnf(c_77,plain,
~ cp(sK0(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_53,c_68]) ).
cnf(c_123,plain,
( cp(A)
| A != sK2(i2003_11_14_17_19_02584) ),
inference(resolve,[status(thm)],[c_33,c_72]) ).
cnf(c_124,plain,
sK0(i2003_11_14_17_19_02584) != sK2(i2003_11_14_17_19_02584),
inference(resolve,[status(thm)],[c_123,c_77]) ).
cnf(c_79,plain,
sK2(i2003_11_14_17_19_02584) != sK0(i2003_11_14_17_19_02584),
inference(copy,[status(thm)],[c_124]) ).
cnf(c_81,plain,
( sK2(i2003_11_14_17_19_02584) = A
| ~ rf(i2003_11_14_17_19_02584,A) ),
inference(resolve,[status(thm)],[c_73,c_59]) ).
cnf(c_84,plain,
rf(i2003_11_14_17_19_02584,sK1(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_74,c_70]) ).
cnf(c_125,plain,
( A = sK0(i2003_11_14_17_19_02584)
| ~ rf1(i2003_11_14_17_19_02584,A) ),
inference(resolve,[status(thm)],[c_60,c_75]) ).
cnf(c_94,plain,
~ rf1(i2003_11_14_17_19_02584,sK2(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_125,c_79]) ).
cnf(c_96,plain,
~ rs(i2003_11_14_17_19_02584,sK2(i2003_11_14_17_19_02584)),
inference(resolve,[status(thm)],[c_69,c_94]) ).
cnf(c_126,plain,
( rs(i2003_11_14_17_19_02584,A)
| A != sK1(i2003_11_14_17_19_02584) ),
inference(resolve,[status(thm)],[c_45,c_74]) ).
cnf(c_101,plain,
sK2(i2003_11_14_17_19_02584) != sK1(i2003_11_14_17_19_02584),
inference(resolve,[status(thm)],[c_126,c_96]) ).
cnf(c_127,plain,
sK2(i2003_11_14_17_19_02584) = sK1(i2003_11_14_17_19_02584),
inference(resolve,[status(thm)],[c_81,c_84]) ).
cnf(c_122,plain,
$false,
inference(resolve,[status(thm)],[c_101,c_127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS075+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 % Computer : n013.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 19:37:36 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.38 % Process 1025589 was started by sandbox2 on n013,
% 0.13/0.38 % Fri Sep 25 19:37:36 2026
% 0.13/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.39
% 0.13/0.39 % From the command line: assign(max_seconds, 300).
% 0.13/0.41
% 0.13/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.41
% 0.13/0.41 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.41 % Length of proof is 31.
% 0.13/0.41 % Level of proof is 7.
% 0.13/0.41 % Maximum clause weight is 9.000.
% 0.13/0.41 % Given clauses 62.
% 0.13/0.41
% 0.13/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------