TSTP Solution File: CSR019+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR019+1 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:05 EST 2010
% Result : Theorem 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 11 unt; 0 def)
% Number of atoms : 653 ( 346 equ)
% Maximal formula atoms : 149 ( 12 avg)
% Number of connectives : 866 ( 264 ~; 403 |; 188 &)
% ( 9 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 96 ( 2 sgn 64 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( ( happens(X1,X2)
& terminates(X1,X3,X2) )
=> ~ holdsAt(X3,plus(X2,n1)) ),
file('/tmp/tmpMnqJL1/sel_CSR019+1.p_1',happens_terminates_not_holds) ).
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/tmpMnqJL1/sel_CSR019+1.p_1',terminates_all_defn) ).
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/tmpMnqJL1/sel_CSR019+1.p_1',happens_all_defn) ).
fof(16,axiom,
plus(n1,n1) = n2,
file('/tmp/tmpMnqJL1/sel_CSR019+1.p_1',plus1_1) ).
fof(29,conjecture,
~ holdsAt(forwards,n2),
file('/tmp/tmpMnqJL1/sel_CSR019+1.p_1',not_forwards_2) ).
fof(42,negated_conjecture,
~ ~ holdsAt(forwards,n2),
inference(assume_negation,[status(cth)],[29]) ).
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(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(53,negated_conjecture,
holdsAt(forwards,n2),
inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).
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(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(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]) ).
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(97,plain,
( happens(X1,X2)
| X2 != n1
| X1 != pull ),
inference(split_conjunct,[status(thm)],[94]) ).
cnf(127,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[16]) ).
cnf(147,negated_conjecture,
holdsAt(forwards,n2),
inference(split_conjunct,[status(thm)],[53]) ).
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]) ).
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(266,plain,
( epred3_3(X1,X2,X3)
| ~ epred2_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[262]) ).
cnf(398,plain,
( epred2_3(X1,X2,X3)
| forwards != X2
| pull != X3 ),
inference(csr,[status(thm)],[230,231]) ).
cnf(409,plain,
( ~ holdsAt(X1,n2)
| ~ terminates(X2,X1,n1)
| ~ happens(X2,n1) ),
inference(spm,[status(thm)],[63,127,theory(equality)]) ).
cnf(869,plain,
( ~ holdsAt(X1,n2)
| ~ happens(X2,n1)
| ~ epred3_3(n1,X1,X2) ),
inference(spm,[status(thm)],[409,72,theory(equality)]) ).
cnf(1618,plain,
( ~ holdsAt(X1,n2)
| ~ happens(X2,n1)
| ~ epred2_3(n1,X1,X2) ),
inference(spm,[status(thm)],[869,266,theory(equality)]) ).
cnf(1732,plain,
( ~ holdsAt(X1,n2)
| ~ happens(X2,n1)
| forwards != X1
| pull != X2 ),
inference(spm,[status(thm)],[1618,398,theory(equality)]) ).
fof(1775,plain,
( ~ epred6_0
<=> ! [X1] :
( ~ holdsAt(X1,n2)
| forwards != X1 ) ),
introduced(definition),
[split] ).
cnf(1776,plain,
( epred6_0
| ~ holdsAt(X1,n2)
| forwards != X1 ),
inference(split_equiv,[status(thm)],[1775]) ).
fof(1777,plain,
( ~ epred7_0
<=> ! [X2] :
( ~ happens(X2,n1)
| pull != X2 ) ),
introduced(definition),
[split] ).
cnf(1778,plain,
( epred7_0
| ~ happens(X2,n1)
| pull != X2 ),
inference(split_equiv,[status(thm)],[1777]) ).
cnf(1779,plain,
( ~ epred7_0
| ~ epred6_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[1732,1775,theory(equality)]),1777,theory(equality)]),
[split] ).
cnf(1780,negated_conjecture,
epred6_0,
inference(spm,[status(thm)],[1776,147,theory(equality)]) ).
cnf(1782,plain,
( ~ epred7_0
| $false ),
inference(rw,[status(thm)],[1779,1780,theory(equality)]) ).
cnf(1783,plain,
~ epred7_0,
inference(cn,[status(thm)],[1782,theory(equality)]) ).
cnf(1784,plain,
( ~ happens(X2,n1)
| pull != X2 ),
inference(sr,[status(thm)],[1778,1783,theory(equality)]) ).
cnf(1787,plain,
pull != X1,
inference(spm,[status(thm)],[1784,97,theory(equality)]) ).
cnf(1790,plain,
$false,
inference(er,[status(thm)],[1787,theory(equality)]) ).
cnf(1793,plain,
$false,
1790,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR019+1.p
% --creating new selector for [CSR001+0.ax, CSR001+2.ax]
% -running prover on /tmp/tmpMnqJL1/sel_CSR019+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR019+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR019+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR019+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
%
%------------------------------------------------------------------------------