%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS101+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 : n016.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:21 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 143 ( 22 equ)
% Maximal formula atoms : 87 ( 6 avg)
% Number of connectives : 195 ( 75 ~; 93 |; 21 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 0 sgn 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rr(X4,X5)
=> cd(X5) )
& ! [X5] :
( rr(X4,X5)
=> ( ~ ? [X6,X7] :
( rs(X5,X6)
& rs(X5,X7)
& X6 != X7 )
| cc(X5) ) )
& ? [X5] :
( rr(X4,X5)
& ~ ! [X6,X7] :
( ( rs(X5,X6)
& rs(X5,X7) )
=> X6 = X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
cUnsatisfiable(i2003_11_14_17_20_36582),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cc(X4)
=> ~ cd(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(c_0_3,plain,
! [X73,X74,X75,X76,X77,X81,X86,X87,X88] :
( ( ~ rr(X73,X74)
| cd(X74)
| ~ cUnsatisfiable(X73) )
& ( ~ rr(X73,X75)
| ~ rs(X75,X76)
| ~ rs(X75,X77)
| X76 = X77
| cc(X75)
| ~ cUnsatisfiable(X73) )
& ( rr(X73,esk1_1(X73))
| ~ cUnsatisfiable(X73) )
& ( rs(esk1_1(X73),esk2_1(X73))
| ~ cUnsatisfiable(X73) )
& ( rs(esk1_1(X73),esk3_1(X73))
| ~ cUnsatisfiable(X73) )
& ( esk2_1(X73) != esk3_1(X73)
| ~ cUnsatisfiable(X73) )
& ( rr(X81,esk5_1(X81))
| rr(X81,esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( rs(esk5_1(X81),esk6_1(X81))
| rr(X81,esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( rs(esk5_1(X81),esk7_1(X81))
| rr(X81,esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( esk6_1(X81) != esk7_1(X81)
| rr(X81,esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( ~ cc(esk5_1(X81))
| rr(X81,esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( rr(X81,esk5_1(X81))
| ~ cd(esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( rs(esk5_1(X81),esk6_1(X81))
| ~ cd(esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( rs(esk5_1(X81),esk7_1(X81))
| ~ cd(esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( esk6_1(X81) != esk7_1(X81)
| ~ cd(esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) )
& ( ~ cc(esk5_1(X81))
| ~ cd(esk4_1(X81))
| ~ rr(X81,X86)
| ~ rs(X86,X87)
| ~ rs(X86,X88)
| X87 = X88
| cUnsatisfiable(X81) ) ),
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_4,plain,
( rs(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
cUnsatisfiable(i2003_11_14_17_20_36582),
inference(split_conjunct,[status(thm)],[axiom_4]) ).
cnf(c_0_6,plain,
( X3 = X4
| cc(X2)
| ~ rr(X1,X2)
| ~ rs(X2,X3)
| ~ rs(X2,X4)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk2_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( rs(esk1_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_9,plain,
! [X4] :
( cc(X4)
=> ~ cd(X4) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_10,plain,
( X1 = esk2_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rs(esk1_1(i2003_11_14_17_20_36582),X1)
| ~ rr(X2,esk1_1(i2003_11_14_17_20_36582))
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
rs(esk1_1(i2003_11_14_17_20_36582),esk3_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_12,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_13,plain,
! [X89] :
( ~ cc(X89)
| ~ cd(X89) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_14,plain,
( esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582))
| ~ rr(X1,esk1_1(i2003_11_14_17_20_36582))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
rr(i2003_11_14_17_20_36582,esk1_1(i2003_11_14_17_20_36582)),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_16,plain,
( cd(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,plain,
( ~ cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582)
| cc(esk1_1(i2003_11_14_17_20_36582)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_5])]) ).
cnf(c_0_19,plain,
cd(esk1_1(i2003_11_14_17_20_36582)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_5])]) ).
cnf(c_0_20,plain,
( esk2_1(X1) != esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_21,plain,
esk3_1(i2003_11_14_17_20_36582) = esk2_1(i2003_11_14_17_20_36582),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS101+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 : n016.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:51 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/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.367s
%------------------------------------------------------------------------------