TSTP Solution File: CSR002+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR002+2 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 05:50:29 EST 2010
% Result : Theorem 240.45s
% Output : CNFRefutation 240.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 22
% Syntax : Number of formulae : 134 ( 40 unt; 0 def)
% Number of atoms : 458 ( 159 equ)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 539 ( 215 ~; 234 |; 76 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 3 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-3 aty)
% Number of variables : 197 ( 11 sgn 103 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X4] : filling != waterLevel(X4),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',filling_not_waterLevel) ).
fof(6,axiom,
! [X3,X2] :
( ( ~ releasedAt(X3,X2)
& ~ ? [X1] :
( happens(X1,X2)
& releases(X1,X3,X2) ) )
=> ~ releasedAt(X3,plus(X2,n1)) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',keep_not_released) ).
fof(8,axiom,
! [X1,X2] :
( happens(X1,X2)
<=> ( ( X1 = tapOn
& X2 = n0 )
| ( holdsAt(waterLevel(n3),X2)
& holdsAt(filling,X2)
& X1 = overflow ) ) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',happens_all_defn) ).
fof(9,axiom,
! [X3,X2] :
( ( ~ holdsAt(X3,X2)
& ~ releasedAt(X3,plus(X2,n1))
& ~ ? [X1] :
( happens(X1,X2)
& initiates(X1,X3,X2) ) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',keep_not_holding) ).
fof(11,axiom,
! [X1,X3,X2] :
( terminates(X1,X3,X2)
<=> ( ( X1 = tapOff
& X3 = filling )
| ( X1 = overflow
& X3 = filling ) ) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',terminates_all_defn) ).
fof(16,axiom,
overflow != tapOn,
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',overflow_not_tapOn) ).
fof(18,axiom,
! [X1,X3,X2] :
( releases(X1,X3,X2)
<=> ? [X10] :
( X1 = tapOn
& X3 = waterLevel(X10) ) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',releases_all_defn) ).
fof(21,axiom,
! [X1,X2,X3] :
( ( happens(X1,X2)
& terminates(X1,X3,X2) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',happens_terminates_not_holds) ).
fof(26,axiom,
plus(n1,n3) = n4,
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',plus1_3) ).
fof(27,axiom,
plus(n1,n2) = n3,
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',plus1_2) ).
fof(28,axiom,
plus(n1,n1) = n2,
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',plus1_1) ).
fof(32,axiom,
plus(n0,n1) = n1,
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',plus0_1) ).
fof(34,axiom,
holdsAt(waterLevel(n3),n3),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',waterLevel_3) ).
fof(41,axiom,
~ releasedAt(filling,n0),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',not_released_filling_0) ).
fof(42,axiom,
! [X4,X9] : plus(X4,X9) = plus(X9,X4),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',symmetry_of_plus) ).
fof(44,conjecture,
~ holdsAt(filling,n4),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',not_filling_4) ).
fof(45,axiom,
! [X4,X9] :
( less_or_equal(X4,X9)
<=> ( less(X4,X9)
| X4 = X9 ) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',less_or_equal) ).
fof(53,axiom,
~ ? [X4] : less(X4,n0),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',less0) ).
fof(55,axiom,
! [X4] :
( less(X4,n2)
<=> less_or_equal(X4,n1) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',less2) ).
fof(56,axiom,
! [X4] :
( less(X4,n3)
<=> less_or_equal(X4,n2) ),
file('/tmp/tmpRJLEqm/sel_CSR002+2.p_5',less3) ).
fof(57,negated_conjecture,
~ ~ holdsAt(filling,n4),
inference(assume_negation,[status(cth)],[44]) ).
fof(59,plain,
! [X3,X2] :
( ( ~ releasedAt(X3,X2)
& ~ ? [X1] :
( happens(X1,X2)
& releases(X1,X3,X2) ) )
=> ~ releasedAt(X3,plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(60,plain,
! [X3,X2] :
( ( ~ holdsAt(X3,X2)
& ~ releasedAt(X3,plus(X2,n1))
& ~ ? [X1] :
( happens(X1,X2)
& initiates(X1,X3,X2) ) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(64,plain,
! [X1,X2,X3] :
( ( happens(X1,X2)
& terminates(X1,X3,X2) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(68,plain,
~ releasedAt(filling,n0),
inference(fof_simplification,[status(thm)],[41,theory(equality)]) ).
fof(70,negated_conjecture,
holdsAt(filling,n4),
inference(fof_simplification,[status(thm)],[57,theory(equality)]) ).
fof(78,plain,
! [X5] : filling != waterLevel(X5),
inference(variable_rename,[status(thm)],[3]) ).
cnf(79,plain,
filling != waterLevel(X1),
inference(split_conjunct,[status(thm)],[78]) ).
fof(85,plain,
! [X3,X2] :
( releasedAt(X3,X2)
| ? [X1] :
( happens(X1,X2)
& releases(X1,X3,X2) )
| ~ releasedAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(86,plain,
! [X4,X5] :
( releasedAt(X4,X5)
| ? [X6] :
( happens(X6,X5)
& releases(X6,X4,X5) )
| ~ releasedAt(X4,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[85]) ).
fof(87,plain,
! [X4,X5] :
( releasedAt(X4,X5)
| ( happens(esk1_2(X4,X5),X5)
& releases(esk1_2(X4,X5),X4,X5) )
| ~ releasedAt(X4,plus(X5,n1)) ),
inference(skolemize,[status(esa)],[86]) ).
fof(88,plain,
! [X4,X5] :
( ( happens(esk1_2(X4,X5),X5)
| releasedAt(X4,X5)
| ~ releasedAt(X4,plus(X5,n1)) )
& ( releases(esk1_2(X4,X5),X4,X5)
| releasedAt(X4,X5)
| ~ releasedAt(X4,plus(X5,n1)) ) ),
inference(distribute,[status(thm)],[87]) ).
cnf(89,plain,
( releasedAt(X1,X2)
| releases(esk1_2(X1,X2),X1,X2)
| ~ releasedAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[88]) ).
cnf(90,plain,
( releasedAt(X1,X2)
| happens(esk1_2(X1,X2),X2)
| ~ releasedAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(94,plain,
! [X1,X2] :
( ( ~ happens(X1,X2)
| ( X1 = tapOn
& X2 = n0 )
| ( holdsAt(waterLevel(n3),X2)
& holdsAt(filling,X2)
& X1 = overflow ) )
& ( ( ( X1 != tapOn
| X2 != n0 )
& ( ~ holdsAt(waterLevel(n3),X2)
| ~ holdsAt(filling,X2)
| X1 != overflow ) )
| happens(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(95,plain,
! [X3,X4] :
( ( ~ happens(X3,X4)
| ( X3 = tapOn
& X4 = n0 )
| ( holdsAt(waterLevel(n3),X4)
& holdsAt(filling,X4)
& X3 = overflow ) )
& ( ( ( X3 != tapOn
| X4 != n0 )
& ( ~ holdsAt(waterLevel(n3),X4)
| ~ holdsAt(filling,X4)
| X3 != overflow ) )
| happens(X3,X4) ) ),
inference(variable_rename,[status(thm)],[94]) ).
fof(96,plain,
! [X3,X4] :
( ( holdsAt(waterLevel(n3),X4)
| X3 = tapOn
| ~ happens(X3,X4) )
& ( holdsAt(filling,X4)
| X3 = tapOn
| ~ happens(X3,X4) )
& ( X3 = overflow
| X3 = tapOn
| ~ happens(X3,X4) )
& ( holdsAt(waterLevel(n3),X4)
| X4 = n0
| ~ happens(X3,X4) )
& ( holdsAt(filling,X4)
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = overflow
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 != tapOn
| X4 != n0
| happens(X3,X4) )
& ( ~ holdsAt(waterLevel(n3),X4)
| ~ holdsAt(filling,X4)
| X3 != overflow
| happens(X3,X4) ) ),
inference(distribute,[status(thm)],[95]) ).
cnf(97,plain,
( happens(X1,X2)
| X1 != overflow
| ~ holdsAt(filling,X2)
| ~ holdsAt(waterLevel(n3),X2) ),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(99,plain,
( X2 = n0
| X1 = overflow
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[96]) ).
fof(105,plain,
! [X3,X2] :
( holdsAt(X3,X2)
| releasedAt(X3,plus(X2,n1))
| ? [X1] :
( happens(X1,X2)
& initiates(X1,X3,X2) )
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(106,plain,
! [X4,X5] :
( holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ? [X6] :
( happens(X6,X5)
& initiates(X6,X4,X5) )
| ~ holdsAt(X4,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[105]) ).
fof(107,plain,
! [X4,X5] :
( holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ( happens(esk2_2(X4,X5),X5)
& initiates(esk2_2(X4,X5),X4,X5) )
| ~ holdsAt(X4,plus(X5,n1)) ),
inference(skolemize,[status(esa)],[106]) ).
fof(108,plain,
! [X4,X5] :
( ( happens(esk2_2(X4,X5),X5)
| holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ~ holdsAt(X4,plus(X5,n1)) )
& ( initiates(esk2_2(X4,X5),X4,X5)
| holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ~ holdsAt(X4,plus(X5,n1)) ) ),
inference(distribute,[status(thm)],[107]) ).
cnf(110,plain,
( releasedAt(X1,plus(X2,n1))
| holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[108]) ).
fof(121,plain,
! [X1,X3,X2] :
( ( ~ terminates(X1,X3,X2)
| ( X1 = tapOff
& X3 = filling )
| ( X1 = overflow
& X3 = filling ) )
& ( ( ( X1 != tapOff
| X3 != filling )
& ( X1 != overflow
| X3 != filling ) )
| terminates(X1,X3,X2) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(122,plain,
! [X4,X5,X6] :
( ( ~ terminates(X4,X5,X6)
| ( X4 = tapOff
& X5 = filling )
| ( X4 = overflow
& X5 = filling ) )
& ( ( ( X4 != tapOff
| X5 != filling )
& ( X4 != overflow
| X5 != filling ) )
| terminates(X4,X5,X6) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X4,X5,X6] :
( ( X4 = overflow
| X4 = tapOff
| ~ terminates(X4,X5,X6) )
& ( X5 = filling
| X4 = tapOff
| ~ terminates(X4,X5,X6) )
& ( X4 = overflow
| X5 = filling
| ~ terminates(X4,X5,X6) )
& ( X5 = filling
| X5 = filling
| ~ terminates(X4,X5,X6) )
& ( X4 != tapOff
| X5 != filling
| terminates(X4,X5,X6) )
& ( X4 != overflow
| X5 != filling
| terminates(X4,X5,X6) ) ),
inference(distribute,[status(thm)],[122]) ).
cnf(124,plain,
( terminates(X1,X2,X3)
| X2 != filling
| X1 != overflow ),
inference(split_conjunct,[status(thm)],[123]) ).
cnf(151,plain,
overflow != tapOn,
inference(split_conjunct,[status(thm)],[16]) ).
fof(153,plain,
! [X1,X3,X2] :
( ( ~ releases(X1,X3,X2)
| ? [X10] :
( X1 = tapOn
& X3 = waterLevel(X10) ) )
& ( ! [X10] :
( X1 != tapOn
| X3 != waterLevel(X10) )
| releases(X1,X3,X2) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(154,plain,
! [X11,X12,X13] :
( ( ~ releases(X11,X12,X13)
| ? [X14] :
( X11 = tapOn
& X12 = waterLevel(X14) ) )
& ( ! [X15] :
( X11 != tapOn
| X12 != waterLevel(X15) )
| releases(X11,X12,X13) ) ),
inference(variable_rename,[status(thm)],[153]) ).
fof(155,plain,
! [X11,X12,X13] :
( ( ~ releases(X11,X12,X13)
| ( X11 = tapOn
& X12 = waterLevel(esk7_3(X11,X12,X13)) ) )
& ( ! [X15] :
( X11 != tapOn
| X12 != waterLevel(X15) )
| releases(X11,X12,X13) ) ),
inference(skolemize,[status(esa)],[154]) ).
fof(156,plain,
! [X11,X12,X13,X15] :
( ( X11 != tapOn
| X12 != waterLevel(X15)
| releases(X11,X12,X13) )
& ( ~ releases(X11,X12,X13)
| ( X11 = tapOn
& X12 = waterLevel(esk7_3(X11,X12,X13)) ) ) ),
inference(shift_quantors,[status(thm)],[155]) ).
fof(157,plain,
! [X11,X12,X13,X15] :
( ( X11 != tapOn
| X12 != waterLevel(X15)
| releases(X11,X12,X13) )
& ( X11 = tapOn
| ~ releases(X11,X12,X13) )
& ( X12 = waterLevel(esk7_3(X11,X12,X13))
| ~ releases(X11,X12,X13) ) ),
inference(distribute,[status(thm)],[156]) ).
cnf(158,plain,
( X2 = waterLevel(esk7_3(X1,X2,X3))
| ~ releases(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[157]) ).
cnf(159,plain,
( X1 = tapOn
| ~ releases(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[157]) ).
fof(174,plain,
! [X1,X2,X3] :
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[64]) ).
fof(175,plain,
! [X4,X5,X6] :
( ~ happens(X4,X5)
| ~ terminates(X4,X6,X5)
| ~ holdsAt(X6,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[174]) ).
cnf(176,plain,
( ~ holdsAt(X1,plus(X2,n1))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[175]) ).
cnf(188,plain,
plus(n1,n3) = n4,
inference(split_conjunct,[status(thm)],[26]) ).
cnf(189,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[27]) ).
cnf(190,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[28]) ).
cnf(194,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[32]) ).
cnf(196,plain,
holdsAt(waterLevel(n3),n3),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(208,plain,
~ releasedAt(filling,n0),
inference(split_conjunct,[status(thm)],[68]) ).
fof(209,plain,
! [X10,X11] : plus(X10,X11) = plus(X11,X10),
inference(variable_rename,[status(thm)],[42]) ).
cnf(210,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[209]) ).
cnf(213,negated_conjecture,
holdsAt(filling,n4),
inference(split_conjunct,[status(thm)],[70]) ).
fof(214,plain,
! [X4,X9] :
( ( ~ less_or_equal(X4,X9)
| less(X4,X9)
| X4 = X9 )
& ( ( ~ less(X4,X9)
& X4 != X9 )
| less_or_equal(X4,X9) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(215,plain,
! [X10,X11] :
( ( ~ less_or_equal(X10,X11)
| less(X10,X11)
| X10 = X11 )
& ( ( ~ less(X10,X11)
& X10 != X11 )
| less_or_equal(X10,X11) ) ),
inference(variable_rename,[status(thm)],[214]) ).
fof(216,plain,
! [X10,X11] :
( ( ~ less_or_equal(X10,X11)
| less(X10,X11)
| X10 = X11 )
& ( ~ less(X10,X11)
| less_or_equal(X10,X11) )
& ( X10 != X11
| less_or_equal(X10,X11) ) ),
inference(distribute,[status(thm)],[215]) ).
cnf(217,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[216]) ).
cnf(218,plain,
( less_or_equal(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[216]) ).
fof(245,plain,
! [X4] : ~ less(X4,n0),
inference(fof_nnf,[status(thm)],[53]) ).
fof(246,plain,
! [X5] : ~ less(X5,n0),
inference(variable_rename,[status(thm)],[245]) ).
cnf(247,plain,
~ less(X1,n0),
inference(split_conjunct,[status(thm)],[246]) ).
fof(252,plain,
! [X4] :
( ( ~ less(X4,n2)
| less_or_equal(X4,n1) )
& ( ~ less_or_equal(X4,n1)
| less(X4,n2) ) ),
inference(fof_nnf,[status(thm)],[55]) ).
fof(253,plain,
! [X5] :
( ( ~ less(X5,n2)
| less_or_equal(X5,n1) )
& ( ~ less_or_equal(X5,n1)
| less(X5,n2) ) ),
inference(variable_rename,[status(thm)],[252]) ).
cnf(254,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[253]) ).
fof(256,plain,
! [X4] :
( ( ~ less(X4,n3)
| less_or_equal(X4,n2) )
& ( ~ less_or_equal(X4,n2)
| less(X4,n3) ) ),
inference(fof_nnf,[status(thm)],[56]) ).
fof(257,plain,
! [X5] :
( ( ~ less(X5,n3)
| less_or_equal(X5,n2) )
& ( ~ less_or_equal(X5,n2)
| less(X5,n3) ) ),
inference(variable_rename,[status(thm)],[256]) ).
cnf(258,plain,
( less(X1,n3)
| ~ less_or_equal(X1,n2) ),
inference(split_conjunct,[status(thm)],[257]) ).
cnf(306,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[217,theory(equality)]) ).
cnf(319,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[194,210,theory(equality)]) ).
cnf(329,plain,
( less(X1,n3)
| ~ less(X1,n2) ),
inference(spm,[status(thm)],[258,218,theory(equality)]) ).
cnf(369,plain,
( X2 != filling
| ~ releases(X1,X2,X3) ),
inference(spm,[status(thm)],[79,158,theory(equality)]) ).
cnf(458,plain,
( n0 = X1
| overflow = esk1_2(X2,X1)
| releasedAt(X2,X1)
| ~ releasedAt(X2,plus(X1,n1)) ),
inference(spm,[status(thm)],[99,90,theory(equality)]) ).
cnf(475,plain,
( tapOn = esk1_2(X1,X2)
| releasedAt(X1,X2)
| ~ releasedAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[159,89,theory(equality)]) ).
cnf(487,plain,
( ~ holdsAt(X2,plus(X3,n1))
| ~ happens(X1,X3)
| overflow != X1
| filling != X2 ),
inference(spm,[status(thm)],[176,124,theory(equality)]) ).
cnf(522,plain,
( n0 = X1
| overflow = esk2_2(X2,X1)
| holdsAt(X2,X1)
| releasedAt(X2,plus(X1,n1))
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(spm,[status(thm)],[99,110,theory(equality)]) ).
cnf(649,plain,
less(n1,n2),
inference(spm,[status(thm)],[254,306,theory(equality)]) ).
cnf(742,plain,
less(n1,n3),
inference(spm,[status(thm)],[329,649,theory(equality)]) ).
cnf(753,plain,
( releasedAt(X1,X2)
| X1 != filling
| ~ releasedAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[369,89,theory(equality)]) ).
cnf(2060,plain,
( releasedAt(X1,n1)
| X1 != filling
| ~ releasedAt(X1,n2) ),
inference(spm,[status(thm)],[753,190,theory(equality)]) ).
cnf(2061,plain,
( releasedAt(X1,X2)
| X1 != filling
| ~ releasedAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[753,210,theory(equality)]) ).
cnf(2127,plain,
( releasedAt(X1,n2)
| X1 != filling
| ~ releasedAt(X1,n3) ),
inference(spm,[status(thm)],[2061,189,theory(equality)]) ).
cnf(2128,plain,
( releasedAt(X1,n0)
| X1 != filling
| ~ releasedAt(X1,n1) ),
inference(spm,[status(thm)],[2061,319,theory(equality)]) ).
cnf(2133,plain,
( releasedAt(X1,n1)
| X1 != filling
| ~ releasedAt(X1,n3) ),
inference(spm,[status(thm)],[2060,2127,theory(equality)]) ).
cnf(2137,plain,
~ releasedAt(filling,n1),
inference(spm,[status(thm)],[208,2128,theory(equality)]) ).
cnf(2972,plain,
( tapOn = overflow
| n0 = X2
| releasedAt(X1,X2)
| ~ releasedAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[458,475,theory(equality)]) ).
cnf(2973,plain,
( n0 = X2
| releasedAt(X1,X2)
| ~ releasedAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[2972,151,theory(equality)]) ).
cnf(3015,plain,
( n0 = X1
| releasedAt(X2,X1)
| ~ releasedAt(X2,plus(n1,X1)) ),
inference(spm,[status(thm)],[2973,210,theory(equality)]) ).
cnf(3022,plain,
( n0 = n3
| releasedAt(X1,n3)
| ~ releasedAt(X1,n4) ),
inference(spm,[status(thm)],[3015,188,theory(equality)]) ).
cnf(3329,plain,
( overflow != X1
| filling != X2
| ~ holdsAt(X2,plus(n1,X3))
| ~ happens(X1,X3) ),
inference(spm,[status(thm)],[487,210,theory(equality)]) ).
cnf(6565,plain,
( overflow != X1
| filling != X2
| ~ holdsAt(X2,n4)
| ~ happens(X1,n3) ),
inference(spm,[status(thm)],[3329,188,theory(equality)]) ).
fof(6582,plain,
( ~ epred66_0
<=> ! [X1] :
( ~ happens(X1,n3)
| overflow != X1 ) ),
introduced(definition),
[split] ).
cnf(6583,plain,
( epred66_0
| ~ happens(X1,n3)
| overflow != X1 ),
inference(split_equiv,[status(thm)],[6582]) ).
fof(6584,plain,
( ~ epred67_0
<=> ! [X2] :
( ~ holdsAt(X2,n4)
| filling != X2 ) ),
introduced(definition),
[split] ).
cnf(6585,plain,
( epred67_0
| ~ holdsAt(X2,n4)
| filling != X2 ),
inference(split_equiv,[status(thm)],[6584]) ).
cnf(6586,plain,
( ~ epred67_0
| ~ epred66_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[6565,6582,theory(equality)]),6584,theory(equality)]),
[split] ).
cnf(6602,negated_conjecture,
epred67_0,
inference(spm,[status(thm)],[6585,213,theory(equality)]) ).
cnf(6639,plain,
( $false
| ~ epred66_0 ),
inference(rw,[status(thm)],[6586,6602,theory(equality)]) ).
cnf(6640,plain,
~ epred66_0,
inference(cn,[status(thm)],[6639,theory(equality)]) ).
cnf(6669,plain,
( ~ happens(X1,n3)
| overflow != X1 ),
inference(sr,[status(thm)],[6583,6640,theory(equality)]) ).
cnf(6671,plain,
( overflow != X1
| ~ holdsAt(waterLevel(n3),n3)
| ~ holdsAt(filling,n3) ),
inference(spm,[status(thm)],[6669,97,theory(equality)]) ).
cnf(6675,plain,
( holdsAt(X1,n3)
| releasedAt(X1,plus(n3,n1))
| overflow != esk2_2(X1,n3)
| ~ holdsAt(X1,plus(n3,n1)) ),
inference(spm,[status(thm)],[6669,110,theory(equality)]) ).
cnf(6676,plain,
( overflow != X1
| $false
| ~ holdsAt(filling,n3) ),
inference(rw,[status(thm)],[6671,196,theory(equality)]) ).
cnf(6677,plain,
( overflow != X1
| ~ holdsAt(filling,n3) ),
inference(cn,[status(thm)],[6676,theory(equality)]) ).
cnf(6682,plain,
( holdsAt(X1,n3)
| releasedAt(X1,n4)
| overflow != esk2_2(X1,n3)
| ~ holdsAt(X1,plus(n3,n1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[6675,210,theory(equality)]),188,theory(equality)]) ).
cnf(6683,plain,
( holdsAt(X1,n3)
| releasedAt(X1,n4)
| overflow != esk2_2(X1,n3)
| ~ holdsAt(X1,n4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[6682,210,theory(equality)]),188,theory(equality)]) ).
cnf(7512,plain,
( holdsAt(X1,n3)
| releasedAt(X1,n4)
| n0 = n3
| releasedAt(X1,plus(n3,n1))
| ~ holdsAt(X1,n4)
| ~ holdsAt(X1,plus(n3,n1)) ),
inference(spm,[status(thm)],[6683,522,theory(equality)]) ).
cnf(7516,plain,
( holdsAt(X1,n3)
| releasedAt(X1,n4)
| n0 = n3
| releasedAt(X1,n4)
| ~ holdsAt(X1,n4)
| ~ holdsAt(X1,plus(n3,n1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[7512,210,theory(equality)]),188,theory(equality)]) ).
cnf(7517,plain,
( holdsAt(X1,n3)
| releasedAt(X1,n4)
| n0 = n3
| releasedAt(X1,n4)
| ~ holdsAt(X1,n4)
| ~ holdsAt(X1,n4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[7516,210,theory(equality)]),188,theory(equality)]) ).
cnf(7518,plain,
( holdsAt(X1,n3)
| releasedAt(X1,n4)
| n0 = n3
| ~ holdsAt(X1,n4) ),
inference(cn,[status(thm)],[7517,theory(equality)]) ).
cnf(7531,plain,
( n3 = n0
| releasedAt(X1,n3)
| holdsAt(X1,n3)
| ~ holdsAt(X1,n4) ),
inference(spm,[status(thm)],[3022,7518,theory(equality)]) ).
cnf(8650,plain,
( releasedAt(X1,n1)
| n3 = n0
| holdsAt(X1,n3)
| X1 != filling
| ~ holdsAt(X1,n4) ),
inference(spm,[status(thm)],[2133,7531,theory(equality)]) ).
cnf(10773,plain,
( n3 = n0
| holdsAt(filling,n3)
| ~ holdsAt(filling,n4) ),
inference(spm,[status(thm)],[2137,8650,theory(equality)]) ).
cnf(10783,plain,
( n3 = n0
| holdsAt(filling,n3)
| $false ),
inference(rw,[status(thm)],[10773,213,theory(equality)]) ).
cnf(10784,plain,
( n3 = n0
| holdsAt(filling,n3) ),
inference(cn,[status(thm)],[10783,theory(equality)]) ).
cnf(10788,plain,
( n3 = n0
| overflow != X1 ),
inference(spm,[status(thm)],[6677,10784,theory(equality)]) ).
cnf(10938,plain,
n3 = n0,
inference(er,[status(thm)],[10788,theory(equality)]) ).
cnf(10939,plain,
less(n1,n0),
inference(rw,[status(thm)],[742,10938,theory(equality)]) ).
cnf(10940,plain,
$false,
inference(sr,[status(thm)],[10939,247,theory(equality)]) ).
cnf(10941,plain,
$false,
10940,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR002+2.p
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpRJLEqm/sel_CSR002+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpRJLEqm/sel_CSR002+2.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpRJLEqm/sel_CSR002+2.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpRJLEqm/sel_CSR002+2.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [CSR001+0.ax, CSR001+1.ax]
% -running prover on /tmp/tmpRJLEqm/sel_CSR002+2.p_5 with time limit 55
% -prover status Theorem
% Problem CSR002+2.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR002+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR002+2.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------