%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS108+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:36:22 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.73s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 125 ( 6 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 143 ( 58 ~; 54 |; 23 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 53 ( 1 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_25,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_25) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rinvR(X4,X5)
& ca_Ax14(X5) )
& cp2(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_6,axiom,
! [X4] :
( cp2xcomp(X4)
<=> ~ ? [X5] : ra_Px5(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
<=> ? [X6] : ra_Px5(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_16,axiom,
! [X4] :
( ca_Cx1(X4)
<=> ( cp2xcomp(X4)
& cp5xcomp(X4)
& cp3xcomp(X4)
& cp4xcomp(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_16) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ca_Cx1(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_15,axiom,
! [X4] :
( ca_Ax14(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& cp1(X5) )
& ! [X6,X7] :
( ( rr(X4,X6)
& rr(X4,X7) )
=> X6 = X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
fof(axiom_26,axiom,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_26) ).
fof(c_0_8,plain,
! [X322,X323] :
( ( ~ rinvR(X322,X323)
| rr(X323,X322) )
& ( ~ rr(X323,X322)
| rinvR(X322,X323) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_25])]) ).
fof(c_0_9,plain,
! [X247,X249,X250] :
( ( rinvR(X247,esk1_1(X247))
| ~ cUnsatisfiable(X247) )
& ( ca_Ax14(esk1_1(X247))
| ~ cUnsatisfiable(X247) )
& ( cp2(X247)
| ~ cUnsatisfiable(X247) )
& ( ~ rinvR(X249,X250)
| ~ ca_Ax14(X250)
| ~ cp2(X249)
| cUnsatisfiable(X249) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])]) ).
fof(c_0_10,plain,
! [X257,X258,X259] :
( ( ~ cp2xcomp(X257)
| ~ ra_Px5(X257,X258) )
& ( ra_Px5(X259,esk3_1(X259))
| cp2xcomp(X259) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])])]) ).
fof(c_0_11,plain,
! [X252,X254,X255] :
( ( ~ cp2(X252)
| ra_Px5(X252,esk2_1(X252)) )
& ( ~ ra_Px5(X254,X255)
| cp2(X254) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])])])]) ).
cnf(c_0_12,plain,
( rr(X2,X1)
| ~ rinvR(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( rinvR(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ cp2xcomp(X1)
| ~ ra_Px5(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ra_Px5(X1,esk2_1(X1))
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X295] :
( ( cp2xcomp(X295)
| ~ ca_Cx1(X295) )
& ( cp5xcomp(X295)
| ~ ca_Cx1(X295) )
& ( cp3xcomp(X295)
| ~ ca_Cx1(X295) )
& ( cp4xcomp(X295)
| ~ ca_Cx1(X295) )
& ( ~ cp2xcomp(X295)
| ~ cp5xcomp(X295)
| ~ cp3xcomp(X295)
| ~ cp4xcomp(X295)
| ca_Cx1(X295) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_16])])]) ).
fof(c_0_17,plain,
! [X251] :
( ~ cp1(X251)
| ca_Cx1(X251) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).
fof(c_0_18,plain,
! [X287,X289,X290,X291,X292] :
( ( rr(X287,esk10_1(X287))
| ~ ca_Ax14(X287) )
& ( cp1(esk10_1(X287))
| ~ ca_Ax14(X287) )
& ( ~ rr(X287,X289)
| ~ rr(X287,X290)
| X289 = X290
| ~ ca_Ax14(X287) )
& ( rr(X291,esk11_1(X291))
| ~ rr(X291,X292)
| ~ cp1(X292)
| ca_Ax14(X291) )
& ( rr(X291,esk12_1(X291))
| ~ rr(X291,X292)
| ~ cp1(X292)
| ca_Ax14(X291) )
& ( esk11_1(X291) != esk12_1(X291)
| ~ rr(X291,X292)
| ~ cp1(X292)
| ca_Ax14(X291) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_15])])])])])]) ).
cnf(c_0_19,plain,
( rr(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
cUnsatisfiable(i2003_11_14_17_21_04740),
inference(split_conjunct,[status(thm)],[axiom_26]) ).
cnf(c_0_21,plain,
( ca_Ax14(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( ~ cp2xcomp(X1)
| ~ cp2(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( cp2xcomp(X1)
| ~ ca_Cx1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ca_Cx1(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( cp1(esk10_1(X1))
| ~ ca_Ax14(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ ca_Ax14(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
rr(esk1_1(i2003_11_14_17_21_04740),i2003_11_14_17_21_04740),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
ca_Ax14(esk1_1(i2003_11_14_17_21_04740)),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_29,plain,
( rr(X1,esk10_1(X1))
| ~ ca_Ax14(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( ~ cp2(X1)
| ~ ca_Cx1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( cp2(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,plain,
( ca_Cx1(esk10_1(X1))
| ~ ca_Ax14(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( X1 = i2003_11_14_17_21_04740
| ~ rr(esk1_1(i2003_11_14_17_21_04740),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_34,plain,
rr(esk1_1(i2003_11_14_17_21_04740),esk10_1(esk1_1(i2003_11_14_17_21_04740))),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_35,plain,
( ~ ca_Cx1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
ca_Cx1(esk10_1(esk1_1(i2003_11_14_17_21_04740))),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_37,plain,
esk10_1(esk1_1(i2003_11_14_17_21_04740)) = i2003_11_14_17_21_04740,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
~ ca_Cx1(i2003_11_14_17_21_04740),
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS108+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n018.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 20:37:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.27/1.73 % Version : CSE_E---1.7
% 1.27/1.73 % Problem : theBenchmark.p
% 1.27/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.73 % SZS output start CNFRefutation
% See solution above
% 1.27/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------