%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR014+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 : Thu Sep 24 12:17:55 PM UTC 2026
% Result : Theorem 0.23s 0.59s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 80 ( 29 unt; 0 def)
% Number of atoms : 434 ( 212 equ)
% Maximal formula atoms : 194 ( 5 avg)
% Number of connectives : 495 ( 141 ~; 255 |; 85 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 52 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-3 aty)
% Number of variables : 114 ( 6 sgn 64 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(keep_not_released,axiom,
! [X2,X5] :
( ( ~ ? [X4] :
( releases(X4,X2,X5)
& happens(X4,X5) )
& ~ releasedAt(X2,X5) )
=> ~ releasedAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',keep_not_released) ).
fof(symmetry_of_plus,axiom,
! [X12,X13] : plus(X12,X13) = plus(X13,X12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(happens_not_released,axiom,
! [X4,X5,X2] :
( ( ( terminates(X4,X2,X5)
| initiates(X4,X2,X5) )
& happens(X4,X5) )
=> ~ releasedAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_not_released) ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X2 = filling
& X4 = overflow )
| ( X2 = filling
& X4 = tapOff ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+1.ax',terminates_all_defn) ).
fof(initiates_all_defn,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> ( ? [X9] :
( X2 = waterLevel(X9)
& X4 = overflow
& holdsAt(waterLevel(X9),X5) )
| ? [X9] :
( X2 = waterLevel(X9)
& X4 = tapOff
& holdsAt(waterLevel(X9),X5) )
| ( X2 = spilling
& X4 = overflow )
| ( X2 = filling
& X4 = tapOn ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+1.ax',initiates_all_defn) ).
fof(filling_3_l1,conjecture,
~ releasedAt(filling,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',filling_3_l1) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = overflow
& holdsAt(filling,X5)
& holdsAt(waterLevel(n3),X5) )
| ( X5 = n0
& X4 = tapOn ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(plus1_1,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(less_or_equal,axiom,
! [X12,X13] :
( less_or_equal(X12,X13)
<=> ( X12 = X13
| less(X12,X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(less2,axiom,
! [X12] :
( less(X12,n2)
<=> less_or_equal(X12,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(less_property,axiom,
! [X12,X13] :
( less(X12,X13)
<=> ( X13 != X12
& ~ less(X13,X12) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(less1,axiom,
! [X12] :
( less(X12,n1)
<=> less_or_equal(X12,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(less0,axiom,
~ ? [X12] : less(X12,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less0) ).
fof(c_0_15,plain,
! [X2,X5] :
( ( ~ ? [X4] :
( releases(X4,X2,X5)
& happens(X4,X5) )
& ~ releasedAt(X2,X5) )
=> ~ releasedAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[keep_not_released]) ).
fof(c_0_16,plain,
! [X5,X4,X2] :
( epred1_3(X2,X4,X5)
<=> ( ? [X9] :
( X2 = waterLevel(X9)
& X4 = overflow
& holdsAt(waterLevel(X9),X5) )
| ? [X9] :
( X2 = waterLevel(X9)
& X4 = tapOff
& holdsAt(waterLevel(X9),X5) )
| ( X2 = spilling
& X4 = overflow )
| ( X2 = filling
& X4 = tapOn ) ) ),
introduced(definition) ).
fof(c_0_17,plain,
! [X53,X54] :
( ( ~ releasedAt(X53,plus(X54,n1))
| releasedAt(X53,X54)
| releases(esk8_2(X53,X54),X53,X54) )
& ( ~ releasedAt(X53,plus(X54,n1))
| releasedAt(X53,X54)
| happens(esk8_2(X53,X54),X54) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
fof(c_0_18,plain,
! [X95,X96] : plus(X95,X96) = plus(X96,X95),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_19,plain,
! [X4,X5,X2] :
( ( ( terminates(X4,X2,X5)
| initiates(X4,X2,X5) )
& happens(X4,X5) )
=> ~ releasedAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[happens_not_released]) ).
fof(c_0_20,plain,
! [X71,X72,X73] :
( ( terminates(X71,X72,X73)
| X72 != filling
| X71 != overflow )
& ( terminates(X71,X72,X73)
| X72 != filling
| X71 != tapOff )
& ( ~ terminates(X71,X72,X73)
| X72 = filling
| X72 = filling )
& ( ~ terminates(X71,X72,X73)
| X72 = filling
| X71 = overflow )
& ( ~ terminates(X71,X72,X73)
| X71 = tapOff
| X72 = filling )
& ( ~ terminates(X71,X72,X73)
| X71 = tapOff
| X71 = overflow ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[terminates_all_defn])])])]) ).
fof(c_0_21,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X2,X4,X5) ),
inference(apply_def,[status(thm)],[initiates_all_defn,c_0_16]) ).
fof(c_0_22,plain,
! [X112,X113,X114,X117,X118,X119,X120,X121] :
( ( epred1_3(X119,X118,X117)
| X119 != waterLevel(X121)
| X118 != overflow
| ~ holdsAt(waterLevel(X121),X117) )
& ( epred1_3(X119,X118,X117)
| X119 != waterLevel(X120)
| X118 != tapOff
| ~ holdsAt(waterLevel(X120),X117) )
& ( epred1_3(X119,X118,X117)
| X119 != spilling
| X118 != overflow )
& ( epred1_3(X119,X118,X117)
| X119 != filling
| X118 != tapOn )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| X114 = waterLevel(esk10_3(X112,X113,X114))
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| X113 = tapOff
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| X113 = tapOff
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| X113 = tapOff
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X114 = spilling
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| X114 = waterLevel(esk10_3(X112,X113,X114))
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| X113 = tapOff
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| X113 = tapOff
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| X113 = tapOff
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X114 = filling
| X113 = overflow
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| X114 = waterLevel(esk10_3(X112,X113,X114))
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| X113 = tapOff
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| X113 = tapOff
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| X113 = tapOff
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X114 = spilling
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| X114 = waterLevel(esk10_3(X112,X113,X114))
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| X114 = waterLevel(esk10_3(X112,X113,X114))
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| X113 = tapOff
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| X113 = tapOff
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| X113 = tapOff
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X114 = waterLevel(esk11_3(X112,X113,X114)) )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| X113 = overflow )
& ( ~ epred1_3(X114,X113,X112)
| X113 = tapOn
| X113 = overflow
| holdsAt(waterLevel(esk10_3(X112,X113,X114)),X112)
| holdsAt(waterLevel(esk11_3(X112,X113,X114)),X112) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_16])])])])])])]) ).
cnf(c_0_23,plain,
( ~ releasedAt(X1,plus(X2,n1))
| releasedAt(X1,X2)
| happens(esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,negated_conjecture,
~ ~ releasedAt(filling,n3),
inference(assume_negation,[status(cth)],[filling_3_l1]) ).
fof(c_0_26,plain,
! [X65,X66,X67] :
( ( ~ releasedAt(X67,plus(X66,n1))
| ~ happens(X65,X66)
| ~ terminates(X65,X67,X66) )
& ( ~ releasedAt(X67,plus(X66,n1))
| ~ happens(X65,X66)
| ~ initiates(X65,X67,X66) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_27,plain,
( X2 != filling
| X1 != overflow
| terminates(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,plain,
! [X68,X69,X70] :
( ( initiates(X68,X69,X70)
| ~ epred1_3(X69,X68,X70) )
& ( epred1_3(X69,X68,X70)
| ~ initiates(X68,X69,X70) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_29,plain,
( X2 != filling
| X1 != tapOn
| epred1_3(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( ~ releasedAt(X1,plus(n1,X2))
| happens(esk8_2(X1,X2),X2)
| releasedAt(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
fof(c_0_32,negated_conjecture,
releasedAt(filling,n3),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ releasedAt(X2,plus(X3,n1))
| ~ happens(X1,X3)
| ~ terminates(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
terminates(overflow,filling,X1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])]) ).
cnf(c_0_35,plain,
( ~ epred1_3(X1,X2,X3)
| initiates(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
epred1_3(filling,tapOn,X1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])]) ).
fof(c_0_37,plain,
! [X82,X83] :
( ( happens(X82,X83)
| X82 != overflow
| ~ holdsAt(filling,X83)
| ~ holdsAt(waterLevel(n3),X83) )
& ( happens(X82,X83)
| X83 != n0
| X82 != tapOn )
& ( ~ happens(X82,X83)
| X83 = n0
| X82 = overflow )
& ( ~ happens(X82,X83)
| X83 = n0
| holdsAt(filling,X83) )
& ( ~ happens(X82,X83)
| X83 = n0
| holdsAt(waterLevel(n3),X83) )
& ( ~ happens(X82,X83)
| X82 = tapOn
| X82 = overflow )
& ( ~ happens(X82,X83)
| X82 = tapOn
| holdsAt(filling,X83) )
& ( ~ happens(X82,X83)
| X82 = tapOn
| holdsAt(waterLevel(n3),X83) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
cnf(c_0_38,plain,
( ~ releasedAt(X1,n3)
| happens(esk8_2(X1,n2),n2)
| releasedAt(X1,n2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
releasedAt(filling,n3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( ~ happens(overflow,X1)
| ~ releasedAt(filling,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( ~ releasedAt(X2,plus(X3,n1))
| ~ happens(X1,X3)
| ~ initiates(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,plain,
initiates(tapOn,filling,X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( ~ happens(X1,X2)
| X2 = n0
| X1 = overflow ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( happens(esk8_2(filling,n2),n2)
| releasedAt(filling,n2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ happens(overflow,X1)
| ~ releasedAt(filling,plus(n1,X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_46,plain,
( ~ happens(tapOn,X1)
| ~ releasedAt(filling,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
cnf(c_0_48,plain,
( X2 != n0
| X1 != tapOn
| happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_49,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[plus1_1]) ).
cnf(c_0_50,negated_conjecture,
( releasedAt(filling,n2)
| n2 = n0
| esk8_2(filling,n2) = overflow ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
~ happens(overflow,n2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_31]),c_0_39])]) ).
cnf(c_0_52,plain,
( ~ happens(tapOn,X1)
| ~ releasedAt(filling,plus(n1,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_24]) ).
cnf(c_0_53,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_47,c_0_24]) ).
cnf(c_0_54,plain,
happens(tapOn,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_48])]) ).
fof(c_0_55,plain,
! [X97,X98] :
( ( less_or_equal(X97,X98)
| X97 != X98 )
& ( less_or_equal(X97,X98)
| ~ less(X97,X98) )
& ( X97 = X98
| less(X97,X98)
| ~ less_or_equal(X97,X98) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])]) ).
cnf(c_0_56,plain,
( ~ releasedAt(X1,n2)
| happens(esk8_2(X1,n1),n1)
| releasedAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( releasedAt(filling,n2)
| n2 = n0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_50]),c_0_51]) ).
cnf(c_0_58,plain,
~ releasedAt(filling,n1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
fof(c_0_59,plain,
! [X101] :
( ( less(X101,n2)
| ~ less_or_equal(X101,n1) )
& ( less_or_equal(X101,n1)
| ~ less(X101,n2) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])]) ).
cnf(c_0_60,plain,
( X1 != X2
| less_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( happens(esk8_2(filling,n1),n1)
| n2 = n0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_62,plain,
( ~ happens(overflow,n1)
| ~ releasedAt(filling,n2) ),
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
fof(c_0_63,plain,
! [X12,X13] :
( less(X12,X13)
<=> ( X13 != X12
& ~ less(X13,X12) ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_64,plain,
! [X100] :
( ( less(X100,n1)
| ~ less_or_equal(X100,n0) )
& ( less_or_equal(X100,n0)
| ~ less(X100,n1) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])]) ).
cnf(c_0_65,plain,
( ~ less_or_equal(X1,n1)
| less(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_66,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( n0 = n1
| n2 = n0
| esk8_2(filling,n1) = overflow ),
inference(spm,[status(thm)],[c_0_43,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( ~ happens(overflow,n1)
| n2 = n0 ),
inference(spm,[status(thm)],[c_0_62,c_0_57]) ).
fof(c_0_69,plain,
! [X99] : ~ less(X99,n0),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less0])])]) ).
fof(c_0_70,plain,
! [X109,X110] :
( ( less(X109,X110)
| X110 = X109
| less(X110,X109) )
& ( ~ less(X109,X110)
| X110 != X109 )
& ( ~ less(X109,X110)
| ~ less(X110,X109) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_63])])])]) ).
cnf(c_0_71,plain,
( ~ less_or_equal(X1,n0)
| less(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_72,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
( n2 = n0
| n0 = n1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_67]),c_0_68]) ).
cnf(c_0_74,plain,
~ less(X1,n0),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_75,plain,
( ~ less(X2,X1)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_76,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_71,c_0_66]) ).
cnf(c_0_77,negated_conjecture,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_78,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_79,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR014+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n026.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 14:26:36 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.59 % Version: 3.5.1
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 % Starting sh5l with 300s (1) cores
% 0.23/0.59 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2509036 completed with status 0
% 0.23/0.59 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.59 % No SInE strategy applied
% 0.23/0.59 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.23/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.59 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.23/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.59 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.23/0.59 % new_bool_3 with pid 2509046 completed with status 0
% 0.23/0.59 % Result found by new_bool_3
% 0.23/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.59 % No SInE strategy applied
% 0.23/0.59 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.23/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.59 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.23/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.59 % Preprocessing time : 0.002 s
% 0.23/0.59 % Presaturation interreduction done
% 0.23/0.59
% 0.23/0.59 % Proof found!
% 0.23/0.59 % SZS status Theorem
% 0.23/0.59 % SZS output start CNFRefutation
% See solution above
% 0.23/0.59 % Parsed axioms : 55
% 0.23/0.59 % Removed by relevancy pruning/SinE : 0
% 0.23/0.59 % Initial clauses : 137
% 0.23/0.59 % Removed in clause preprocessing : 1
% 0.23/0.59 % Initial clauses in saturation : 136
% 0.23/0.59 % Processed clauses : 747
% 0.23/0.59 % ...of these trivial : 2
% 0.23/0.59 % ...subsumed : 176
% 0.23/0.59 % ...remaining for further processing : 569
% 0.23/0.59 % Other redundant clauses eliminated : 20
% 0.23/0.59 % Clauses deleted for lack of memory : 0
% 0.23/0.59 % Backward-subsumed : 30
% 0.23/0.59 % Backward-rewritten : 78
% 0.23/0.59 % Generated clauses : 1154
% 0.23/0.59 % ...of the previous two non-redundant : 727
% 0.23/0.59 % ...aggressively subsumed : 0
% 0.23/0.59 % Contextual simplify-reflections : 3
% 0.23/0.59 % Paramodulations : 1135
% 0.23/0.59 % Factorizations : 4
% 0.23/0.59 % NegExts : 0
% 0.23/0.59 % Equation resolutions : 23
% 0.23/0.59 % Disequality decompositions : 0
% 0.23/0.59 % Total rewrite steps : 649
% 0.23/0.59 % ...of those cached : 523
% 0.23/0.59 % Propositional unsat checks : 0
% 0.23/0.59 % Propositional check models : 0
% 0.23/0.59 % Propositional check unsatisfiable : 0
% 0.23/0.59 % Propositional clauses : 0
% 0.23/0.59 % Propositional clauses after purity: 0
% 0.23/0.59 % Propositional unsat core size : 0
% 0.23/0.59 % Propositional preprocessing time : 0.000
% 0.23/0.59 % Propositional encoding time : 0.000
% 0.23/0.59 % Propositional solver time : 0.000
% 0.23/0.59 % Success case prop preproc time : 0.000
% 0.23/0.59 % Success case prop encoding time : 0.000
% 0.23/0.59 % Success case prop solver time : 0.000
% 0.23/0.59 % Current number of processed clauses : 333
% 0.23/0.59 % Positive orientable unit clauses : 91
% 0.23/0.59 % Positive unorientable unit clauses: 1
% 0.23/0.59 % Negative unit clauses : 47
% 0.23/0.59 % Non-unit-clauses : 194
% 0.23/0.59 % Current number of unprocessed clauses: 168
% 0.23/0.59 % ...number of literals in the above : 631
% 0.23/0.59 % Current number of archived formulas : 0
% 0.23/0.59 % Current number of archived clauses : 224
% 0.23/0.59 % Clause-clause subsumption calls (NU) : 6689
% 0.23/0.59 % Rec. Clause-clause subsumption calls : 3511
% 0.23/0.59 % Non-unit clause-clause subsumptions : 156
% 0.23/0.59 % Unit Clause-clause subsumption calls : 1287
% 0.23/0.59 % Rewrite failures with RHS unbound : 0
% 0.23/0.59 % BW rewrite match attempts : 59
% 0.23/0.59 % BW rewrite match successes : 59
% 0.23/0.59 % Condensation attempts : 0
% 0.23/0.59 % Condensation successes : 0
% 0.23/0.59 % Termbank termtop insertions : 19858
% 0.23/0.59 % Search garbage collected termcells : 1496
% 0.23/0.59
% 0.23/0.59 % -------------------------------------------------
% 0.23/0.59 % User time : 0.044 s
% 0.23/0.59 % System time : 0.008 s
% 0.23/0.59 % Total time : 0.052 s
% 0.23/0.59 % Maximum resident set size: 3948 pages
% 0.23/0.59
% 0.23/0.59 % -------------------------------------------------
% 0.23/0.59 % User time : 0.168 s
% 0.23/0.59 % System time : 0.042 s
% 0.23/0.59 % Total time : 0.210 s
% 0.23/0.59 % Maximum resident set size: 4864 pages
% 0.23/0.59 % E exiting
%------------------------------------------------------------------------------