TSTP Solution File: CSR023+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR023+1 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 06:00:31 EST 2010
% Result : Theorem 0.84s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 55
% Number of leaves : 31
% Syntax : Number of formulae : 286 ( 46 unt; 0 def)
% Number of atoms : 1616 ( 664 equ)
% Maximal formula atoms : 149 ( 5 avg)
% Number of connectives : 2006 ( 676 ~;1007 |; 294 &)
% ( 22 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 7 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 411 ( 23 sgn 162 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( ( happens(X1,X2)
& terminates(X1,X3,X2) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',happens_terminates_not_holds) ).
fof(2,axiom,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> ( ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) ) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',initiates_all_defn) ).
fof(3,axiom,
spinning != backwards,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',spinning_not_backwards) ).
fof(4,axiom,
forwards != backwards,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',forwards_not_backwards) ).
fof(5,axiom,
! [X1,X3,X2] :
( terminates(X1,X3,X2)
<=> ( ( X1 = push
& X3 = backwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = forwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = forwards
& happens(push,X2) )
| ( X1 = pull
& X3 = backwards
& happens(push,X2) )
| ( X1 = push
& X3 = spinning
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = spinning
& ~ happens(push,X2) ) ) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',terminates_all_defn) ).
fof(6,axiom,
push != pull,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',push_not_pull) ).
fof(7,axiom,
! [X3,X2] :
( ( holdsAt(X3,X2)
& ~ releasedAt(X3,plus(X2,n1))
& ~ ? [X1] :
( happens(X1,X2)
& terminates(X1,X3,X2) ) )
=> holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',keep_holding) ).
fof(10,axiom,
! [X1,X2] :
( happens(X1,X2)
<=> ( ( X1 = push
& X2 = n0 )
| ( X1 = pull
& X2 = n1 )
| ( X1 = pull
& X2 = n2 )
| ( X1 = push
& X2 = n2 ) ) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',happens_all_defn) ).
fof(11,axiom,
! [X1,X2,X3] :
( ( happens(X1,X2)
& initiates(X1,X3,X2) )
=> holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',happens_holds) ).
fof(12,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/tmpeCccO7/sel_CSR023+1.p_1',keep_not_holding) ).
fof(13,axiom,
forwards != spinning,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',forwards_not_spinning) ).
fof(15,axiom,
plus(n1,n2) = n3,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',plus1_2) ).
fof(16,axiom,
plus(n1,n1) = n2,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',plus1_1) ).
fof(17,axiom,
~ holdsAt(backwards,n0),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',not_backwards_0) ).
fof(21,axiom,
plus(n0,n1) = n1,
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',plus0_1) ).
fof(26,axiom,
! [X3,X2] : ~ releasedAt(X3,X2),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',not_releasedAt) ).
fof(27,axiom,
! [X4,X5] :
( less(X4,X5)
<=> ( ~ less(X5,X4)
& X5 != X4 ) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',less_property) ).
fof(28,conjecture,
holdsAt(spinning,n3),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',spinning_3) ).
fof(29,axiom,
! [X4,X5] : plus(X4,X5) = plus(X5,X4),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',symmetry_of_plus) ).
fof(30,axiom,
! [X4,X5] :
( less_or_equal(X4,X5)
<=> ( less(X4,X5)
| X4 = X5 ) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',less_or_equal) ).
fof(39,axiom,
! [X4] :
( less(X4,n1)
<=> less_or_equal(X4,n0) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',less1) ).
fof(40,axiom,
! [X4] :
( less(X4,n2)
<=> less_or_equal(X4,n1) ),
file('/tmp/tmpeCccO7/sel_CSR023+1.p_1',less2) ).
fof(42,negated_conjecture,
~ holdsAt(spinning,n3),
inference(assume_negation,[status(cth)],[28]) ).
fof(43,plain,
! [X1,X2,X3] :
( ( happens(X1,X2)
& terminates(X1,X3,X2) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(44,plain,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> ( ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(45,plain,
! [X1,X3,X2] :
( terminates(X1,X3,X2)
<=> ( ( X1 = push
& X3 = backwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = forwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = forwards
& happens(push,X2) )
| ( X1 = pull
& X3 = backwards
& happens(push,X2) )
| ( X1 = push
& X3 = spinning
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = spinning
& ~ happens(push,X2) ) ) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(46,plain,
! [X3,X2] :
( ( holdsAt(X3,X2)
& ~ releasedAt(X3,plus(X2,n1))
& ~ ? [X1] :
( happens(X1,X2)
& terminates(X1,X3,X2) ) )
=> holdsAt(X3,plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(48,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)],[12,theory(equality)]) ).
fof(49,plain,
~ holdsAt(backwards,n0),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(51,plain,
! [X3,X2] : ~ releasedAt(X3,X2),
inference(fof_simplification,[status(thm)],[26,theory(equality)]) ).
fof(52,plain,
! [X4,X5] :
( less(X4,X5)
<=> ( ~ less(X5,X4)
& X5 != X4 ) ),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(53,negated_conjecture,
~ holdsAt(spinning,n3),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(55,plain,
! [X1,X3,X2] :
( epred1_3(X2,X3,X1)
<=> ( ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) ) ),
introduced(definition) ).
fof(56,plain,
! [X1,X3,X2] :
( epred2_3(X2,X3,X1)
<=> ( ( X1 = push
& X3 = backwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = forwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = forwards
& happens(push,X2) ) ) ),
introduced(definition) ).
fof(57,plain,
! [X1,X3,X2] :
( epred3_3(X2,X3,X1)
<=> ( ( X1 = push
& X3 = backwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = forwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = forwards
& happens(push,X2) )
| ( X1 = pull
& X3 = backwards
& happens(push,X2) )
| ( X1 = push
& X3 = spinning
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = spinning
& ~ happens(push,X2) ) ) ),
introduced(definition) ).
fof(58,plain,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> epred1_3(X2,X3,X1) ),
inference(apply_def,[status(esa)],[44,55,theory(equality)]) ).
fof(59,plain,
! [X1,X3,X2] :
( terminates(X1,X3,X2)
<=> epred3_3(X2,X3,X1) ),
inference(apply_def,[status(esa)],[45,57,theory(equality)]) ).
fof(60,plain,
! [X1,X3,X2] :
( epred3_3(X2,X3,X1)
<=> ( epred2_3(X2,X3,X1)
| ( X1 = pull
& X3 = backwards
& happens(push,X2) )
| ( X1 = push
& X3 = spinning
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = spinning
& ~ happens(push,X2) ) ) ),
inference(apply_def,[status(esa)],[57,56,theory(equality)]) ).
fof(61,plain,
! [X1,X2,X3] :
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(62,plain,
! [X4,X5,X6] :
( ~ happens(X4,X5)
| ~ terminates(X4,X6,X5)
| ~ holdsAt(X6,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[61]) ).
cnf(63,plain,
( ~ holdsAt(X1,plus(X2,n1))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(64,plain,
! [X1,X3,X2] :
( ( ~ initiates(X1,X3,X2)
| epred1_3(X2,X3,X1) )
& ( ~ epred1_3(X2,X3,X1)
| initiates(X1,X3,X2) ) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(65,plain,
! [X4,X5,X6] :
( ( ~ initiates(X4,X5,X6)
| epred1_3(X6,X5,X4) )
& ( ~ epred1_3(X6,X5,X4)
| initiates(X4,X5,X6) ) ),
inference(variable_rename,[status(thm)],[64]) ).
cnf(66,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(67,plain,
( epred1_3(X1,X2,X3)
| ~ initiates(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(68,plain,
spinning != backwards,
inference(split_conjunct,[status(thm)],[3]) ).
cnf(69,plain,
forwards != backwards,
inference(split_conjunct,[status(thm)],[4]) ).
fof(70,plain,
! [X1,X3,X2] :
( ( ~ terminates(X1,X3,X2)
| epred3_3(X2,X3,X1) )
& ( ~ epred3_3(X2,X3,X1)
| terminates(X1,X3,X2) ) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(71,plain,
! [X4,X5,X6] :
( ( ~ terminates(X4,X5,X6)
| epred3_3(X6,X5,X4) )
& ( ~ epred3_3(X6,X5,X4)
| terminates(X4,X5,X6) ) ),
inference(variable_rename,[status(thm)],[70]) ).
cnf(72,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(73,plain,
( epred3_3(X1,X2,X3)
| ~ terminates(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(74,plain,
push != pull,
inference(split_conjunct,[status(thm)],[6]) ).
fof(75,plain,
! [X3,X2] :
( ~ holdsAt(X3,X2)
| releasedAt(X3,plus(X2,n1))
| ? [X1] :
( happens(X1,X2)
& terminates(X1,X3,X2) )
| holdsAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(76,plain,
! [X4,X5] :
( ~ holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ? [X6] :
( happens(X6,X5)
& terminates(X6,X4,X5) )
| holdsAt(X4,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,plain,
! [X4,X5] :
( ~ holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ( happens(esk1_2(X4,X5),X5)
& terminates(esk1_2(X4,X5),X4,X5) )
| holdsAt(X4,plus(X5,n1)) ),
inference(skolemize,[status(esa)],[76]) ).
fof(78,plain,
! [X4,X5] :
( ( happens(esk1_2(X4,X5),X5)
| ~ holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| holdsAt(X4,plus(X5,n1)) )
& ( terminates(esk1_2(X4,X5),X4,X5)
| ~ holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| holdsAt(X4,plus(X5,n1)) ) ),
inference(distribute,[status(thm)],[77]) ).
cnf(79,plain,
( holdsAt(X1,plus(X2,n1))
| releasedAt(X1,plus(X2,n1))
| terminates(esk1_2(X1,X2),X1,X2)
| ~ holdsAt(X1,X2) ),
inference(split_conjunct,[status(thm)],[78]) ).
cnf(80,plain,
( holdsAt(X1,plus(X2,n1))
| releasedAt(X1,plus(X2,n1))
| happens(esk1_2(X1,X2),X2)
| ~ holdsAt(X1,X2) ),
inference(split_conjunct,[status(thm)],[78]) ).
fof(92,plain,
! [X1,X2] :
( ( ~ happens(X1,X2)
| ( X1 = push
& X2 = n0 )
| ( X1 = pull
& X2 = n1 )
| ( X1 = pull
& X2 = n2 )
| ( X1 = push
& X2 = n2 ) )
& ( ( ( X1 != push
| X2 != n0 )
& ( X1 != pull
| X2 != n1 )
& ( X1 != pull
| X2 != n2 )
& ( X1 != push
| X2 != n2 ) )
| happens(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(93,plain,
! [X3,X4] :
( ( ~ happens(X3,X4)
| ( X3 = push
& X4 = n0 )
| ( X3 = pull
& X4 = n1 )
| ( X3 = pull
& X4 = n2 )
| ( X3 = push
& X4 = n2 ) )
& ( ( ( X3 != push
| X4 != n0 )
& ( X3 != pull
| X4 != n1 )
& ( X3 != pull
| X4 != n2 )
& ( X3 != push
| X4 != n2 ) )
| happens(X3,X4) ) ),
inference(variable_rename,[status(thm)],[92]) ).
fof(94,plain,
! [X3,X4] :
( ( X3 = push
| X3 = pull
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X3 = pull
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X3 = pull
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X4 = n1
| X3 = push
| ~ happens(X3,X4) )
& ( X3 = push
| X3 = pull
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X3 = pull
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = push
| X3 = pull
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X3 = pull
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 = push
| X4 = n2
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X4 = n2
| X4 = n2
| X4 = n1
| X4 = n0
| ~ happens(X3,X4) )
& ( X3 != push
| X4 != n0
| happens(X3,X4) )
& ( X3 != pull
| X4 != n1
| happens(X3,X4) )
& ( X3 != pull
| X4 != n2
| happens(X3,X4) )
& ( X3 != push
| X4 != n2
| happens(X3,X4) ) ),
inference(distribute,[status(thm)],[93]) ).
cnf(95,plain,
( happens(X1,X2)
| X2 != n2
| X1 != push ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(96,plain,
( happens(X1,X2)
| X2 != n2
| X1 != pull ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(97,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(98,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(107,plain,
( X1 = push
| X2 = n1
| X2 = n2
| X2 = n2
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(114,plain,
( X1 = push
| X1 = pull
| X1 = pull
| X1 = push
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(115,plain,
! [X1,X2,X3] :
( ~ happens(X1,X2)
| ~ initiates(X1,X3,X2)
| holdsAt(X3,plus(X2,n1)) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(116,plain,
! [X4,X5,X6] :
( ~ happens(X4,X5)
| ~ initiates(X4,X6,X5)
| holdsAt(X6,plus(X5,n1)) ),
inference(variable_rename,[status(thm)],[115]) ).
cnf(117,plain,
( holdsAt(X1,plus(X2,n1))
| ~ initiates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[116]) ).
fof(118,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)],[48]) ).
fof(119,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)],[118]) ).
fof(120,plain,
! [X4,X5] :
( holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ( happens(esk3_2(X4,X5),X5)
& initiates(esk3_2(X4,X5),X4,X5) )
| ~ holdsAt(X4,plus(X5,n1)) ),
inference(skolemize,[status(esa)],[119]) ).
fof(121,plain,
! [X4,X5] :
( ( happens(esk3_2(X4,X5),X5)
| holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ~ holdsAt(X4,plus(X5,n1)) )
& ( initiates(esk3_2(X4,X5),X4,X5)
| holdsAt(X4,X5)
| releasedAt(X4,plus(X5,n1))
| ~ holdsAt(X4,plus(X5,n1)) ) ),
inference(distribute,[status(thm)],[120]) ).
cnf(122,plain,
( releasedAt(X1,plus(X2,n1))
| holdsAt(X1,X2)
| initiates(esk3_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(123,plain,
( releasedAt(X1,plus(X2,n1))
| holdsAt(X1,X2)
| happens(esk3_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(124,plain,
forwards != spinning,
inference(split_conjunct,[status(thm)],[13]) ).
cnf(126,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[15]) ).
cnf(127,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[16]) ).
cnf(128,plain,
~ holdsAt(backwards,n0),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(132,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[21]) ).
fof(137,plain,
! [X4,X5] : ~ releasedAt(X4,X5),
inference(variable_rename,[status(thm)],[51]) ).
cnf(138,plain,
~ releasedAt(X1,X2),
inference(split_conjunct,[status(thm)],[137]) ).
fof(139,plain,
! [X4,X5] :
( ( ~ less(X4,X5)
| ( ~ less(X5,X4)
& X5 != X4 ) )
& ( less(X5,X4)
| X5 = X4
| less(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[52]) ).
fof(140,plain,
! [X6,X7] :
( ( ~ less(X6,X7)
| ( ~ less(X7,X6)
& X7 != X6 ) )
& ( less(X7,X6)
| X7 = X6
| less(X6,X7) ) ),
inference(variable_rename,[status(thm)],[139]) ).
fof(141,plain,
! [X6,X7] :
( ( ~ less(X7,X6)
| ~ less(X6,X7) )
& ( X7 != X6
| ~ less(X6,X7) )
& ( less(X7,X6)
| X7 = X6
| less(X6,X7) ) ),
inference(distribute,[status(thm)],[140]) ).
cnf(144,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[141]) ).
cnf(145,negated_conjecture,
~ holdsAt(spinning,n3),
inference(split_conjunct,[status(thm)],[53]) ).
fof(146,plain,
! [X6,X7] : plus(X6,X7) = plus(X7,X6),
inference(variable_rename,[status(thm)],[29]) ).
cnf(147,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[146]) ).
fof(148,plain,
! [X4,X5] :
( ( ~ less_or_equal(X4,X5)
| less(X4,X5)
| X4 = X5 )
& ( ( ~ less(X4,X5)
& X4 != X5 )
| less_or_equal(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(149,plain,
! [X6,X7] :
( ( ~ less_or_equal(X6,X7)
| less(X6,X7)
| X6 = X7 )
& ( ( ~ less(X6,X7)
& X6 != X7 )
| less_or_equal(X6,X7) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,plain,
! [X6,X7] :
( ( ~ less_or_equal(X6,X7)
| less(X6,X7)
| X6 = X7 )
& ( ~ less(X6,X7)
| less_or_equal(X6,X7) )
& ( X6 != X7
| less_or_equal(X6,X7) ) ),
inference(distribute,[status(thm)],[149]) ).
cnf(151,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[150]) ).
fof(182,plain,
! [X4] :
( ( ~ less(X4,n1)
| less_or_equal(X4,n0) )
& ( ~ less_or_equal(X4,n0)
| less(X4,n1) ) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(183,plain,
! [X5] :
( ( ~ less(X5,n1)
| less_or_equal(X5,n0) )
& ( ~ less_or_equal(X5,n0)
| less(X5,n1) ) ),
inference(variable_rename,[status(thm)],[182]) ).
cnf(184,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
inference(split_conjunct,[status(thm)],[183]) ).
fof(186,plain,
! [X4] :
( ( ~ less(X4,n2)
| less_or_equal(X4,n1) )
& ( ~ less_or_equal(X4,n1)
| less(X4,n2) ) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(187,plain,
! [X5] :
( ( ~ less(X5,n2)
| less_or_equal(X5,n1) )
& ( ~ less_or_equal(X5,n1)
| less(X5,n2) ) ),
inference(variable_rename,[status(thm)],[186]) ).
cnf(188,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[187]) ).
fof(194,plain,
! [X1,X3,X2] :
( ( ~ epred1_3(X2,X3,X1)
| ( X1 = push
& X3 = forwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = backwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = spinning
& happens(push,X2) ) )
& ( ( ( X1 != push
| X3 != forwards
| happens(pull,X2) )
& ( X1 != pull
| X3 != backwards
| happens(push,X2) )
& ( X1 != pull
| X3 != spinning
| ~ happens(push,X2) ) )
| epred1_3(X2,X3,X1) ) ),
inference(fof_nnf,[status(thm)],[55]) ).
fof(195,plain,
! [X4,X5,X6] :
( ( ~ epred1_3(X6,X5,X4)
| ( X4 = push
& X5 = forwards
& ~ happens(pull,X6) )
| ( X4 = pull
& X5 = backwards
& ~ happens(push,X6) )
| ( X4 = pull
& X5 = spinning
& happens(push,X6) ) )
& ( ( ( X4 != push
| X5 != forwards
| happens(pull,X6) )
& ( X4 != pull
| X5 != backwards
| happens(push,X6) )
& ( X4 != pull
| X5 != spinning
| ~ happens(push,X6) ) )
| epred1_3(X6,X5,X4) ) ),
inference(variable_rename,[status(thm)],[194]) ).
fof(196,plain,
! [X4,X5,X6] :
( ( X4 = pull
| X4 = pull
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = pull
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X5 = backwards
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = backwards
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = backwards
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(push,X6)
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| X4 = push
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X4 = pull
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = pull
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X5 = backwards
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = backwards
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = backwards
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(push,X6)
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| X5 = forwards
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X4 = pull
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = pull
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| X5 = backwards
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = backwards
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = backwards
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred1_3(X6,X5,X4) )
& ( X4 != push
| X5 != forwards
| happens(pull,X6)
| epred1_3(X6,X5,X4) )
& ( X4 != pull
| X5 != backwards
| happens(push,X6)
| epred1_3(X6,X5,X4) )
& ( X4 != pull
| X5 != spinning
| ~ happens(push,X6)
| epred1_3(X6,X5,X4) ) ),
inference(distribute,[status(thm)],[195]) ).
cnf(197,plain,
( epred1_3(X1,X2,X3)
| ~ happens(push,X1)
| X2 != spinning
| X3 != pull ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(198,plain,
( epred1_3(X1,X2,X3)
| happens(push,X1)
| X2 != backwards
| X3 != pull ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(199,plain,
( epred1_3(X1,X2,X3)
| happens(pull,X1)
| X2 != forwards
| X3 != push ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(208,plain,
( X3 = pull
| X3 = pull
| ~ epred1_3(X1,X2,X3)
| ~ happens(pull,X1) ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(217,plain,
( X2 = forwards
| X3 = pull
| X3 = pull
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(219,plain,
( X3 = push
| X2 = spinning
| ~ epred1_3(X1,X2,X3)
| ~ happens(push,X1) ),
inference(split_conjunct,[status(thm)],[196]) ).
fof(227,plain,
! [X1,X3,X2] :
( ( ~ epred2_3(X2,X3,X1)
| ( X1 = push
& X3 = backwards
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = forwards
& ~ happens(push,X2) )
| ( X1 = pull
& X3 = forwards
& happens(push,X2) ) )
& ( ( ( X1 != push
| X3 != backwards
| happens(pull,X2) )
& ( X1 != pull
| X3 != forwards
| happens(push,X2) )
& ( X1 != pull
| X3 != forwards
| ~ happens(push,X2) ) )
| epred2_3(X2,X3,X1) ) ),
inference(fof_nnf,[status(thm)],[56]) ).
fof(228,plain,
! [X4,X5,X6] :
( ( ~ epred2_3(X6,X5,X4)
| ( X4 = push
& X5 = backwards
& ~ happens(pull,X6) )
| ( X4 = pull
& X5 = forwards
& ~ happens(push,X6) )
| ( X4 = pull
& X5 = forwards
& happens(push,X6) ) )
& ( ( ( X4 != push
| X5 != backwards
| happens(pull,X6) )
& ( X4 != pull
| X5 != forwards
| happens(push,X6) )
& ( X4 != pull
| X5 != forwards
| ~ happens(push,X6) ) )
| epred2_3(X6,X5,X4) ) ),
inference(variable_rename,[status(thm)],[227]) ).
fof(229,plain,
! [X4,X5,X6] :
( ( X4 = pull
| X4 = pull
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| X4 = pull
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| X5 = forwards
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| X5 = forwards
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = forwards
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| ~ happens(push,X6)
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| X4 = push
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| X4 = pull
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| X4 = pull
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| X5 = forwards
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| X5 = forwards
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = forwards
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| ~ happens(push,X6)
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| X5 = backwards
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| X4 = pull
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| X4 = pull
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| X4 = pull
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| X5 = forwards
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| X5 = forwards
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| X5 = forwards
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( X5 = forwards
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( happens(push,X6)
| ~ happens(push,X6)
| ~ happens(pull,X6)
| ~ epred2_3(X6,X5,X4) )
& ( X4 != push
| X5 != backwards
| happens(pull,X6)
| epred2_3(X6,X5,X4) )
& ( X4 != pull
| X5 != forwards
| happens(push,X6)
| epred2_3(X6,X5,X4) )
& ( X4 != pull
| X5 != forwards
| ~ happens(push,X6)
| epred2_3(X6,X5,X4) ) ),
inference(distribute,[status(thm)],[228]) ).
cnf(230,plain,
( epred2_3(X1,X2,X3)
| ~ happens(push,X1)
| X2 != forwards
| X3 != pull ),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(231,plain,
( epred2_3(X1,X2,X3)
| happens(push,X1)
| X2 != forwards
| X3 != pull ),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(241,plain,
( X3 = pull
| X3 = pull
| ~ epred2_3(X1,X2,X3)
| ~ happens(pull,X1) ),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(255,plain,
( X3 = push
| X2 = forwards
| X2 = forwards
| ~ epred2_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[229]) ).
cnf(259,plain,
( X3 = push
| X3 = pull
| X3 = pull
| ~ epred2_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[229]) ).
fof(260,plain,
! [X1,X3,X2] :
( ( ~ epred3_3(X2,X3,X1)
| epred2_3(X2,X3,X1)
| ( X1 = pull
& X3 = backwards
& happens(push,X2) )
| ( X1 = push
& X3 = spinning
& ~ happens(pull,X2) )
| ( X1 = pull
& X3 = spinning
& ~ happens(push,X2) ) )
& ( ( ~ epred2_3(X2,X3,X1)
& ( X1 != pull
| X3 != backwards
| ~ happens(push,X2) )
& ( X1 != push
| X3 != spinning
| happens(pull,X2) )
& ( X1 != pull
| X3 != spinning
| happens(push,X2) ) )
| epred3_3(X2,X3,X1) ) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(261,plain,
! [X4,X5,X6] :
( ( ~ epred3_3(X6,X5,X4)
| epred2_3(X6,X5,X4)
| ( X4 = pull
& X5 = backwards
& happens(push,X6) )
| ( X4 = push
& X5 = spinning
& ~ happens(pull,X6) )
| ( X4 = pull
& X5 = spinning
& ~ happens(push,X6) ) )
& ( ( ~ epred2_3(X6,X5,X4)
& ( X4 != pull
| X5 != backwards
| ~ happens(push,X6) )
& ( X4 != push
| X5 != spinning
| happens(pull,X6) )
& ( X4 != pull
| X5 != spinning
| happens(push,X6) ) )
| epred3_3(X6,X5,X4) ) ),
inference(variable_rename,[status(thm)],[260]) ).
fof(262,plain,
! [X4,X5,X6] :
( ( X4 = pull
| X4 = push
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = push
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| X4 = push
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| X5 = spinning
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = spinning
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| X5 = spinning
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(pull,X6)
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(pull,X6)
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| ~ happens(pull,X6)
| X4 = pull
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| X4 = push
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = push
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| X4 = push
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| X5 = spinning
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = spinning
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| X5 = spinning
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(pull,X6)
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(pull,X6)
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| ~ happens(pull,X6)
| X5 = backwards
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| X4 = push
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| X4 = push
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| X4 = push
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| X5 = spinning
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| X5 = spinning
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| X5 = spinning
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X4 = pull
| ~ happens(pull,X6)
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( X5 = spinning
| ~ happens(pull,X6)
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ happens(push,X6)
| ~ happens(pull,X6)
| happens(push,X6)
| epred2_3(X6,X5,X4)
| ~ epred3_3(X6,X5,X4) )
& ( ~ epred2_3(X6,X5,X4)
| epred3_3(X6,X5,X4) )
& ( X4 != pull
| X5 != backwards
| ~ happens(push,X6)
| epred3_3(X6,X5,X4) )
& ( X4 != push
| X5 != spinning
| happens(pull,X6)
| epred3_3(X6,X5,X4) )
& ( X4 != pull
| X5 != spinning
| happens(push,X6)
| epred3_3(X6,X5,X4) ) ),
inference(distribute,[status(thm)],[261]) ).
cnf(265,plain,
( epred3_3(X1,X2,X3)
| ~ happens(push,X1)
| X2 != backwards
| X3 != pull ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(266,plain,
( epred3_3(X1,X2,X3)
| ~ epred2_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(282,plain,
( epred2_3(X1,X2,X3)
| X2 = backwards
| X3 = push
| ~ epred3_3(X1,X2,X3)
| ~ happens(push,X1) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(287,plain,
( epred2_3(X1,X2,X3)
| X3 = pull
| X3 = pull
| ~ epred3_3(X1,X2,X3)
| ~ happens(pull,X1) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(293,plain,
( epred2_3(X1,X2,X3)
| X3 = pull
| X3 = push
| X3 = pull
| ~ epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(294,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[151,theory(equality)]) ).
cnf(306,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[132,147,theory(equality)]) ).
cnf(384,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| ~ epred1_3(X2,X1,X3) ),
inference(spm,[status(thm)],[117,66,theory(equality)]) ).
cnf(396,plain,
( ~ holdsAt(X1,n2)
| ~ terminates(X2,X1,n1)
| ~ happens(X2,n1) ),
inference(spm,[status(thm)],[63,127,theory(equality)]) ).
cnf(397,plain,
( ~ holdsAt(X1,plus(n1,X2))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[63,147,theory(equality)]) ).
cnf(433,plain,
( epred2_3(X1,X2,X3)
| forwards != X2
| pull != X3 ),
inference(csr,[status(thm)],[230,231]) ).
cnf(464,plain,
( push = X3
| pull = X3
| ~ epred3_3(X1,X2,X3) ),
inference(csr,[status(thm)],[293,259]) ).
cnf(495,plain,
( pull = X3
| ~ epred3_3(X1,X2,X3)
| ~ happens(pull,X1) ),
inference(csr,[status(thm)],[287,241]) ).
cnf(502,plain,
( happens(esk1_2(X1,X2),X2)
| holdsAt(X1,plus(X2,n1))
| ~ holdsAt(X1,X2) ),
inference(sr,[status(thm)],[80,138,theory(equality)]) ).
cnf(515,plain,
( holdsAt(X1,X2)
| happens(esk3_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[123,138,theory(equality)]) ).
cnf(516,plain,
( holdsAt(X1,n1)
| happens(esk3_2(X1,n1),n1)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[515,127,theory(equality)]) ).
cnf(517,plain,
( holdsAt(X1,X2)
| happens(esk3_2(X1,X2),X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[515,147,theory(equality)]) ).
cnf(530,plain,
( holdsAt(X1,plus(X2,n1))
| terminates(esk1_2(X1,X2),X1,X2)
| ~ holdsAt(X1,X2) ),
inference(sr,[status(thm)],[79,138,theory(equality)]) ).
cnf(531,plain,
( epred3_3(X1,X2,esk1_2(X2,X1))
| holdsAt(X2,plus(X1,n1))
| ~ holdsAt(X2,X1) ),
inference(spm,[status(thm)],[73,530,theory(equality)]) ).
cnf(532,plain,
( holdsAt(X1,X2)
| initiates(esk3_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[122,138,theory(equality)]) ).
cnf(533,plain,
( epred1_3(X1,X2,esk3_2(X2,X1))
| holdsAt(X2,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(spm,[status(thm)],[67,532,theory(equality)]) ).
cnf(543,plain,
less(n0,n1),
inference(spm,[status(thm)],[184,294,theory(equality)]) ).
cnf(544,plain,
less(n1,n2),
inference(spm,[status(thm)],[188,294,theory(equality)]) ).
cnf(570,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[144,544,theory(equality)]) ).
cnf(877,plain,
( holdsAt(X1,plus(X2,n1))
| ~ happens(X3,X2)
| pull != X3
| spinning != X1
| ~ happens(push,X2) ),
inference(spm,[status(thm)],[384,197,theory(equality)]) ).
cnf(878,plain,
( holdsAt(X1,plus(X2,n1))
| happens(push,X2)
| ~ happens(X3,X2)
| pull != X3
| backwards != X1 ),
inference(spm,[status(thm)],[384,198,theory(equality)]) ).
cnf(879,plain,
( holdsAt(X1,plus(X2,n1))
| happens(pull,X2)
| ~ happens(X3,X2)
| push != X3
| forwards != X1 ),
inference(spm,[status(thm)],[384,199,theory(equality)]) ).
cnf(891,plain,
( ~ holdsAt(X1,n2)
| ~ happens(X2,n1)
| ~ epred3_3(n1,X1,X2) ),
inference(spm,[status(thm)],[396,72,theory(equality)]) ).
cnf(903,plain,
( ~ holdsAt(X1,n3)
| ~ terminates(X2,X1,n2)
| ~ happens(X2,n2) ),
inference(spm,[status(thm)],[397,126,theory(equality)]) ).
cnf(978,plain,
( pull = esk3_2(X1,n1)
| push = esk3_2(X1,n1)
| holdsAt(X1,n1)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[114,516,theory(equality)]) ).
cnf(987,plain,
( holdsAt(X1,n0)
| happens(esk3_2(X1,n0),n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[517,306,theory(equality)]) ).
cnf(992,plain,
( pull = esk1_2(X1,X2)
| push = esk1_2(X1,X2)
| holdsAt(X1,plus(X2,n1))
| ~ holdsAt(X1,X2) ),
inference(spm,[status(thm)],[464,531,theory(equality)]) ).
cnf(995,plain,
( pull = esk1_2(X1,X2)
| holdsAt(X1,plus(X2,n1))
| ~ happens(pull,X2)
| ~ holdsAt(X1,X2) ),
inference(spm,[status(thm)],[495,531,theory(equality)]) ).
cnf(1003,plain,
( pull = esk3_2(X1,X2)
| forwards = X1
| holdsAt(X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[217,533,theory(equality)]) ).
cnf(1006,plain,
( pull = esk3_2(X1,X2)
| holdsAt(X1,X2)
| ~ happens(pull,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[208,533,theory(equality)]) ).
cnf(1464,plain,
( holdsAt(X1,plus(X2,n1))
| pull != X3
| spinning != X1
| ~ happens(push,X2)
| n1 != X2 ),
inference(spm,[status(thm)],[877,97,theory(equality)]) ).
cnf(1467,plain,
( holdsAt(X1,plus(X2,n1))
| pull != X3
| spinning != X1
| ~ happens(push,X2)
| n2 != X2 ),
inference(spm,[status(thm)],[877,96,theory(equality)]) ).
cnf(1485,plain,
( holdsAt(X1,plus(X2,n1))
| happens(push,X2)
| pull != X3
| backwards != X1
| n1 != X2 ),
inference(spm,[status(thm)],[878,97,theory(equality)]) ).
cnf(1529,plain,
( ~ holdsAt(X1,n3)
| ~ happens(X2,n2)
| ~ epred3_3(n2,X1,X2) ),
inference(spm,[status(thm)],[903,72,theory(equality)]) ).
cnf(1590,plain,
( ~ holdsAt(X1,n2)
| ~ happens(X2,n1)
| ~ epred2_3(n1,X1,X2) ),
inference(spm,[status(thm)],[891,266,theory(equality)]) ).
cnf(1685,plain,
( holdsAt(X1,n1)
| happens(push,n1)
| esk3_2(X1,n1) = pull
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[516,978,theory(equality)]) ).
cnf(1699,plain,
( ~ holdsAt(X1,n3)
| ~ happens(X2,n2)
| ~ epred2_3(n2,X1,X2) ),
inference(spm,[status(thm)],[1529,266,theory(equality)]) ).
cnf(1702,plain,
( ~ holdsAt(X1,n3)
| ~ happens(X2,n2)
| pull != X2
| backwards != X1
| ~ happens(push,n2) ),
inference(spm,[status(thm)],[1529,265,theory(equality)]) ).
cnf(1734,plain,
( ~ holdsAt(X1,n2)
| ~ happens(X2,n1)
| forwards != X1
| pull != X2 ),
inference(spm,[status(thm)],[1590,433,theory(equality)]) ).
cnf(1743,plain,
( ~ holdsAt(X1,n3)
| ~ happens(X2,n2)
| forwards != X1
| pull != X2 ),
inference(spm,[status(thm)],[1699,433,theory(equality)]) ).
fof(1744,plain,
( ~ epred6_0
<=> ! [X1] :
( ~ holdsAt(X1,n3)
| forwards != X1 ) ),
introduced(definition),
[split] ).
cnf(1745,plain,
( epred6_0
| ~ holdsAt(X1,n3)
| forwards != X1 ),
inference(split_equiv,[status(thm)],[1744]) ).
fof(1746,plain,
( ~ epred7_0
<=> ! [X2] :
( ~ happens(X2,n2)
| pull != X2 ) ),
introduced(definition),
[split] ).
cnf(1747,plain,
( epred7_0
| ~ happens(X2,n2)
| pull != X2 ),
inference(split_equiv,[status(thm)],[1746]) ).
cnf(1748,plain,
( ~ epred7_0
| ~ epred6_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[1743,1744,theory(equality)]),1746,theory(equality)]),
[split] ).
cnf(1752,plain,
( epred7_0
| pull != X1 ),
inference(spm,[status(thm)],[1747,96,theory(equality)]) ).
cnf(1754,plain,
epred7_0,
inference(er,[status(thm)],[1752,theory(equality)]) ).
cnf(1756,plain,
( $false
| ~ epred6_0 ),
inference(rw,[status(thm)],[1748,1754,theory(equality)]) ).
cnf(1757,plain,
~ epred6_0,
inference(cn,[status(thm)],[1756,theory(equality)]) ).
cnf(1779,plain,
( n2 = n0
| push = esk3_2(X1,n0)
| n1 = n0
| holdsAt(X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[107,987,theory(equality)]) ).
fof(1808,plain,
( ~ epred8_0
<=> ! [X1] :
( ~ holdsAt(X1,n2)
| forwards != X1 ) ),
introduced(definition),
[split] ).
cnf(1809,plain,
( epred8_0
| ~ holdsAt(X1,n2)
| forwards != X1 ),
inference(split_equiv,[status(thm)],[1808]) ).
fof(1810,plain,
( ~ epred9_0
<=> ! [X2] :
( ~ happens(X2,n1)
| pull != X2 ) ),
introduced(definition),
[split] ).
cnf(1811,plain,
( epred9_0
| ~ happens(X2,n1)
| pull != X2 ),
inference(split_equiv,[status(thm)],[1810]) ).
cnf(1812,plain,
( ~ epred9_0
| ~ epred8_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[1734,1808,theory(equality)]),1810,theory(equality)]),
[split] ).
cnf(1813,plain,
( epred9_0
| pull != X1 ),
inference(spm,[status(thm)],[1811,97,theory(equality)]) ).
cnf(1818,plain,
epred9_0,
inference(er,[status(thm)],[1813,theory(equality)]) ).
cnf(1820,plain,
( $false
| ~ epred8_0 ),
inference(rw,[status(thm)],[1812,1818,theory(equality)]) ).
cnf(1821,plain,
~ epred8_0,
inference(cn,[status(thm)],[1820,theory(equality)]) ).
cnf(1955,plain,
( esk1_2(X1,X2) = push
| esk1_2(X1,X2) = pull
| holdsAt(X1,plus(n1,X2))
| ~ holdsAt(X1,X2) ),
inference(spm,[status(thm)],[992,147,theory(equality)]) ).
cnf(2060,plain,
( esk1_2(X1,X2) = pull
| holdsAt(X1,plus(n1,X2))
| ~ holdsAt(X1,X2)
| ~ happens(pull,X2) ),
inference(spm,[status(thm)],[995,147,theory(equality)]) ).
cnf(2165,plain,
( esk3_2(X1,X2) = pull
| forwards = X1
| holdsAt(X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[1003,147,theory(equality)]) ).
cnf(2215,plain,
( esk3_2(X1,n1) = pull
| holdsAt(X1,n1)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n1) ),
inference(spm,[status(thm)],[1006,127,theory(equality)]) ).
cnf(2953,plain,
( holdsAt(X1,plus(X2,n1))
| spinning != X1
| n1 != X2
| ~ happens(push,X2) ),
inference(er,[status(thm)],[1464,theory(equality)]) ).
cnf(3019,plain,
( holdsAt(X1,plus(X2,n1))
| spinning != X1
| n2 != X2
| ~ happens(push,X2) ),
inference(er,[status(thm)],[1467,theory(equality)]) ).
cnf(3025,plain,
( esk3_2(X1,n0) = pull
| forwards = X1
| holdsAt(X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[2165,306,theory(equality)]) ).
cnf(3074,plain,
( holdsAt(X1,plus(X2,n1))
| happens(push,X2)
| backwards != X1
| n1 != X2 ),
inference(er,[status(thm)],[1485,theory(equality)]) ).
cnf(3159,plain,
( epred1_3(n0,X1,pull)
| holdsAt(X1,n0)
| forwards = X1
| ~ holdsAt(X1,plus(n0,n1))
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[533,3025,theory(equality)]) ).
cnf(3164,plain,
( epred1_3(n0,X1,pull)
| holdsAt(X1,n0)
| forwards = X1
| ~ holdsAt(X1,n1)
| ~ holdsAt(X1,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[3159,147,theory(equality)]),306,theory(equality)]) ).
cnf(3165,plain,
( epred1_3(n0,X1,pull)
| holdsAt(X1,n0)
| forwards = X1
| ~ holdsAt(X1,n1) ),
inference(cn,[status(thm)],[3164,theory(equality)]) ).
cnf(3215,plain,
( forwards = backwards
| epred1_3(n0,backwards,pull)
| ~ holdsAt(backwards,n1) ),
inference(spm,[status(thm)],[128,3165,theory(equality)]) ).
cnf(3219,plain,
( epred1_3(n0,backwards,pull)
| ~ holdsAt(backwards,n1) ),
inference(sr,[status(thm)],[3215,69,theory(equality)]) ).
cnf(3616,plain,
( holdsAt(X1,n1)
| happens(pull,n1)
| happens(push,n1)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[516,1685,theory(equality)]) ).
fof(3871,plain,
( ~ epred16_0
<=> ! [X2] :
( ~ happens(X2,n2)
| ~ happens(push,n2)
| pull != X2 ) ),
introduced(definition),
[split] ).
cnf(3872,plain,
( epred16_0
| ~ happens(X2,n2)
| ~ happens(push,n2)
| pull != X2 ),
inference(split_equiv,[status(thm)],[3871]) ).
fof(3873,plain,
( ~ epred17_0
<=> ! [X1] :
( ~ holdsAt(X1,n3)
| backwards != X1 ) ),
introduced(definition),
[split] ).
cnf(3874,plain,
( epred17_0
| ~ holdsAt(X1,n3)
| backwards != X1 ),
inference(split_equiv,[status(thm)],[3873]) ).
cnf(3875,plain,
( ~ epred17_0
| ~ epred16_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[1702,3871,theory(equality)]),3873,theory(equality)]),
[split] ).
cnf(3896,plain,
( epred16_0
| pull != X1
| ~ happens(X1,n2) ),
inference(spm,[status(thm)],[3872,95,theory(equality)]) ).
cnf(3904,plain,
( epred16_0
| pull != X1 ),
inference(spm,[status(thm)],[3896,96,theory(equality)]) ).
cnf(3906,plain,
epred16_0,
inference(er,[status(thm)],[3904,theory(equality)]) ).
cnf(3908,plain,
( ~ epred17_0
| $false ),
inference(rw,[status(thm)],[3875,3906,theory(equality)]) ).
cnf(3909,plain,
~ epred17_0,
inference(cn,[status(thm)],[3908,theory(equality)]) ).
cnf(4115,plain,
( epred1_3(n1,X1,pull)
| holdsAt(X1,n1)
| ~ holdsAt(X1,plus(n1,n1))
| ~ holdsAt(X1,n2)
| ~ happens(pull,n1) ),
inference(spm,[status(thm)],[533,2215,theory(equality)]) ).
cnf(4122,plain,
( epred1_3(n1,X1,pull)
| holdsAt(X1,n1)
| ~ holdsAt(X1,n2)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n1) ),
inference(rw,[status(thm)],[4115,127,theory(equality)]) ).
cnf(4123,plain,
( epred1_3(n1,X1,pull)
| holdsAt(X1,n1)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n1) ),
inference(cn,[status(thm)],[4122,theory(equality)]) ).
cnf(4133,plain,
( holdsAt(X1,n2)
| spinning != X1
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[2953,127,theory(equality)]) ).
cnf(4218,plain,
( push = pull
| forwards = X1
| holdsAt(X1,n0)
| n0 = n1
| n0 = n2
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[3025,1779,theory(equality)]) ).
cnf(4223,plain,
( forwards = X1
| holdsAt(X1,n0)
| n0 = n1
| n0 = n2
| ~ holdsAt(X1,n1) ),
inference(sr,[status(thm)],[4218,74,theory(equality)]) ).
cnf(4233,plain,
( n0 = n2
| n0 = n1
| forwards = backwards
| ~ holdsAt(backwards,n1) ),
inference(spm,[status(thm)],[128,4223,theory(equality)]) ).
cnf(4237,plain,
( n0 = n2
| n0 = n1
| ~ holdsAt(backwards,n1) ),
inference(sr,[status(thm)],[4233,69,theory(equality)]) ).
cnf(4341,plain,
( ~ terminates(X3,X1,X2)
| ~ happens(X3,X2)
| spinning != X1
| n2 != X2
| ~ happens(push,X2) ),
inference(spm,[status(thm)],[63,3019,theory(equality)]) ).
cnf(4367,plain,
( holdsAt(X1,n2)
| happens(push,n1)
| backwards != X1 ),
inference(spm,[status(thm)],[3074,127,theory(equality)]) ).
cnf(4442,plain,
( holdsAt(X1,n1)
| happens(push,n1)
| happens(pull,n1)
| backwards != X1 ),
inference(spm,[status(thm)],[3616,4367,theory(equality)]) ).
cnf(4603,plain,
( epred1_3(n0,backwards,pull)
| happens(pull,n1)
| happens(push,n1) ),
inference(spm,[status(thm)],[3219,4442,theory(equality)]) ).
cnf(4902,plain,
( spinning = backwards
| push = pull
| happens(push,n1)
| happens(pull,n1)
| ~ happens(push,n0) ),
inference(spm,[status(thm)],[219,4603,theory(equality)]) ).
cnf(4906,plain,
( push = pull
| happens(push,n1)
| happens(pull,n1)
| ~ happens(push,n0) ),
inference(sr,[status(thm)],[4902,68,theory(equality)]) ).
cnf(4907,plain,
( happens(push,n1)
| happens(pull,n1)
| ~ happens(push,n0) ),
inference(sr,[status(thm)],[4906,74,theory(equality)]) ).
cnf(4921,plain,
( happens(pull,n1)
| happens(push,n1) ),
inference(spm,[status(thm)],[4907,98,theory(equality)]) ).
cnf(4929,plain,
( holdsAt(X1,plus(n1,n1))
| happens(pull,n1)
| forwards != X1 ),
inference(spm,[status(thm)],[879,4921,theory(equality)]) ).
cnf(4935,plain,
( holdsAt(X1,n2)
| happens(pull,n1)
| forwards != X1 ),
inference(rw,[status(thm)],[4929,127,theory(equality)]) ).
cnf(4944,plain,
( epred8_0
| happens(pull,n1)
| forwards != X1 ),
inference(spm,[status(thm)],[1809,4935,theory(equality)]) ).
cnf(4962,plain,
( happens(pull,n1)
| forwards != X1 ),
inference(sr,[status(thm)],[4944,1821,theory(equality)]) ).
cnf(4963,plain,
happens(pull,n1),
inference(er,[status(thm)],[4962,theory(equality)]) ).
cnf(4979,plain,
( epred1_3(n1,X1,pull)
| holdsAt(X1,n1)
| ~ holdsAt(X1,n2)
| $false ),
inference(rw,[status(thm)],[4123,4963,theory(equality)]) ).
cnf(4980,plain,
( epred1_3(n1,X1,pull)
| holdsAt(X1,n1)
| ~ holdsAt(X1,n2) ),
inference(cn,[status(thm)],[4979,theory(equality)]) ).
cnf(5016,plain,
( epred1_3(n1,X1,pull)
| holdsAt(X1,n1)
| happens(push,n1)
| backwards != X1 ),
inference(spm,[status(thm)],[4980,4367,theory(equality)]) ).
cnf(5143,plain,
( n0 = n1
| n0 = n2
| epred1_3(n1,backwards,pull)
| happens(push,n1) ),
inference(spm,[status(thm)],[4237,5016,theory(equality)]) ).
cnf(5211,plain,
( holdsAt(backwards,plus(n1,n1))
| n0 = n2
| n0 = n1
| happens(push,n1)
| ~ happens(pull,n1) ),
inference(spm,[status(thm)],[384,5143,theory(equality)]) ).
cnf(5214,plain,
( holdsAt(backwards,n2)
| n0 = n2
| n0 = n1
| happens(push,n1)
| ~ happens(pull,n1) ),
inference(rw,[status(thm)],[5211,127,theory(equality)]) ).
cnf(5215,plain,
( holdsAt(backwards,n2)
| n0 = n2
| n0 = n1
| happens(push,n1)
| $false ),
inference(rw,[status(thm)],[5214,4963,theory(equality)]) ).
cnf(5216,plain,
( holdsAt(backwards,n2)
| n0 = n2
| n0 = n1
| happens(push,n1) ),
inference(cn,[status(thm)],[5215,theory(equality)]) ).
cnf(5379,plain,
( spinning != X1
| n2 != X2
| ~ happens(push,X2)
| ~ happens(X3,X2)
| ~ epred3_3(X2,X1,X3) ),
inference(spm,[status(thm)],[4341,72,theory(equality)]) ).
cnf(5401,plain,
( esk1_2(X1,n2) = pull
| esk1_2(X1,n2) = push
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[1955,126,theory(equality)]) ).
cnf(5636,plain,
( epred3_3(n2,X1,push)
| holdsAt(X1,plus(n2,n1))
| esk1_2(X1,n2) = pull
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[531,5401,theory(equality)]) ).
cnf(5647,plain,
( epred3_3(n2,X1,push)
| holdsAt(X1,n3)
| esk1_2(X1,n2) = pull
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[5636,147,theory(equality)]),126,theory(equality)]) ).
cnf(5648,plain,
( epred3_3(n2,X1,push)
| holdsAt(X1,n3)
| esk1_2(X1,n2) = pull
| ~ holdsAt(X1,n2) ),
inference(cn,[status(thm)],[5647,theory(equality)]) ).
cnf(6276,plain,
( esk1_2(X1,n2) = pull
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n2) ),
inference(spm,[status(thm)],[2060,126,theory(equality)]) ).
cnf(6415,plain,
( epred3_3(n2,X1,pull)
| holdsAt(X1,plus(n2,n1))
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n2) ),
inference(spm,[status(thm)],[531,6276,theory(equality)]) ).
cnf(6428,plain,
( epred3_3(n2,X1,pull)
| holdsAt(X1,n3)
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[6415,147,theory(equality)]),126,theory(equality)]) ).
cnf(6429,plain,
( epred3_3(n2,X1,pull)
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2)
| ~ happens(pull,n2) ),
inference(cn,[status(thm)],[6428,theory(equality)]) ).
cnf(6439,plain,
( epred3_3(n2,spinning,pull)
| ~ holdsAt(spinning,n2)
| ~ happens(pull,n2) ),
inference(spm,[status(thm)],[145,6429,theory(equality)]) ).
cnf(6468,plain,
( epred3_3(n2,spinning,pull)
| ~ happens(pull,n2)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[6439,4133,theory(equality)]) ).
cnf(6497,plain,
( ~ happens(push,n2)
| ~ happens(pull,n2)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[5379,6468,theory(equality)]) ).
cnf(6539,plain,
( ~ happens(pull,n2)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[6497,95,theory(equality)]) ).
cnf(6558,plain,
( ~ happens(pull,n2)
| n0 != n1 ),
inference(spm,[status(thm)],[6539,98,theory(equality)]) ).
cnf(6564,plain,
n0 != n1,
inference(spm,[status(thm)],[6558,96,theory(equality)]) ).
cnf(6566,plain,
( n0 = n2
| holdsAt(backwards,n2)
| happens(push,n1) ),
inference(sr,[status(thm)],[5216,6564,theory(equality)]) ).
cnf(6567,plain,
( holdsAt(backwards,plus(n2,n1))
| happens(esk1_2(backwards,n2),n2)
| n0 = n2
| happens(push,n1) ),
inference(spm,[status(thm)],[502,6566,theory(equality)]) ).
cnf(6574,plain,
( holdsAt(backwards,n3)
| happens(esk1_2(backwards,n2),n2)
| n0 = n2
| happens(push,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[6567,147,theory(equality)]),126,theory(equality)]) ).
cnf(7236,plain,
( epred3_3(n2,X1,pull)
| holdsAt(X1,plus(n2,n1))
| epred3_3(n2,X1,push)
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2) ),
inference(spm,[status(thm)],[531,5648,theory(equality)]) ).
cnf(7251,plain,
( epred3_3(n2,X1,pull)
| holdsAt(X1,n3)
| epred3_3(n2,X1,push)
| holdsAt(X1,n3)
| ~ holdsAt(X1,n2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[7236,147,theory(equality)]),126,theory(equality)]) ).
cnf(7252,plain,
( epred3_3(n2,X1,pull)
| holdsAt(X1,n3)
| epred3_3(n2,X1,push)
| ~ holdsAt(X1,n2) ),
inference(cn,[status(thm)],[7251,theory(equality)]) ).
cnf(7267,plain,
( epred3_3(n2,spinning,push)
| epred3_3(n2,spinning,pull)
| ~ holdsAt(spinning,n2) ),
inference(spm,[status(thm)],[145,7252,theory(equality)]) ).
cnf(7301,plain,
( epred3_3(n2,spinning,pull)
| epred3_3(n2,spinning,push)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[7267,4133,theory(equality)]) ).
cnf(7321,plain,
( epred3_3(n2,spinning,pull)
| ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[5379,7301,theory(equality)]) ).
cnf(7492,plain,
( backwards = spinning
| push = pull
| epred2_3(n2,spinning,pull)
| ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[282,7321,theory(equality)]) ).
cnf(7497,plain,
( push = pull
| epred2_3(n2,spinning,pull)
| ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(sr,[status(thm)],[7492,68,theory(equality)]) ).
cnf(7498,plain,
( epred2_3(n2,spinning,pull)
| ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(sr,[status(thm)],[7497,74,theory(equality)]) ).
cnf(7517,plain,
( forwards = spinning
| push = pull
| ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(spm,[status(thm)],[255,7498,theory(equality)]) ).
cnf(7523,plain,
( push = pull
| ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(sr,[status(thm)],[7517,124,theory(equality)]) ).
cnf(7524,plain,
( ~ happens(push,n2)
| ~ happens(push,n1) ),
inference(sr,[status(thm)],[7523,74,theory(equality)]) ).
cnf(7544,plain,
~ happens(push,n1),
inference(spm,[status(thm)],[7524,95,theory(equality)]) ).
cnf(7563,plain,
( n0 = n2
| holdsAt(backwards,n3)
| happens(esk1_2(backwards,n2),n2) ),
inference(sr,[status(thm)],[6574,7544,theory(equality)]) ).
cnf(7712,plain,
( pull = esk1_2(backwards,n2)
| push = esk1_2(backwards,n2)
| n0 = n2
| holdsAt(backwards,n3) ),
inference(spm,[status(thm)],[114,7563,theory(equality)]) ).
cnf(8005,plain,
( n0 = n2
| holdsAt(backwards,n3)
| happens(push,n2)
| esk1_2(backwards,n2) = pull ),
inference(spm,[status(thm)],[7563,7712,theory(equality)]) ).
cnf(8246,plain,
( n0 = n2
| holdsAt(backwards,n3)
| happens(pull,n2)
| happens(push,n2) ),
inference(spm,[status(thm)],[7563,8005,theory(equality)]) ).
cnf(8347,plain,
( epred17_0
| n0 = n2
| happens(push,n2)
| happens(pull,n2) ),
inference(spm,[status(thm)],[3874,8246,theory(equality)]) ).
cnf(8373,plain,
( n0 = n2
| happens(push,n2)
| happens(pull,n2) ),
inference(sr,[status(thm)],[8347,3909,theory(equality)]) ).
cnf(8376,plain,
( holdsAt(X1,plus(n2,n1))
| happens(pull,n2)
| n0 = n2
| forwards != X1 ),
inference(spm,[status(thm)],[879,8373,theory(equality)]) ).
cnf(8380,plain,
( holdsAt(X1,n3)
| happens(pull,n2)
| n0 = n2
| forwards != X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[8376,147,theory(equality)]),126,theory(equality)]) ).
cnf(8384,plain,
( epred6_0
| n0 = n2
| happens(pull,n2)
| forwards != X1 ),
inference(spm,[status(thm)],[1745,8380,theory(equality)]) ).
cnf(8421,plain,
( n0 = n2
| happens(pull,n2)
| forwards != X1 ),
inference(sr,[status(thm)],[8384,1757,theory(equality)]) ).
cnf(8423,plain,
( n0 = n2
| happens(pull,n2) ),
inference(er,[status(thm)],[8421,theory(equality)]) ).
cnf(8424,plain,
( holdsAt(X1,plus(n2,n1))
| n0 = n2
| spinning != X1
| ~ happens(push,n2) ),
inference(spm,[status(thm)],[877,8423,theory(equality)]) ).
cnf(8429,plain,
( holdsAt(X1,n3)
| n0 = n2
| spinning != X1
| ~ happens(push,n2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[8424,147,theory(equality)]),126,theory(equality)]) ).
cnf(8432,plain,
( n0 = n2
| ~ happens(push,n2) ),
inference(spm,[status(thm)],[145,8429,theory(equality)]) ).
cnf(8475,plain,
n0 = n2,
inference(spm,[status(thm)],[8432,95,theory(equality)]) ).
cnf(8482,plain,
less(n2,n1),
inference(rw,[status(thm)],[543,8475,theory(equality)]) ).
cnf(8483,plain,
$false,
inference(sr,[status(thm)],[8482,570,theory(equality)]) ).
cnf(8484,plain,
$false,
8483,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR023+1.p
% --creating new selector for [CSR001+0.ax, CSR001+2.ax]
% -running prover on /tmp/tmpeCccO7/sel_CSR023+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR023+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR023+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR023+1.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
%
%------------------------------------------------------------------------------