%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS114+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 4 unt; 0 def)
% Number of atoms : 129 ( 6 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 155 ( 63 ~; 60 |; 23 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 63 ( 2 sgn 32 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
! [X4] :
( cp(X4)
<=> ~ ? [X5] : ra_Px1(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X4] :
( cpxcomp(X4)
<=> ? [X6] : ra_Px1(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_8,axiom,
! [X4] :
( ca_Ax4(X4)
<=> ( ! [X6,X7] :
( ( rinvR(X4,X6)
& rinvR(X4,X7) )
=> X6 = X7 )
& ? [X5] :
( rinvR(X4,X5)
& ca_Vx5(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_10,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& ca_Ax4(X5) )
& ? [X5] :
( rs(X4,X5)
& ca_Ax3(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_7,axiom,
! [X4] :
( ca_Ax3(X4)
<=> ( cqxcomp(X4)
& cpxcomp(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(axiom_9,axiom,
! [X4] :
( ca_Vx5(X4)
<=> ! [X5] :
( rs(X4,X5)
=> cp(X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_11,axiom,
cUnsatisfiable(i2003_11_14_17_21_262),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
fof(c_0_8,plain,
! [X146,X147,X148] :
( ( ~ cp(X146)
| ~ ra_Px1(X146,X147) )
& ( ra_Px1(X148,esk3_1(X148))
| cp(X148) ) ),
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_3])])])])]) ).
fof(c_0_9,plain,
! [X150,X152,X153] :
( ( ~ cpxcomp(X150)
| ra_Px1(X150,esk4_1(X150)) )
& ( ~ ra_Px1(X152,X153)
| cpxcomp(X152) ) ),
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])])])])]) ).
fof(c_0_10,plain,
! [X163,X164,X165,X167,X170] :
( ( ~ rinvR(X163,X164)
| ~ rinvR(X163,X165)
| X164 = X165
| ~ ca_Ax4(X163) )
& ( rinvR(X163,esk7_1(X163))
| ~ ca_Ax4(X163) )
& ( ca_Vx5(esk7_1(X163))
| ~ ca_Ax4(X163) )
& ( rinvR(X167,esk8_1(X167))
| ~ rinvR(X167,X170)
| ~ ca_Vx5(X170)
| ca_Ax4(X167) )
& ( rinvR(X167,esk9_1(X167))
| ~ rinvR(X167,X170)
| ~ ca_Vx5(X170)
| ca_Ax4(X167) )
& ( esk8_1(X167) != esk9_1(X167)
| ~ rinvR(X167,X170)
| ~ ca_Vx5(X170)
| ca_Ax4(X167) ) ),
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_8])])])])])]) ).
fof(c_0_11,plain,
! [X175,X176] :
( ( ~ rinvR(X175,X176)
| rr(X176,X175) )
& ( ~ rr(X176,X175)
| rinvR(X175,X176) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).
fof(c_0_12,plain,
! [X140,X143,X144,X145] :
( ( rr(X140,esk1_1(X140))
| ~ cUnsatisfiable(X140) )
& ( ca_Ax4(esk1_1(X140))
| ~ cUnsatisfiable(X140) )
& ( rs(X140,esk2_1(X140))
| ~ cUnsatisfiable(X140) )
& ( ca_Ax3(esk2_1(X140))
| ~ cUnsatisfiable(X140) )
& ( ~ rr(X143,X144)
| ~ ca_Ax4(X144)
| ~ rs(X143,X145)
| ~ ca_Ax3(X145)
| cUnsatisfiable(X143) ) ),
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])])])])])]) ).
cnf(c_0_13,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X162] :
( ( cqxcomp(X162)
| ~ ca_Ax3(X162) )
& ( cpxcomp(X162)
| ~ ca_Ax3(X162) )
& ( ~ cqxcomp(X162)
| ~ cpxcomp(X162)
| ca_Ax3(X162) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).
fof(c_0_16,plain,
! [X171,X172,X173] :
( ( ~ ca_Vx5(X171)
| ~ rs(X171,X172)
| cp(X172) )
& ( rs(X173,esk10_1(X173))
| ca_Vx5(X173) )
& ( ~ cp(esk10_1(X173))
| ca_Vx5(X173) ) ),
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_9])])])])])]) ).
cnf(c_0_17,plain,
( X2 = X3
| ~ rinvR(X1,X2)
| ~ rinvR(X1,X3)
| ~ ca_Ax4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( rinvR(X1,esk7_1(X1))
| ~ ca_Ax4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ cpxcomp(X1)
| ~ cp(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,plain,
( cpxcomp(X1)
| ~ ca_Ax3(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( cp(X2)
| ~ ca_Vx5(X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( X1 = esk7_1(X2)
| ~ rinvR(X2,X1)
| ~ ca_Ax4(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( rinvR(esk1_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ca_Ax4(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,plain,
( ~ cp(X1)
| ~ ca_Ax3(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( cp(esk2_1(X1))
| ~ ca_Vx5(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ca_Ax3(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,plain,
( ca_Vx5(esk7_1(X1))
| ~ ca_Ax4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,plain,
( esk7_1(esk1_1(X1)) = X1
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
( ~ ca_Vx5(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
cUnsatisfiable(i2003_11_14_17_21_262),
inference(split_conjunct,[status(thm)],[axiom_11]) ).
cnf(c_0_35,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS114+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n020.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 20:38:20 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------