%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS125+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 : n006.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:46:05 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 16 ~; 13 |; 4 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 25 ( 2 sgn 13 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( cf(X)
& ce3(X) ) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X] :
( cc(X)
=> cdxcomp(X) ),
file('theBenchmark.p',axiom_3) ).
fof(axiom_6,axiom,
! [X] :
( cd(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('theBenchmark.p',axiom_6) ).
fof(axiom_7,axiom,
! [X] :
( cdxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('theBenchmark.p',axiom_7) ).
fof(axiom_10,axiom,
! [X] :
( ce3(X)
=> cc(X) ),
file('theBenchmark.p',axiom_10) ).
fof(axiom_11,axiom,
! [X] :
( cf(X)
=> cd(X) ),
file('theBenchmark.p',axiom_11) ).
cnf(c_15,plain,
( cf(A)
| ~ cUnsatisfiable(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
fof(axiom_12,axiom,
cUnsatisfiable(i2003_11_14_17_22_17947),
file('theBenchmark.p',axiom_12) ).
cnf(c_17,plain,
cUnsatisfiable(i2003_11_14_17_22_17947),
inference(clausify,[status(thm)],[axiom_12]) ).
cnf(c_18,plain,
( ce3(A)
| ~ cUnsatisfiable(A) ),
inference(clausify,[status(thm)],[axiom_2]) ).
cnf(c_19,plain,
( cc(A)
| ~ ce3(A) ),
inference(clausify,[status(thm)],[axiom_10]) ).
cnf(c_20,plain,
ce3(i2003_11_14_17_22_17947),
inference(resolve,[status(thm)],[c_18,c_17]) ).
cnf(c_21,plain,
cf(i2003_11_14_17_22_17947),
inference(resolve,[status(thm)],[c_15,c_17]) ).
cnf(c_22,plain,
( cd(A)
| ~ cf(A) ),
inference(clausify,[status(thm)],[axiom_11]) ).
cnf(c_23,plain,
cc(i2003_11_14_17_22_17947),
inference(resolve,[status(thm)],[c_19,c_20]) ).
cnf(c_24,plain,
( cdxcomp(A)
| ~ cc(A) ),
inference(clausify,[status(thm)],[axiom_3]) ).
fof(nnf_8,plain,
! [X] :
( ( ! [Y0] : ~ ra_Px1(X,Y0)
| cdxcomp(X) )
& ( ? [X0] : ra_Px1(X,X0)
| ~ cdxcomp(X) ) ),
inference(fof_nnf,[status(thm)],[axiom_7]) ).
fof(sk_axiom_7_sk,plain,
! [X] :
( ( ! [Y0] : ~ ra_Px1(X,Y0)
| cdxcomp(X) )
& ( ra_Px1(X,sK0(X))
| ~ cdxcomp(X) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0(X))],[nnf_8]) ).
fof(sk_axiom_7,plain,
( ! [VAR_0,VAR_1] :
( ~ ra_Px1(VAR_0,VAR_1)
| cdxcomp(VAR_0) )
& ! [VAR_0] :
( ra_Px1(VAR_0,sK0(VAR_0))
| ~ cdxcomp(VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_axiom_7_sk]) ).
cnf(c_25,plain,
( ra_Px1(A,sK0(A))
| ~ cdxcomp(A) ),
inference(split_conjunct,[status(thm)],[sk_axiom_7]) ).
cnf(c_27,plain,
cdxcomp(i2003_11_14_17_22_17947),
inference(resolve,[status(thm)],[c_23,c_24]) ).
cnf(c_32,plain,
( ~ ra_Px1(A,B)
| ~ cd(A) ),
inference(clausify,[status(thm)],[axiom_6]) ).
cnf(c_34,plain,
cd(i2003_11_14_17_22_17947),
inference(resolve,[status(thm)],[c_21,c_22]) ).
cnf(c_35,plain,
~ ra_Px1(i2003_11_14_17_22_17947,A),
inference(resolve,[status(thm)],[c_34,c_32]) ).
cnf(c_38,plain,
ra_Px1(i2003_11_14_17_22_17947,sK0(i2003_11_14_17_22_17947)),
inference(resolve,[status(thm)],[c_25,c_27]) ).
cnf(c_39,plain,
$false,
inference(resolve,[status(thm)],[c_38,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS125+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.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 19:40:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 3574818 was started by sandbox2 on n006,
% 0.10/0.36 % Fri Sep 25 19:40:10 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.10/0.38
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38
% 0.10/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.38 % Length of proof is 22.
% 0.10/0.38 % Level of proof is 6.
% 0.10/0.38 % Maximum clause weight is 4.000.
% 0.10/0.38 % Given clauses 0.
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------