TSTP Solution File: CSR017+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR017+1 : 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:59:55 EST 2010
% Result : Theorem 0.35s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 30 unt; 0 def)
% Number of atoms : 540 ( 264 equ)
% Maximal formula atoms : 120 ( 6 avg)
% Number of connectives : 655 ( 203 ~; 306 |; 134 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 123 ( 3 sgn 81 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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/tmpqzp9GK/sel_CSR017+1.p_1',initiates_all_defn) ).
fof(6,axiom,
push != pull,
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',push_not_pull) ).
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/tmpqzp9GK/sel_CSR017+1.p_1',happens_all_defn) ).
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/tmpqzp9GK/sel_CSR017+1.p_1',keep_not_holding) ).
fof(13,axiom,
forwards != spinning,
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',forwards_not_spinning) ).
fof(21,axiom,
plus(n0,n1) = n1,
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',plus0_1) ).
fof(22,axiom,
~ holdsAt(spinning,n0),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',not_splinning_0) ).
fof(26,conjecture,
~ holdsAt(spinning,n1),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',not_spinning_1) ).
fof(27,axiom,
! [X3,X2] : ~ releasedAt(X3,X2),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',not_releasedAt) ).
fof(28,axiom,
! [X4,X5] :
( less(X4,X5)
<=> ( ~ less(X5,X4)
& X5 != X4 ) ),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',less_property) ).
fof(29,axiom,
! [X4,X5] : plus(X4,X5) = plus(X5,X4),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',symmetry_of_plus) ).
fof(30,axiom,
! [X4,X5] :
( less_or_equal(X4,X5)
<=> ( less(X4,X5)
| X4 = X5 ) ),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',less_or_equal) ).
fof(39,axiom,
! [X4] :
( less(X4,n1)
<=> less_or_equal(X4,n0) ),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',less1) ).
fof(40,axiom,
! [X4] :
( less(X4,n2)
<=> less_or_equal(X4,n1) ),
file('/tmp/tmpqzp9GK/sel_CSR017+1.p_1',less2) ).
fof(42,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(assume_negation,[status(cth)],[26]) ).
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(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(50,plain,
~ holdsAt(spinning,n0),
inference(fof_simplification,[status(thm)],[22,theory(equality)]) ).
fof(51,negated_conjecture,
holdsAt(spinning,n1),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
fof(52,plain,
! [X3,X2] : ~ releasedAt(X3,X2),
inference(fof_simplification,[status(thm)],[27,theory(equality)]) ).
fof(53,plain,
! [X4,X5] :
( less(X4,X5)
<=> ( ~ less(X5,X4)
& X5 != X4 ) ),
inference(fof_simplification,[status(thm)],[28,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(58,plain,
! [X1,X3,X2] :
( initiates(X1,X3,X2)
<=> epred1_3(X2,X3,X1) ),
inference(apply_def,[status(esa)],[44,55,theory(equality)]) ).
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(67,plain,
( epred1_3(X1,X2,X3)
| ~ initiates(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(74,plain,
push != pull,
inference(split_conjunct,[status(thm)],[6]) ).
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(107,plain,
( X1 = push
| X2 = n1
| X2 = n2
| X2 = n2
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
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(132,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[21]) ).
cnf(133,plain,
~ holdsAt(spinning,n0),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(137,negated_conjecture,
holdsAt(spinning,n1),
inference(split_conjunct,[status(thm)],[51]) ).
fof(138,plain,
! [X4,X5] : ~ releasedAt(X4,X5),
inference(variable_rename,[status(thm)],[52]) ).
cnf(139,plain,
~ releasedAt(X1,X2),
inference(split_conjunct,[status(thm)],[138]) ).
fof(140,plain,
! [X4,X5] :
( ( ~ less(X4,X5)
| ( ~ less(X5,X4)
& X5 != X4 ) )
& ( less(X5,X4)
| X5 = X4
| less(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[53]) ).
fof(141,plain,
! [X6,X7] :
( ( ~ less(X6,X7)
| ( ~ less(X7,X6)
& X7 != X6 ) )
& ( less(X7,X6)
| X7 = X6
| less(X6,X7) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,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)],[141]) ).
cnf(145,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[142]) ).
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(217,plain,
( X2 = forwards
| X3 = pull
| X3 = pull
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[196]) ).
cnf(294,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[151,theory(equality)]) ).
cnf(305,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[132,147,theory(equality)]) ).
cnf(517,plain,
( holdsAt(X1,X2)
| happens(esk3_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[123,139,theory(equality)]) ).
cnf(519,plain,
( holdsAt(X1,X2)
| happens(esk3_2(X1,X2),X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[517,147,theory(equality)]) ).
cnf(526,plain,
( holdsAt(X1,X2)
| initiates(esk3_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[122,139,theory(equality)]) ).
cnf(527,plain,
( epred1_3(X1,X2,esk3_2(X2,X1))
| holdsAt(X2,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(spm,[status(thm)],[67,526,theory(equality)]) ).
cnf(545,plain,
less(n0,n1),
inference(spm,[status(thm)],[184,294,theory(equality)]) ).
cnf(546,plain,
less(n1,n2),
inference(spm,[status(thm)],[188,294,theory(equality)]) ).
cnf(555,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[145,546,theory(equality)]) ).
cnf(988,plain,
( holdsAt(X1,n0)
| happens(esk3_2(X1,n0),n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[519,305,theory(equality)]) ).
cnf(1001,plain,
( pull = esk3_2(X1,X2)
| forwards = X1
| holdsAt(X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[217,527,theory(equality)]) ).
cnf(1817,plain,
( esk3_2(X1,X2) = pull
| forwards = X1
| holdsAt(X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[1001,147,theory(equality)]) ).
cnf(1884,plain,
( esk3_2(X1,n0) = pull
| forwards = X1
| holdsAt(X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[1817,305,theory(equality)]) ).
cnf(1910,plain,
( holdsAt(X1,n0)
| happens(pull,n0)
| forwards = X1
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[988,1884,theory(equality)]) ).
cnf(1933,plain,
( forwards = spinning
| happens(pull,n0)
| ~ holdsAt(spinning,n1) ),
inference(spm,[status(thm)],[133,1910,theory(equality)]) ).
cnf(1937,plain,
( forwards = spinning
| happens(pull,n0)
| $false ),
inference(rw,[status(thm)],[1933,137,theory(equality)]) ).
cnf(1938,plain,
( forwards = spinning
| happens(pull,n0) ),
inference(cn,[status(thm)],[1937,theory(equality)]) ).
cnf(1939,plain,
happens(pull,n0),
inference(sr,[status(thm)],[1938,124,theory(equality)]) ).
cnf(1942,plain,
( n2 = n0
| push = pull
| n1 = n0 ),
inference(spm,[status(thm)],[107,1939,theory(equality)]) ).
cnf(1947,plain,
( n0 = n2
| n0 = n1 ),
inference(sr,[status(thm)],[1942,74,theory(equality)]) ).
cnf(1956,plain,
( less(n2,n1)
| n0 = n1 ),
inference(spm,[status(thm)],[545,1947,theory(equality)]) ).
cnf(1976,plain,
n0 = n1,
inference(sr,[status(thm)],[1956,555,theory(equality)]) ).
cnf(1992,plain,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[133,1976,theory(equality)]),137,theory(equality)]) ).
cnf(1993,plain,
$false,
inference(cn,[status(thm)],[1992,theory(equality)]) ).
cnf(1994,plain,
$false,
1993,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR017+1.p
% --creating new selector for [CSR001+0.ax, CSR001+2.ax]
% -running prover on /tmp/tmpqzp9GK/sel_CSR017+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR017+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR017+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR017+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
%
%------------------------------------------------------------------------------