TSTP Solution File: CSR007+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR007+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : 600s
% DateTime : Fri Jul 15 03:01:22 EDT 2022
% Result : Theorem 0.36s 24.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 127 ( 36 unt; 0 def)
% Number of atoms : 563 ( 248 equ)
% Maximal formula atoms : 194 ( 4 avg)
% Number of connectives : 602 ( 166 ~; 332 |; 90 &)
% ( 11 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 52 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-3 aty)
% Number of variables : 191 ( 29 sgn 95 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_or_equal,axiom,
! [X12,X13] :
( less_or_equal(X12,X13)
<=> ( less(X12,X13)
| X12 = X13 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',less_or_equal) ).
fof(less1,axiom,
! [X12] :
( less(X12,n1)
<=> less_or_equal(X12,n0) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',less1) ).
fof(change_of_waterLevel,axiom,
! [X10,X5,X11,X7] :
( ( holdsAt(waterLevel(X10),X5)
& X11 = plus(X10,X7) )
=> trajectory(filling,X5,waterLevel(X11),X7) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',change_of_waterLevel) ).
fof(less2,axiom,
! [X12] :
( less(X12,n2)
<=> less_or_equal(X12,n1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',less2) ).
fof(plus0_2,axiom,
plus(n0,n2) = n2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',plus0_2) ).
fof(change_holding,axiom,
! [X4,X5,X2,X6,X7] :
( ( happens(X4,X5)
& initiates(X4,X2,X5)
& less(n0,X7)
& trajectory(X2,X5,X6,X7)
& ~ stoppedIn(X5,X2,plus(X5,X7)) )
=> holdsAt(X6,plus(X5,X7)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',change_holding) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = tapOn
& X5 = n0 )
| ( holdsAt(waterLevel(n3),X5)
& holdsAt(filling,X5)
& X4 = overflow ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
fof(initiates_all_defn,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> ( ( X4 = tapOn
& X2 = filling )
| ( X4 = overflow
& X2 = spilling )
| ? [X9] :
( holdsAt(waterLevel(X9),X5)
& X4 = tapOff
& X2 = waterLevel(X9) )
| ? [X9] :
( holdsAt(waterLevel(X9),X5)
& X4 = overflow
& X2 = waterLevel(X9) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',initiates_all_defn) ).
fof(less_property,axiom,
! [X12,X13] :
( less(X12,X13)
<=> ( ~ less(X13,X12)
& X13 != X12 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',less_property) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',plus0_1) ).
fof(waterLevel_0,hypothesis,
holdsAt(waterLevel(n0),n0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',waterLevel_0) ).
fof(less0,axiom,
~ ? [X12] : less(X12,n0),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',less0) ).
fof(stoppedin_defn,axiom,
! [X1,X2,X3] :
( stoppedIn(X1,X2,X3)
<=> ? [X4,X5] :
( happens(X4,X5)
& less(X1,X5)
& less(X5,X3)
& terminates(X4,X2,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X4 = tapOff
& X2 = filling )
| ( X4 = overflow
& X2 = filling ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',terminates_all_defn) ).
fof(tapOff_not_tapOn,axiom,
tapOff != tapOn,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',tapOff_not_tapOn) ).
fof(tapOff_not_overflow,axiom,
tapOff != overflow,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',tapOff_not_overflow) ).
fof(waterlevel_not_3,conjecture,
~ holdsAt(waterLevel(n3),n2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',waterlevel_not_3) ).
fof(overflow_not_tapOn,axiom,
overflow != tapOn,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',overflow_not_tapOn) ).
fof(same_waterLevel,axiom,
! [X5,X10,X11] :
( ( holdsAt(waterLevel(X10),X5)
& holdsAt(waterLevel(X11),X5) )
=> X10 = X11 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',same_waterLevel) ).
fof(less3,axiom,
! [X12] :
( less(X12,n3)
<=> less_or_equal(X12,n2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',less3) ).
fof(c_0_20,plain,
! [X14,X15,X14,X15] :
( ( ~ less_or_equal(X14,X15)
| less(X14,X15)
| X14 = X15 )
& ( ~ less(X14,X15)
| less_or_equal(X14,X15) )
& ( X14 != X15
| less_or_equal(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])])]) ).
fof(c_0_21,plain,
! [X13,X13] :
( ( ~ less(X13,n1)
| less_or_equal(X13,n0) )
& ( ~ less_or_equal(X13,n0)
| less(X13,n1) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])])]) ).
cnf(c_0_22,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_22]) ).
fof(c_0_25,plain,
! [X12,X13,X14,X15] :
( ~ holdsAt(waterLevel(X12),X13)
| X14 != plus(X12,X15)
| trajectory(filling,X13,waterLevel(X14),X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[change_of_waterLevel])]) ).
fof(c_0_26,plain,
! [X5,X4,X2] :
( epred1_3(X2,X4,X5)
<=> ( ( X4 = tapOn
& X2 = filling )
| ( X4 = overflow
& X2 = spilling )
| ? [X9] :
( holdsAt(waterLevel(X9),X5)
& X4 = tapOff
& X2 = waterLevel(X9) )
| ? [X9] :
( holdsAt(waterLevel(X9),X5)
& X4 = overflow
& X2 = waterLevel(X9) ) ) ),
introduced(definition) ).
fof(c_0_27,plain,
! [X13,X13] :
( ( ~ less(X13,n2)
| less_or_equal(X13,n1) )
& ( ~ less_or_equal(X13,n1)
| less(X13,n2) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])])]) ).
cnf(c_0_28,plain,
( less_or_equal(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( trajectory(filling,X1,waterLevel(X2),X3)
| X2 != plus(X4,X3)
| ~ holdsAt(waterLevel(X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
plus(n0,n2) = n2,
inference(split_conjunct,[status(thm)],[plus0_2]) ).
fof(c_0_32,plain,
! [X10,X11,X12,X10,X11,X12,X15,X16] :
( ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X11 = tapOff
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X11 = tapOff
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X11 = tapOff
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X11 = overflow
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X11 = tapOff
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X11 = tapOff
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X11 = tapOff
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X12 = spilling
| X11 = tapOn
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X11 = tapOff
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X11 = tapOff
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X11 = tapOff
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X11 = overflow
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| holdsAt(waterLevel(esk10_3(X10,X11,X12)),X10)
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X11 = tapOff
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X11 = tapOff
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X11 = tapOff
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( holdsAt(waterLevel(esk11_3(X10,X11,X12)),X10)
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 = overflow
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X12 = waterLevel(esk11_3(X10,X11,X12))
| X12 = waterLevel(esk10_3(X10,X11,X12))
| X12 = spilling
| X12 = filling
| ~ epred1_3(X12,X11,X10) )
& ( X11 != tapOn
| X12 != filling
| epred1_3(X12,X11,X10) )
& ( X11 != overflow
| X12 != spilling
| epred1_3(X12,X11,X10) )
& ( ~ holdsAt(waterLevel(X15),X10)
| X11 != tapOff
| X12 != waterLevel(X15)
| epred1_3(X12,X11,X10) )
& ( ~ holdsAt(waterLevel(X16),X10)
| X11 != overflow
| X12 != waterLevel(X16)
| epred1_3(X12,X11,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])])])]) ).
fof(c_0_33,plain,
! [X8,X9,X10,X11,X12] :
( ~ happens(X8,X9)
| ~ initiates(X8,X10,X9)
| ~ less(n0,X12)
| ~ trajectory(X10,X9,X11,X12)
| stoppedIn(X9,X10,plus(X9,X12))
| holdsAt(X11,plus(X9,X12)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[change_holding])])]) ).
cnf(c_0_34,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
less_or_equal(n0,n1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( trajectory(filling,X1,waterLevel(X2),n2)
| X2 != n2
| ~ holdsAt(waterLevel(n0),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_37,plain,
! [X6,X7,X6,X7] :
( ( holdsAt(waterLevel(n3),X7)
| X6 = tapOn
| ~ happens(X6,X7) )
& ( holdsAt(filling,X7)
| X6 = tapOn
| ~ happens(X6,X7) )
& ( X6 = overflow
| X6 = tapOn
| ~ happens(X6,X7) )
& ( holdsAt(waterLevel(n3),X7)
| X7 = n0
| ~ happens(X6,X7) )
& ( holdsAt(filling,X7)
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = overflow
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 != tapOn
| X7 != n0
| happens(X6,X7) )
& ( ~ holdsAt(waterLevel(n3),X7)
| ~ holdsAt(filling,X7)
| X6 != overflow
| happens(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])])]) ).
fof(c_0_38,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X2,X4,X5) ),
inference(apply_def,[status(thm)],[initiates_all_defn,c_0_26]) ).
cnf(c_0_39,plain,
( epred1_3(X1,X2,X3)
| X1 != filling
| X2 != tapOn ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_40,plain,
! [X14,X15,X14,X15] :
( ( ~ less(X15,X14)
| ~ less(X14,X15) )
& ( X15 != X14
| ~ less(X14,X15) )
& ( less(X15,X14)
| X15 = X14
| less(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[less_property])])])])])]) ).
cnf(c_0_41,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
cnf(c_0_42,plain,
( holdsAt(X1,plus(X2,X3))
| stoppedIn(X2,X4,plus(X2,X3))
| ~ trajectory(X4,X2,X1,X3)
| ~ less(n0,X3)
| ~ initiates(X5,X4,X2)
| ~ happens(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
less(n0,n2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
( trajectory(filling,X1,waterLevel(n2),n2)
| ~ holdsAt(waterLevel(n0),X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_45,hypothesis,
holdsAt(waterLevel(n0),n0),
inference(split_conjunct,[status(thm)],[waterLevel_0]) ).
cnf(c_0_46,plain,
( happens(X1,X2)
| X2 != n0
| X1 != tapOn ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_47,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( ~ initiates(X6,X7,X8)
| epred1_3(X7,X6,X8) )
& ( ~ epred1_3(X7,X6,X8)
| initiates(X6,X7,X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_48,plain,
( epred1_3(X1,tapOn,X2)
| X1 != filling ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( less_or_equal(X1,n0)
| ~ less(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_50,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_51,plain,
! [X13] : ~ less(X13,n0),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less0])]) ).
cnf(c_0_52,plain,
( trajectory(filling,X1,waterLevel(X2),n1)
| X2 != n1
| ~ holdsAt(waterLevel(n0),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_41]) ).
cnf(c_0_53,plain,
( holdsAt(X1,plus(X2,n2))
| stoppedIn(X2,X3,plus(X2,n2))
| ~ trajectory(X3,X2,X1,n2)
| ~ initiates(X4,X3,X2)
| ~ happens(X4,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,hypothesis,
trajectory(filling,n0,waterLevel(n2),n2),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_55,plain,
( happens(X1,n0)
| X1 != tapOn ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_56,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,plain,
epred1_3(filling,tapOn,X1),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_58,plain,
( X1 = X2
| less(X1,X2)
| ~ less_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_59,plain,
( X1 = n1
| less_or_equal(X1,n0)
| less(n1,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
~ less(X1,n0),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( less_or_equal(X1,n1)
| ~ less(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_62,plain,
( trajectory(filling,X1,waterLevel(n1),n1)
| ~ holdsAt(waterLevel(n0),X1) ),
inference(er,[status(thm)],[c_0_52]) ).
fof(c_0_63,plain,
! [X6,X7,X8,X6,X7,X8,X11,X12] :
( ( happens(esk1_3(X6,X7,X8),esk2_3(X6,X7,X8))
| ~ stoppedIn(X6,X7,X8) )
& ( less(X6,esk2_3(X6,X7,X8))
| ~ stoppedIn(X6,X7,X8) )
& ( less(esk2_3(X6,X7,X8),X8)
| ~ stoppedIn(X6,X7,X8) )
& ( terminates(esk1_3(X6,X7,X8),X7,esk2_3(X6,X7,X8))
| ~ stoppedIn(X6,X7,X8) )
& ( ~ happens(X11,X12)
| ~ less(X6,X12)
| ~ less(X12,X8)
| ~ terminates(X11,X7,X12)
| stoppedIn(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[stoppedin_defn])])])])])])]) ).
cnf(c_0_64,hypothesis,
( holdsAt(waterLevel(n2),n2)
| stoppedIn(n0,filling,n2)
| ~ initiates(X1,filling,n0)
| ~ happens(X1,n0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_31]),c_0_31]) ).
cnf(c_0_65,plain,
happens(tapOn,n0),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_66,plain,
initiates(tapOn,filling,X1),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_68,plain,
( X1 = n0
| X1 = n1
| less(n1,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_69,plain,
( X1 = n2
| less_or_equal(X1,n1)
| less(n2,X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_50]) ).
cnf(c_0_70,plain,
( holdsAt(X1,plus(X2,n1))
| stoppedIn(X2,X3,plus(X2,n1))
| ~ trajectory(X3,X2,X1,n1)
| ~ initiates(X4,X3,X2)
| ~ happens(X4,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_29]) ).
cnf(c_0_71,hypothesis,
trajectory(filling,n0,waterLevel(n1),n1),
inference(spm,[status(thm)],[c_0_62,c_0_45]) ).
cnf(c_0_72,plain,
( happens(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))
| ~ stoppedIn(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_73,hypothesis,
( holdsAt(waterLevel(n2),n2)
| stoppedIn(n0,filling,n2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
fof(c_0_74,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( X6 = overflow
| X6 = tapOff
| ~ terminates(X6,X7,X8) )
& ( X7 = filling
| X6 = tapOff
| ~ terminates(X6,X7,X8) )
& ( X6 = overflow
| X7 = filling
| ~ terminates(X6,X7,X8) )
& ( X7 = filling
| X7 = filling
| ~ terminates(X6,X7,X8) )
& ( X6 != tapOff
| X7 != filling
| terminates(X6,X7,X8) )
& ( X6 != overflow
| X7 != filling
| terminates(X6,X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[terminates_all_defn])])])])]) ).
cnf(c_0_75,plain,
( terminates(esk1_3(X1,X2,X3),X2,esk2_3(X1,X2,X3))
| ~ stoppedIn(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_76,plain,
( X1 = n0
| X1 = n1
| ~ less(X1,n1) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,plain,
( X1 = n1
| X1 = n2
| less(X1,n1)
| less(n2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_69]) ).
cnf(c_0_78,hypothesis,
( holdsAt(waterLevel(n1),n1)
| stoppedIn(n0,filling,n1)
| ~ initiates(X1,filling,n0)
| ~ happens(X1,n0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_41]),c_0_41]) ).
cnf(c_0_79,plain,
( X1 = tapOn
| X1 = overflow
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_80,hypothesis,
( holdsAt(waterLevel(n2),n2)
| happens(esk1_3(n0,filling,n2),esk2_3(n0,filling,n2)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,plain,
( X1 = tapOff
| X1 = overflow
| ~ terminates(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_82,hypothesis,
( holdsAt(waterLevel(n2),n2)
| terminates(esk1_3(n0,filling,n2),filling,esk2_3(n0,filling,n2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_73]) ).
cnf(c_0_83,plain,
( X1 = n0
| X1 = n1
| X1 = n2
| less(n2,X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_84,plain,
( less(esk2_3(X1,X2,X3),X3)
| ~ stoppedIn(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_85,hypothesis,
( holdsAt(waterLevel(n1),n1)
| stoppedIn(n0,filling,n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_65]),c_0_66])]) ).
cnf(c_0_86,hypothesis,
( esk1_3(n0,filling,n2) = tapOn
| esk1_3(n0,filling,n2) = overflow
| holdsAt(waterLevel(n2),n2) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_87,hypothesis,
( esk1_3(n0,filling,n2) = overflow
| esk1_3(n0,filling,n2) = tapOff
| holdsAt(waterLevel(n2),n2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_88,plain,
tapOff != tapOn,
inference(split_conjunct,[status(thm)],[tapOff_not_tapOn]) ).
cnf(c_0_89,plain,
tapOff != overflow,
inference(split_conjunct,[status(thm)],[tapOff_not_overflow]) ).
cnf(c_0_90,plain,
( X1 = tapOn
| holdsAt(waterLevel(n3),X2)
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_91,plain,
( X1 = n0
| X1 = n1
| X1 = n2
| ~ less(X1,n2) ),
inference(spm,[status(thm)],[c_0_67,c_0_83]) ).
cnf(c_0_92,hypothesis,
( holdsAt(waterLevel(n2),n2)
| less(esk2_3(n0,filling,n2),n2) ),
inference(spm,[status(thm)],[c_0_84,c_0_73]) ).
cnf(c_0_93,plain,
( ~ less(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_94,hypothesis,
( holdsAt(waterLevel(n1),n1)
| less(esk2_3(n0,filling,n1),n1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
fof(c_0_95,negated_conjecture,
~ ~ holdsAt(waterLevel(n3),n2),
inference(assume_negation,[status(cth)],[waterlevel_not_3]) ).
cnf(c_0_96,hypothesis,
( esk1_3(n0,filling,n2) = overflow
| holdsAt(waterLevel(n2),n2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_89]) ).
cnf(c_0_97,hypothesis,
( esk1_3(n0,filling,n2) = tapOn
| holdsAt(waterLevel(n3),esk2_3(n0,filling,n2))
| holdsAt(waterLevel(n2),n2) ),
inference(spm,[status(thm)],[c_0_90,c_0_80]) ).
cnf(c_0_98,plain,
overflow != tapOn,
inference(split_conjunct,[status(thm)],[overflow_not_tapOn]) ).
cnf(c_0_99,hypothesis,
( esk2_3(n0,filling,n2) = n0
| esk2_3(n0,filling,n2) = n1
| esk2_3(n0,filling,n2) = n2
| holdsAt(waterLevel(n2),n2) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_101,plain,
( less(X1,esk2_3(X1,X2,X3))
| ~ stoppedIn(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_102,hypothesis,
( esk2_3(n0,filling,n1) = n0
| esk2_3(n0,filling,n1) = n1
| holdsAt(waterLevel(n1),n1) ),
inference(spm,[status(thm)],[c_0_76,c_0_94]) ).
fof(c_0_103,plain,
! [X12,X13,X14] :
( ~ holdsAt(waterLevel(X13),X12)
| ~ holdsAt(waterLevel(X14),X12)
| X13 = X14 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[same_waterLevel])]) ).
fof(c_0_104,negated_conjecture,
holdsAt(waterLevel(n3),n2),
inference(fof_simplification,[status(thm)],[c_0_95]) ).
cnf(c_0_105,hypothesis,
( holdsAt(waterLevel(n3),esk2_3(n0,filling,n2))
| holdsAt(waterLevel(n2),n2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]) ).
cnf(c_0_106,hypothesis,
( esk2_3(n0,filling,n2) = n0
| esk2_3(n0,filling,n2) = n1
| holdsAt(waterLevel(n2),n2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_99]),c_0_100]) ).
cnf(c_0_107,hypothesis,
( holdsAt(waterLevel(n1),n1)
| less(n0,esk2_3(n0,filling,n1)) ),
inference(spm,[status(thm)],[c_0_101,c_0_85]) ).
cnf(c_0_108,hypothesis,
( esk2_3(n0,filling,n1) = n0
| holdsAt(waterLevel(n1),n1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_102]),c_0_100]) ).
cnf(c_0_109,plain,
( X1 = X2
| ~ holdsAt(waterLevel(X2),X3)
| ~ holdsAt(waterLevel(X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_110,negated_conjecture,
holdsAt(waterLevel(n3),n2),
inference(split_conjunct,[status(thm)],[c_0_104]) ).
cnf(c_0_111,hypothesis,
( holdsAt(waterLevel(n2),n2)
| less(n0,esk2_3(n0,filling,n2)) ),
inference(spm,[status(thm)],[c_0_101,c_0_73]) ).
cnf(c_0_112,hypothesis,
( esk2_3(n0,filling,n2) = n0
| holdsAt(waterLevel(n3),n1)
| holdsAt(waterLevel(n2),n2) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
fof(c_0_113,plain,
! [X13,X13] :
( ( ~ less(X13,n3)
| less_or_equal(X13,n2) )
& ( ~ less_or_equal(X13,n2)
| less(X13,n3) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less3])])])]) ).
cnf(c_0_114,hypothesis,
holdsAt(waterLevel(n1),n1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_60]) ).
cnf(c_0_115,negated_conjecture,
( X1 = n3
| ~ holdsAt(waterLevel(X1),n2) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_116,hypothesis,
( holdsAt(waterLevel(n2),n2)
| holdsAt(waterLevel(n3),n1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_60]) ).
cnf(c_0_117,plain,
less(n1,n2),
inference(spm,[status(thm)],[c_0_34,c_0_24]) ).
cnf(c_0_118,plain,
( less(X1,n3)
| ~ less_or_equal(X1,n2) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_119,hypothesis,
( X1 = n1
| ~ holdsAt(waterLevel(X1),n1) ),
inference(spm,[status(thm)],[c_0_109,c_0_114]) ).
cnf(c_0_120,negated_conjecture,
( n2 = n3
| holdsAt(waterLevel(n3),n1) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_121,plain,
less_or_equal(n1,n2),
inference(spm,[status(thm)],[c_0_28,c_0_117]) ).
cnf(c_0_122,plain,
less(n2,n3),
inference(spm,[status(thm)],[c_0_118,c_0_24]) ).
cnf(c_0_123,hypothesis,
( n3 = n1
| n2 = n3 ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_124,plain,
less(n1,n3),
inference(spm,[status(thm)],[c_0_118,c_0_121]) ).
cnf(c_0_125,hypothesis,
n3 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_100]) ).
cnf(c_0_126,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR007+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 10 21:36:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.43 eprover: CPU time limit exceeded, terminating
% 0.36/23.50 eprover: CPU time limit exceeded, terminating
% 0.36/24.54 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.36/24.54 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.36/24.54 # Preprocessing time : 0.015 s
% 0.36/24.54
% 0.36/24.54 # Failure: Out of unprocessed clauses!
% 0.36/24.54 # OLD status GaveUp
% 0.36/24.54 # Parsed axioms : 55
% 0.36/24.54 # Removed by relevancy pruning/SinE : 38
% 0.36/24.54 # Initial clauses : 25
% 0.36/24.54 # Removed in clause preprocessing : 1
% 0.36/24.54 # Initial clauses in saturation : 24
% 0.36/24.54 # Processed clauses : 297
% 0.36/24.54 # ...of these trivial : 3
% 0.36/24.54 # ...subsumed : 176
% 0.36/24.54 # ...remaining for further processing : 118
% 0.36/24.54 # Other redundant clauses eliminated : 2
% 0.36/24.54 # Clauses deleted for lack of memory : 0
% 0.36/24.54 # Backward-subsumed : 10
% 0.36/24.54 # Backward-rewritten : 5
% 0.36/24.54 # Generated clauses : 581
% 0.36/24.54 # ...of the previous two non-trivial : 451
% 0.36/24.54 # Contextual simplify-reflections : 103
% 0.36/24.54 # Paramodulations : 565
% 0.36/24.54 # Factorizations : 13
% 0.36/24.54 # Equation resolutions : 3
% 0.36/24.54 # Current number of processed clauses : 101
% 0.36/24.54 # Positive orientable unit clauses : 21
% 0.36/24.54 # Positive unorientable unit clauses: 1
% 0.36/24.54 # Negative unit clauses : 5
% 0.36/24.54 # Non-unit-clauses : 74
% 0.36/24.54 # Current number of unprocessed clauses: 0
% 0.36/24.54 # ...number of literals in the above : 0
% 0.36/24.54 # Current number of archived formulas : 0
% 0.36/24.54 # Current number of archived clauses : 15
% 0.36/24.54 # Clause-clause subsumption calls (NU) : 4708
% 0.36/24.54 # Rec. Clause-clause subsumption calls : 1018
% 0.36/24.54 # Non-unit clause-clause subsumptions : 285
% 0.36/24.54 # Unit Clause-clause subsumption calls : 20
% 0.36/24.54 # Rewrite failures with RHS unbound : 0
% 0.36/24.54 # BW rewrite match attempts : 17
% 0.36/24.54 # BW rewrite match successes : 12
% 0.36/24.54 # Condensation attempts : 0
% 0.36/24.54 # Condensation successes : 0
% 0.36/24.54 # Termbank termtop insertions : 8582
% 0.36/24.54
% 0.36/24.54 # -------------------------------------------------
% 0.36/24.54 # User time : 0.030 s
% 0.36/24.54 # System time : 0.006 s
% 0.36/24.54 # Total time : 0.036 s
% 0.36/24.54 # Maximum resident set size: 3040 pages
% 0.36/24.54 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.36/24.54 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.36/24.54 # Preprocessing time : 0.015 s
% 0.36/24.54
% 0.36/24.54 # Failure: Out of unprocessed clauses!
% 0.36/24.54 # OLD status GaveUp
% 0.36/24.54 # Parsed axioms : 55
% 0.36/24.54 # Removed by relevancy pruning/SinE : 34
% 0.36/24.54 # Initial clauses : 24
% 0.36/24.54 # Removed in clause preprocessing : 1
% 0.36/24.54 # Initial clauses in saturation : 23
% 0.36/24.54 # Processed clauses : 25
% 0.36/24.54 # ...of these trivial : 0
% 0.36/24.54 # ...subsumed : 0
% 0.36/24.54 # ...remaining for further processing : 25
% 0.36/24.54 # Other redundant clauses eliminated : 0
% 0.36/24.54 # Clauses deleted for lack of memory : 0
% 0.36/24.54 # Backward-subsumed : 0
% 0.36/24.54 # Backward-rewritten : 0
% 0.36/24.54 # Generated clauses : 5
% 0.36/24.54 # ...of the previous two non-trivial : 2
% 0.36/24.54 # Contextual simplify-reflections : 0
% 0.36/24.54 # Paramodulations : 4
% 0.36/24.54 # Factorizations : 0
% 0.36/24.54 # Equation resolutions : 1
% 0.36/24.54 # Current number of processed clauses : 25
% 0.36/24.54 # Positive orientable unit clauses : 8
% 0.36/24.54 # Positive unorientable unit clauses: 0
% 0.36/24.54 # Negative unit clauses : 9
% 0.36/24.54 # Non-unit-clauses : 8
% 0.36/24.54 # Current number of unprocessed clauses: 0
% 0.36/24.54 # ...number of literals in the above : 0
% 0.36/24.54 # Current number of archived formulas : 0
% 0.36/24.54 # Current number of archived clauses : 0
% 0.36/24.54 # Clause-clause subsumption calls (NU) : 3
% 0.36/24.54 # Rec. Clause-clause subsumption calls : 3
% 0.36/24.54 # Non-unit clause-clause subsumptions : 0
% 0.36/24.54 # Unit Clause-clause subsumption calls : 0
% 0.36/24.54 # Rewrite failures with RHS unbound : 0
% 0.36/24.54 # BW rewrite match attempts : 0
% 0.36/24.54 # BW rewrite match successes : 0
% 0.36/24.54 # Condensation attempts : 0
% 0.36/24.54 # Condensation successes : 0
% 0.36/24.54 # Termbank termtop insertions : 1250
% 0.36/24.54
% 0.36/24.54 # -------------------------------------------------
% 0.36/24.54 # User time : 0.012 s
% 0.36/24.54 # System time : 0.004 s
% 0.36/24.54 # Total time : 0.016 s
% 0.36/24.54 # Maximum resident set size: 2772 pages
% 0.36/24.54 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.36/24.54 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.36/24.54 # Preprocessing time : 0.016 s
% 0.36/24.54
% 0.36/24.54 # Failure: Out of unprocessed clauses!
% 0.36/24.54 # OLD status GaveUp
% 0.36/24.54 # Parsed axioms : 55
% 0.36/24.54 # Removed by relevancy pruning/SinE : 30
% 0.36/24.54 # Initial clauses : 33
% 0.36/24.54 # Removed in clause preprocessing : 1
% 0.36/24.54 # Initial clauses in saturation : 32
% 0.36/24.54 # Processed clauses : 127
% 0.36/24.54 # ...of these trivial : 0
% 0.36/24.54 # ...subsumed : 61
% 0.36/24.54 # ...remaining for further processing : 66
% 0.36/24.54 # Other redundant clauses eliminated : 2
% 0.36/24.54 # Clauses deleted for lack of memory : 0
% 0.36/24.54 # Backward-subsumed : 0
% 0.36/24.54 # Backward-rewritten : 0
% 0.36/24.54 # Generated clauses : 126
% 0.36/24.54 # ...of the previous two non-trivial : 95
% 0.36/24.54 # Contextual simplify-reflections : 29
% 0.36/24.54 # Paramodulations : 121
% 0.36/24.54 # Factorizations : 2
% 0.36/24.54 # Equation resolutions : 3
% 0.36/24.54 # Current number of processed clauses : 64
% 0.36/24.54 # Positive orientable unit clauses : 12
% 0.36/24.54 # Positive unorientable unit clauses: 1
% 0.36/24.54 # Negative unit clauses : 13
% 0.36/24.54 # Non-unit-clauses : 38
% 0.36/24.54 # Current number of unprocessed clauses: 0
% 0.36/24.54 # ...number of literals in the above : 0
% 0.36/24.54 # Current number of archived formulas : 0
% 0.36/24.54 # Current number of archived clauses : 0
% 0.36/24.54 # Clause-clause subsumption calls (NU) : 632
% 0.36/24.54 # Rec. Clause-clause subsumption calls : 299
% 0.36/24.54 # Non-unit clause-clause subsumptions : 69
% 0.36/24.54 # Unit Clause-clause subsumption calls : 45
% 0.36/24.54 # Rewrite failures with RHS unbound : 0
% 0.36/24.54 # BW rewrite match attempts : 12
% 0.36/24.54 # BW rewrite match successes : 8
% 0.36/24.54 # Condensation attempts : 0
% 0.36/24.54 # Condensation successes : 0
% 0.36/24.54 # Termbank termtop insertions : 2306
% 0.36/24.54
% 0.36/24.54 # -------------------------------------------------
% 0.36/24.54 # User time : 0.017 s
% 0.36/24.54 # System time : 0.004 s
% 0.36/24.54 # Total time : 0.021 s
% 0.36/24.54 # Maximum resident set size: 3084 pages
% 0.36/24.54 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.36/24.54
% 0.36/24.54 # Failure: Resource limit exceeded (time)
% 0.36/24.54 # OLD status Res
% 0.36/24.54 # Preprocessing time : 0.021 s
% 0.36/24.54 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.36/24.54 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.36/24.54 # Preprocessing time : 0.009 s
% 0.36/24.54
% 0.36/24.54 # Failure: Out of unprocessed clauses!
% 0.36/24.54 # OLD status GaveUp
% 0.36/24.54 # Parsed axioms : 55
% 0.36/24.54 # Removed by relevancy pruning/SinE : 28
% 0.36/24.54 # Initial clauses : 39
% 0.36/24.54 # Removed in clause preprocessing : 1
% 0.36/24.54 # Initial clauses in saturation : 38
% 0.36/24.54 # Processed clauses : 196
% 0.36/24.54 # ...of these trivial : 0
% 0.36/24.54 # ...subsumed : 118
% 0.36/24.54 # ...remaining for further processing : 78
% 0.36/24.54 # Other redundant clauses eliminated : 2
% 0.36/24.54 # Clauses deleted for lack of memory : 0
% 0.36/24.54 # Backward-subsumed : 0
% 0.36/24.54 # Backward-rewritten : 5
% 0.36/24.54 # Generated clauses : 201
% 0.36/24.54 # ...of the previous two non-trivial : 158
% 0.36/24.54 # Contextual simplify-reflections : 29
% 0.36/24.54 # Paramodulations : 196
% 0.36/24.54 # Factorizations : 2
% 0.36/24.54 # Equation resolutions : 3
% 0.36/24.54 # Current number of processed clauses : 71
% 0.36/24.54 # Positive orientable unit clauses : 12
% 0.36/24.54 # Positive unorientable unit clauses: 1
% 0.36/24.54 # Negative unit clauses : 9
% 0.36/24.54 # Non-unit-clauses : 49
% 0.36/24.54 # Current number of unprocessed clauses: 0
% 0.36/24.54 # ...number of literals in the above : 0
% 0.36/24.54 # Current number of archived formulas : 0
% 0.36/24.54 # Current number of archived clauses : 5
% 0.36/24.54 # Clause-clause subsumption calls (NU) : 2172
% 0.36/24.54 # Rec. Clause-clause subsumption calls : 851
% 0.36/24.54 # Non-unit clause-clause subsumptions : 118
% 0.36/24.54 # Unit Clause-clause subsumption calls : 26
% 0.36/24.54 # Rewrite failures with RHS unbound : 0
% 0.36/24.54 # BW rewrite match attempts : 12
% 0.36/24.54 # BW rewrite match successes : 8
% 0.36/24.54 # Condensation attempts : 0
% 0.36/24.54 # Condensation successes : 0
% 0.36/24.54 # Termbank termtop insertions : 6509
% 0.36/24.54
% 0.36/24.54 # -------------------------------------------------
% 0.36/24.54 # User time : 0.012 s
% 0.36/24.54 # System time : 0.002 s
% 0.36/24.54 # Total time : 0.014 s
% 0.36/24.54 # Maximum resident set size: 3056 pages
% 0.36/24.54 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.36/24.54 # Preprocessing time : 0.011 s
% 0.36/24.54
% 0.36/24.54 # Proof found!
% 0.36/24.54 # SZS status Theorem
% 0.36/24.54 # SZS output start CNFRefutation
% See solution above
% 0.36/24.54 # Proof object total steps : 127
% 0.36/24.54 # Proof object clause steps : 89
% 0.36/24.54 # Proof object formula steps : 38
% 0.36/24.54 # Proof object conjectures : 6
% 0.36/24.54 # Proof object clause conjectures : 3
% 0.36/24.54 # Proof object formula conjectures : 3
% 0.36/24.54 # Proof object initial clauses used : 32
% 0.36/24.54 # Proof object initial formulas used : 20
% 0.36/24.54 # Proof object generating inferences : 54
% 0.36/24.54 # Proof object simplifying inferences : 21
% 0.36/24.54 # Training examples: 0 positive, 0 negative
% 0.36/24.54 # Parsed axioms : 55
% 0.36/24.54 # Removed by relevancy pruning/SinE : 0
% 0.36/24.54 # Initial clauses : 137
% 0.36/24.54 # Removed in clause preprocessing : 1
% 0.36/24.54 # Initial clauses in saturation : 136
% 0.36/24.54 # Processed clauses : 1997
% 0.36/24.54 # ...of these trivial : 75
% 0.36/24.54 # ...subsumed : 791
% 0.36/24.54 # ...remaining for further processing : 1131
% 0.36/24.54 # Other redundant clauses eliminated : 2
% 0.36/24.54 # Clauses deleted for lack of memory : 0
% 0.36/24.54 # Backward-subsumed : 231
% 0.36/24.54 # Backward-rewritten : 392
% 0.36/24.54 # Generated clauses : 6055
% 0.36/24.54 # ...of the previous two non-trivial : 3783
% 0.36/24.54 # Contextual simplify-reflections : 0
% 0.36/24.54 # Paramodulations : 5954
% 0.36/24.54 # Factorizations : 59
% 0.36/24.54 # Equation resolutions : 42
% 0.36/24.54 # Current number of processed clauses : 506
% 0.36/24.54 # Positive orientable unit clauses : 114
% 0.36/24.54 # Positive unorientable unit clauses: 1
% 0.36/24.54 # Negative unit clauses : 44
% 0.36/24.54 # Non-unit-clauses : 347
% 0.36/24.54 # Current number of unprocessed clauses: 404
% 0.36/24.54 # ...number of literals in the above : 1698
% 0.36/24.54 # Current number of archived formulas : 0
% 0.36/24.54 # Current number of archived clauses : 623
% 0.36/24.54 # Clause-clause subsumption calls (NU) : 13515
% 0.36/24.54 # Rec. Clause-clause subsumption calls : 5562
% 0.36/24.54 # Non-unit clause-clause subsumptions : 894
% 0.36/24.54 # Unit Clause-clause subsumption calls : 2391
% 0.36/24.54 # Rewrite failures with RHS unbound : 0
% 0.36/24.54 # BW rewrite match attempts : 91
% 0.36/24.54 # BW rewrite match successes : 45
% 0.36/24.54 # Condensation attempts : 0
% 0.36/24.54 # Condensation successes : 0
% 0.36/24.54 # Termbank termtop insertions : 89578
% 0.36/24.54
% 0.36/24.54 # -------------------------------------------------
% 0.36/24.54 # User time : 0.078 s
% 0.36/24.54 # System time : 0.002 s
% 0.36/24.54 # Total time : 0.080 s
% 0.36/24.54 # Maximum resident set size: 6840 pages
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.45 eprover: CPU time limit exceeded, terminating
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: CPU time limit exceeded, terminating
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.51 eprover: No such file or directory
% 0.36/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.36/46.51 eprover: No such file or directory
%------------------------------------------------------------------------------