%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS071+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 : n028.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:17 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.71s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 161 ( 27 equ)
% Maximal formula atoms : 67 ( 4 avg)
% Number of connectives : 221 ( 93 ~; 99 |; 25 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 38 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& cp1(X5) )
& ? [X5] :
( rr(X4,X5)
& cp2(X5) )
& ? [X5] :
( rr(X4,X5)
& cp3(X5) )
& ! [X6,X7,X8] :
( ( rr(X4,X6)
& rr(X4,X7)
& rr(X4,X8) )
=> ( X6 = X7
| X6 = X8
| X7 = X8 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_18_39380),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(axiom_4,axiom,
! [X4] :
( cp2(X4)
=> ~ ( cp4(X4)
| cp3(X4)
| cp5(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp4(X4)
| cp2(X4)
| cp3(X4)
| cp5(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_4,plain,
! [X90,X94,X95,X96,X97,X98,X99,X100] :
( ( rr(X90,esk1_1(X90))
| ~ cUnsatisfiable(X90) )
& ( cp1(esk1_1(X90))
| ~ cUnsatisfiable(X90) )
& ( rr(X90,esk2_1(X90))
| ~ cUnsatisfiable(X90) )
& ( cp2(esk2_1(X90))
| ~ cUnsatisfiable(X90) )
& ( rr(X90,esk3_1(X90))
| ~ cUnsatisfiable(X90) )
& ( cp3(esk3_1(X90))
| ~ cUnsatisfiable(X90) )
& ( ~ rr(X90,X94)
| ~ rr(X90,X95)
| ~ rr(X90,X96)
| X94 = X95
| X94 = X96
| X95 = X96
| ~ cUnsatisfiable(X90) )
& ( rr(X97,esk4_1(X97))
| ~ rr(X97,X98)
| ~ cp1(X98)
| ~ rr(X97,X99)
| ~ cp2(X99)
| ~ rr(X97,X100)
| ~ cp3(X100)
| cUnsatisfiable(X97) )
& ( rr(X97,esk5_1(X97))
| ~ rr(X97,X98)
| ~ cp1(X98)
| ~ rr(X97,X99)
| ~ cp2(X99)
| ~ rr(X97,X100)
| ~ cp3(X100)
| cUnsatisfiable(X97) )
& ( rr(X97,esk6_1(X97))
| ~ rr(X97,X98)
| ~ cp1(X98)
| ~ rr(X97,X99)
| ~ cp2(X99)
| ~ rr(X97,X100)
| ~ cp3(X100)
| cUnsatisfiable(X97) )
& ( esk4_1(X97) != esk5_1(X97)
| ~ rr(X97,X98)
| ~ cp1(X98)
| ~ rr(X97,X99)
| ~ cp2(X99)
| ~ rr(X97,X100)
| ~ cp3(X100)
| cUnsatisfiable(X97) )
& ( esk4_1(X97) != esk6_1(X97)
| ~ rr(X97,X98)
| ~ cp1(X98)
| ~ rr(X97,X99)
| ~ cp2(X99)
| ~ rr(X97,X100)
| ~ cp3(X100)
| cUnsatisfiable(X97) )
& ( esk5_1(X97) != esk6_1(X97)
| ~ rr(X97,X98)
| ~ cp1(X98)
| ~ rr(X97,X99)
| ~ cp2(X99)
| ~ rr(X97,X100)
| ~ cp3(X100)
| cUnsatisfiable(X97) ) ),
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_5,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
cUnsatisfiable(i2003_11_14_17_18_39380),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_7,plain,
( X2 = X3
| X2 = X4
| X3 = X4
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ rr(X1,X4)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
rr(i2003_11_14_17_18_39380,esk1_1(i2003_11_14_17_18_39380)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X105] :
( ( ~ cp4(X105)
| ~ cp2(X105) )
& ( ~ cp3(X105)
| ~ cp2(X105) )
& ( ~ cp5(X105)
| ~ cp2(X105) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
cnf(c_0_11,plain,
( X1 = esk1_1(i2003_11_14_17_18_39380)
| X2 = esk1_1(i2003_11_14_17_18_39380)
| X1 = X2
| ~ rr(i2003_11_14_17_18_39380,X2)
| ~ rr(i2003_11_14_17_18_39380,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6])]) ).
cnf(c_0_12,plain,
rr(i2003_11_14_17_18_39380,esk3_1(i2003_11_14_17_18_39380)),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_13,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( ~ cp3(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( cp3(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| X1 = esk3_1(i2003_11_14_17_18_39380)
| X1 = esk1_1(i2003_11_14_17_18_39380)
| ~ rr(i2003_11_14_17_18_39380,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
rr(i2003_11_14_17_18_39380,esk2_1(i2003_11_14_17_18_39380)),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
fof(c_0_18,plain,
! [X104] :
( ( ~ cp4(X104)
| ~ cp1(X104) )
& ( ~ cp2(X104)
| ~ cp1(X104) )
& ( ~ cp3(X104)
| ~ cp1(X104) )
& ( ~ cp5(X104)
| ~ cp1(X104) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).
cnf(c_0_19,plain,
( ~ cp2(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| esk3_1(i2003_11_14_17_18_39380) = esk2_1(i2003_11_14_17_18_39380)
| esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ cp3(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| ~ cp2(esk2_1(i2003_11_14_17_18_39380)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6])]) ).
cnf(c_0_23,plain,
( cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,plain,
( esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| esk3_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_6])]) ).
cnf(c_0_26,plain,
( ~ cp2(X1)
| ~ cp1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380)
| ~ cp1(esk1_1(i2003_11_14_17_18_39380)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_6])]) ).
cnf(c_0_28,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,plain,
( ~ cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_30,plain,
esk2_1(i2003_11_14_17_18_39380) = esk1_1(i2003_11_14_17_18_39380),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_6])]) ).
cnf(c_0_31,plain,
~ cp1(esk1_1(i2003_11_14_17_18_39380)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_6])]) ).
cnf(c_0_32,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS071+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.15/0.33 % Computer : n028.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:36:31 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.28/1.71 % Version : CSE_E---1.7
% 1.28/1.71 % Problem : theBenchmark.p
% 1.28/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.71 % SZS output start CNFRefutation
% See solution above
% 1.28/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------