TSTP Solution File: SWV455+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV455+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 : Sun Dec 26 12:46:19 EST 2010
% Result : Theorem 14.85s
% Output : CNFRefutation 14.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 17 unt; 0 def)
% Number of atoms : 502 ( 195 equ)
% Maximal formula atoms : 46 ( 9 avg)
% Number of connectives : 745 ( 296 ~; 171 |; 206 &)
% ( 3 <=>; 69 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 9 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 292 ( 37 sgn 219 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(32,axiom,
! [X1,X2,X4] :
( elem(X1,cons(X2,X4))
<=> ( X1 = X2
| elem(X1,X4) ) ),
file('/tmp/tmpOTQsYx/sel_SWV455+1.p_1',axiom_46) ).
fof(44,conjecture,
! [X12,X13,X1,X2] :
( ( ! [X3,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X3))) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> host(X14) != host(X3) )
& ! [X3,X14] :
( elem(m_Halt(X14),queue(host(X3)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X15,X14] :
( elem(m_Ack(X14,X3),queue(host(X15)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X14] :
( ( ~ setIn(X3,alive)
& leq(X14,X3)
& host(X14) = host(X3) )
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( ( X14 != X3
& host(X14) = host(X3) )
=> ( ~ setIn(X3,alive)
| ~ setIn(X14,alive) ) )
& ! [X3,X16,X15,X14] :
( ( host(X15) != host(X3)
& setIn(X3,alive)
& setIn(X15,alive)
& host(X16) = host(X3)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X3)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X1)) = cons(m_Down(X2),X12) )
=> ( setIn(X1,alive)
=> ( ~ leq(host(X1),host(X2))
=> ( ~ ( ( index(ldr,host(X1)) = host(X2)
& index(status,host(X1)) = norm )
| ( index(status,host(X1)) = wait
& host(X2) = host(index(elid,host(X1))) ) )
=> ( ~ ( ! [X3] :
( ( ~ leq(host(X1),X3)
& leq(s(zero),X3) )
=> ( setIn(X3,index(down,host(X1)))
| X3 = host(X2) ) )
& index(status,host(X1)) = elec_1 )
=> ! [X3] :
( host(X1) != host(X3)
=> ! [X17,X18] :
( host(X1) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X3)
& setIn(X3,alive)
& setIn(X18,alive)
& host(X17) = host(X3)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X3))) ) ) ) ) ) ) ) ) ),
file('/tmp/tmpOTQsYx/sel_SWV455+1.p_1',conj) ).
fof(45,negated_conjecture,
~ ! [X12,X13,X1,X2] :
( ( ! [X3,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X3))) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> host(X14) != host(X3) )
& ! [X3,X14] :
( elem(m_Halt(X14),queue(host(X3)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X15,X14] :
( elem(m_Ack(X14,X3),queue(host(X15)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X14] :
( ( ~ setIn(X3,alive)
& leq(X14,X3)
& host(X14) = host(X3) )
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( ( X14 != X3
& host(X14) = host(X3) )
=> ( ~ setIn(X3,alive)
| ~ setIn(X14,alive) ) )
& ! [X3,X16,X15,X14] :
( ( host(X15) != host(X3)
& setIn(X3,alive)
& setIn(X15,alive)
& host(X16) = host(X3)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X3)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X1)) = cons(m_Down(X2),X12) )
=> ( setIn(X1,alive)
=> ( ~ leq(host(X1),host(X2))
=> ( ~ ( ( index(ldr,host(X1)) = host(X2)
& index(status,host(X1)) = norm )
| ( index(status,host(X1)) = wait
& host(X2) = host(index(elid,host(X1))) ) )
=> ( ~ ( ! [X3] :
( ( ~ leq(host(X1),X3)
& leq(s(zero),X3) )
=> ( setIn(X3,index(down,host(X1)))
| X3 = host(X2) ) )
& index(status,host(X1)) = elec_1 )
=> ! [X3] :
( host(X1) != host(X3)
=> ! [X17,X18] :
( host(X1) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X3)
& setIn(X3,alive)
& setIn(X18,alive)
& host(X17) = host(X3)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X3))) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[44]) ).
fof(49,negated_conjecture,
~ ! [X12,X13,X1,X2] :
( ( ! [X3,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X3))) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> host(X14) != host(X3) )
& ! [X3,X14] :
( elem(m_Halt(X14),queue(host(X3)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X15,X14] :
( elem(m_Ack(X14,X3),queue(host(X15)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X14] :
( ( ~ setIn(X3,alive)
& leq(X14,X3)
& host(X14) = host(X3) )
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( ( X14 != X3
& host(X14) = host(X3) )
=> ( ~ setIn(X3,alive)
| ~ setIn(X14,alive) ) )
& ! [X3,X16,X15,X14] :
( ( host(X15) != host(X3)
& setIn(X3,alive)
& setIn(X15,alive)
& host(X16) = host(X3)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X3)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X1)) = cons(m_Down(X2),X12) )
=> ( setIn(X1,alive)
=> ( ~ leq(host(X1),host(X2))
=> ( ~ ( ( index(ldr,host(X1)) = host(X2)
& index(status,host(X1)) = norm )
| ( index(status,host(X1)) = wait
& host(X2) = host(index(elid,host(X1))) ) )
=> ( ~ ( ! [X3] :
( ( ~ leq(host(X1),X3)
& leq(s(zero),X3) )
=> ( setIn(X3,index(down,host(X1)))
| X3 = host(X2) ) )
& index(status,host(X1)) = elec_1 )
=> ! [X3] :
( host(X1) != host(X3)
=> ! [X17,X18] :
( host(X1) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X3)
& setIn(X3,alive)
& setIn(X18,alive)
& host(X17) = host(X3)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X3))) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[45,theory(equality)]) ).
fof(50,plain,
! [X12,X2,X1] :
( epred1_3(X1,X2,X12)
=> ( ! [X3,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X3))) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( elem(m_Down(X14),queue(host(X3)))
=> host(X14) != host(X3) )
& ! [X3,X14] :
( elem(m_Halt(X14),queue(host(X3)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X15,X14] :
( elem(m_Ack(X14,X3),queue(host(X15)))
=> ~ leq(host(X3),host(X14)) )
& ! [X3,X14] :
( ( ~ setIn(X3,alive)
& leq(X14,X3)
& host(X14) = host(X3) )
=> ~ setIn(X14,alive) )
& ! [X3,X14] :
( ( X14 != X3
& host(X14) = host(X3) )
=> ( ~ setIn(X3,alive)
| ~ setIn(X14,alive) ) )
& ! [X3,X16,X15,X14] :
( ( host(X15) != host(X3)
& setIn(X3,alive)
& setIn(X15,alive)
& host(X16) = host(X3)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X3)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X1)) = cons(m_Down(X2),X12) ) ),
introduced(definition) ).
fof(51,negated_conjecture,
~ ! [X12,X13,X1,X2] :
( epred1_3(X1,X2,X12)
=> ( setIn(X1,alive)
=> ( ~ leq(host(X1),host(X2))
=> ( ~ ( ( index(ldr,host(X1)) = host(X2)
& index(status,host(X1)) = norm )
| ( index(status,host(X1)) = wait
& host(X2) = host(index(elid,host(X1))) ) )
=> ( ~ ( ! [X3] :
( ( ~ leq(host(X1),X3)
& leq(s(zero),X3) )
=> ( setIn(X3,index(down,host(X1)))
| X3 = host(X2) ) )
& index(status,host(X1)) = elec_1 )
=> ! [X3] :
( host(X1) != host(X3)
=> ! [X17,X18] :
( host(X1) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X3)
& setIn(X3,alive)
& setIn(X18,alive)
& host(X17) = host(X3)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X3))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(esa)],[49,50,theory(equality)]) ).
fof(135,plain,
! [X1,X2,X4] :
( ( ~ elem(X1,cons(X2,X4))
| X1 = X2
| elem(X1,X4) )
& ( ( X1 != X2
& ~ elem(X1,X4) )
| elem(X1,cons(X2,X4)) ) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(136,plain,
! [X5,X6,X7] :
( ( ~ elem(X5,cons(X6,X7))
| X5 = X6
| elem(X5,X7) )
& ( ( X5 != X6
& ~ elem(X5,X7) )
| elem(X5,cons(X6,X7)) ) ),
inference(variable_rename,[status(thm)],[135]) ).
fof(137,plain,
! [X5,X6,X7] :
( ( ~ elem(X5,cons(X6,X7))
| X5 = X6
| elem(X5,X7) )
& ( X5 != X6
| elem(X5,cons(X6,X7)) )
& ( ~ elem(X5,X7)
| elem(X5,cons(X6,X7)) ) ),
inference(distribute,[status(thm)],[136]) ).
cnf(138,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[137]) ).
fof(165,negated_conjecture,
? [X12,X13,X1,X2] :
( epred1_3(X1,X2,X12)
& setIn(X1,alive)
& ~ leq(host(X1),host(X2))
& ( index(ldr,host(X1)) != host(X2)
| index(status,host(X1)) != norm )
& ( index(status,host(X1)) != wait
| host(X2) != host(index(elid,host(X1))) )
& ( ? [X3] :
( ~ leq(host(X1),X3)
& leq(s(zero),X3)
& ~ setIn(X3,index(down,host(X1)))
& X3 != host(X2) )
| index(status,host(X1)) != elec_1 )
& ? [X3] :
( host(X1) != host(X3)
& ? [X17,X18] :
( host(X1) = host(X18)
& ? [X19] :
( host(X18) != host(X3)
& setIn(X3,alive)
& setIn(X18,alive)
& host(X17) = host(X3)
& host(X19) = host(X18)
& elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X3))) ) ) ) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(166,negated_conjecture,
? [X20,X21,X22,X23] :
( epred1_3(X22,X23,X20)
& setIn(X22,alive)
& ~ leq(host(X22),host(X23))
& ( index(ldr,host(X22)) != host(X23)
| index(status,host(X22)) != norm )
& ( index(status,host(X22)) != wait
| host(X23) != host(index(elid,host(X22))) )
& ( ? [X24] :
( ~ leq(host(X22),X24)
& leq(s(zero),X24)
& ~ setIn(X24,index(down,host(X22)))
& X24 != host(X23) )
| index(status,host(X22)) != elec_1 )
& ? [X25] :
( host(X22) != host(X25)
& ? [X26,X27] :
( host(X22) = host(X27)
& ? [X28] :
( host(X27) != host(X25)
& setIn(X25,alive)
& setIn(X27,alive)
& host(X26) = host(X25)
& host(X28) = host(X27)
& elem(m_Down(X26),X20)
& elem(m_Down(X28),queue(host(X25))) ) ) ) ),
inference(variable_rename,[status(thm)],[165]) ).
fof(167,negated_conjecture,
( epred1_3(esk3_0,esk4_0,esk1_0)
& setIn(esk3_0,alive)
& ~ leq(host(esk3_0),host(esk4_0))
& ( index(ldr,host(esk3_0)) != host(esk4_0)
| index(status,host(esk3_0)) != norm )
& ( index(status,host(esk3_0)) != wait
| host(esk4_0) != host(index(elid,host(esk3_0))) )
& ( ( ~ leq(host(esk3_0),esk5_0)
& leq(s(zero),esk5_0)
& ~ setIn(esk5_0,index(down,host(esk3_0)))
& esk5_0 != host(esk4_0) )
| index(status,host(esk3_0)) != elec_1 )
& host(esk3_0) != host(esk6_0)
& host(esk3_0) = host(esk8_0)
& host(esk8_0) != host(esk6_0)
& setIn(esk6_0,alive)
& setIn(esk8_0,alive)
& host(esk7_0) = host(esk6_0)
& host(esk9_0) = host(esk8_0)
& elem(m_Down(esk7_0),esk1_0)
& elem(m_Down(esk9_0),queue(host(esk6_0))) ),
inference(skolemize,[status(esa)],[166]) ).
fof(168,negated_conjecture,
( epred1_3(esk3_0,esk4_0,esk1_0)
& setIn(esk3_0,alive)
& ~ leq(host(esk3_0),host(esk4_0))
& ( index(ldr,host(esk3_0)) != host(esk4_0)
| index(status,host(esk3_0)) != norm )
& ( index(status,host(esk3_0)) != wait
| host(esk4_0) != host(index(elid,host(esk3_0))) )
& ( ~ leq(host(esk3_0),esk5_0)
| index(status,host(esk3_0)) != elec_1 )
& ( leq(s(zero),esk5_0)
| index(status,host(esk3_0)) != elec_1 )
& ( ~ setIn(esk5_0,index(down,host(esk3_0)))
| index(status,host(esk3_0)) != elec_1 )
& ( esk5_0 != host(esk4_0)
| index(status,host(esk3_0)) != elec_1 )
& host(esk3_0) != host(esk6_0)
& host(esk3_0) = host(esk8_0)
& host(esk8_0) != host(esk6_0)
& setIn(esk6_0,alive)
& setIn(esk8_0,alive)
& host(esk7_0) = host(esk6_0)
& host(esk9_0) = host(esk8_0)
& elem(m_Down(esk7_0),esk1_0)
& elem(m_Down(esk9_0),queue(host(esk6_0))) ),
inference(distribute,[status(thm)],[167]) ).
cnf(169,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk6_0))),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(170,negated_conjecture,
elem(m_Down(esk7_0),esk1_0),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(171,negated_conjecture,
host(esk9_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(172,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(174,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(176,negated_conjecture,
host(esk3_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(177,negated_conjecture,
host(esk3_0) != host(esk6_0),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(185,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[168]) ).
cnf(186,negated_conjecture,
epred1_3(esk3_0,esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[168]) ).
fof(187,plain,
! [X12,X2,X1] :
( ~ epred1_3(X1,X2,X12)
| ( ! [X3,X14] :
( ~ setIn(X14,alive)
| ~ elem(m_Down(X14),queue(host(X3))) )
& ! [X3,X14] :
( ~ elem(m_Down(X14),queue(host(X3)))
| ~ setIn(X14,alive) )
& ! [X3,X14] :
( ~ elem(m_Down(X14),queue(host(X3)))
| host(X14) != host(X3) )
& ! [X3,X14] :
( ~ elem(m_Halt(X14),queue(host(X3)))
| ~ leq(host(X3),host(X14)) )
& ! [X3,X15,X14] :
( ~ elem(m_Ack(X14,X3),queue(host(X15)))
| ~ leq(host(X3),host(X14)) )
& ! [X3,X14] :
( setIn(X3,alive)
| ~ leq(X14,X3)
| host(X14) != host(X3)
| ~ setIn(X14,alive) )
& ! [X3,X14] :
( X14 = X3
| host(X14) != host(X3)
| ~ setIn(X3,alive)
| ~ setIn(X14,alive) )
& ! [X3,X16,X15,X14] :
( host(X15) = host(X3)
| ~ setIn(X3,alive)
| ~ setIn(X15,alive)
| host(X16) != host(X3)
| host(X14) != host(X15)
| ~ elem(m_Down(X14),queue(host(X3)))
| ~ elem(m_Down(X16),queue(host(X15))) )
& queue(host(X1)) = cons(m_Down(X2),X12) ) ),
inference(fof_nnf,[status(thm)],[50]) ).
fof(188,plain,
! [X17,X18,X19] :
( ~ epred1_3(X19,X18,X17)
| ( ! [X20,X21] :
( ~ setIn(X21,alive)
| ~ elem(m_Down(X21),queue(host(X20))) )
& ! [X22,X23] :
( ~ elem(m_Down(X23),queue(host(X22)))
| ~ setIn(X23,alive) )
& ! [X24,X25] :
( ~ elem(m_Down(X25),queue(host(X24)))
| host(X25) != host(X24) )
& ! [X26,X27] :
( ~ elem(m_Halt(X27),queue(host(X26)))
| ~ leq(host(X26),host(X27)) )
& ! [X28,X29,X30] :
( ~ elem(m_Ack(X30,X28),queue(host(X29)))
| ~ leq(host(X28),host(X30)) )
& ! [X31,X32] :
( setIn(X31,alive)
| ~ leq(X32,X31)
| host(X32) != host(X31)
| ~ setIn(X32,alive) )
& ! [X33,X34] :
( X34 = X33
| host(X34) != host(X33)
| ~ setIn(X33,alive)
| ~ setIn(X34,alive) )
& ! [X35,X36,X37,X38] :
( host(X37) = host(X35)
| ~ setIn(X35,alive)
| ~ setIn(X37,alive)
| host(X36) != host(X35)
| host(X38) != host(X37)
| ~ elem(m_Down(X38),queue(host(X35)))
| ~ elem(m_Down(X36),queue(host(X37))) )
& queue(host(X19)) = cons(m_Down(X18),X17) ) ),
inference(variable_rename,[status(thm)],[187]) ).
fof(189,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38] :
( ( ( host(X37) = host(X35)
| ~ setIn(X35,alive)
| ~ setIn(X37,alive)
| host(X36) != host(X35)
| host(X38) != host(X37)
| ~ elem(m_Down(X38),queue(host(X35)))
| ~ elem(m_Down(X36),queue(host(X37))) )
& ( X34 = X33
| host(X34) != host(X33)
| ~ setIn(X33,alive)
| ~ setIn(X34,alive) )
& ( setIn(X31,alive)
| ~ leq(X32,X31)
| host(X32) != host(X31)
| ~ setIn(X32,alive) )
& ( ~ elem(m_Ack(X30,X28),queue(host(X29)))
| ~ leq(host(X28),host(X30)) )
& ( ~ elem(m_Halt(X27),queue(host(X26)))
| ~ leq(host(X26),host(X27)) )
& ( ~ elem(m_Down(X25),queue(host(X24)))
| host(X25) != host(X24) )
& ( ~ elem(m_Down(X23),queue(host(X22)))
| ~ setIn(X23,alive) )
& ( ~ setIn(X21,alive)
| ~ elem(m_Down(X21),queue(host(X20))) )
& queue(host(X19)) = cons(m_Down(X18),X17) )
| ~ epred1_3(X19,X18,X17) ),
inference(shift_quantors,[status(thm)],[188]) ).
fof(190,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38] :
( ( host(X37) = host(X35)
| ~ setIn(X35,alive)
| ~ setIn(X37,alive)
| host(X36) != host(X35)
| host(X38) != host(X37)
| ~ elem(m_Down(X38),queue(host(X35)))
| ~ elem(m_Down(X36),queue(host(X37)))
| ~ epred1_3(X19,X18,X17) )
& ( X34 = X33
| host(X34) != host(X33)
| ~ setIn(X33,alive)
| ~ setIn(X34,alive)
| ~ epred1_3(X19,X18,X17) )
& ( setIn(X31,alive)
| ~ leq(X32,X31)
| host(X32) != host(X31)
| ~ setIn(X32,alive)
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Ack(X30,X28),queue(host(X29)))
| ~ leq(host(X28),host(X30))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Halt(X27),queue(host(X26)))
| ~ leq(host(X26),host(X27))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Down(X25),queue(host(X24)))
| host(X25) != host(X24)
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Down(X23),queue(host(X22)))
| ~ setIn(X23,alive)
| ~ epred1_3(X19,X18,X17) )
& ( ~ setIn(X21,alive)
| ~ elem(m_Down(X21),queue(host(X20)))
| ~ epred1_3(X19,X18,X17) )
& ( queue(host(X19)) = cons(m_Down(X18),X17)
| ~ epred1_3(X19,X18,X17) ) ),
inference(distribute,[status(thm)],[189]) ).
cnf(191,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(199,plain,
( host(X5) = host(X7)
| ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X6) != host(X5)
| host(X4) != host(X7)
| ~ setIn(X5,alive)
| ~ setIn(X7,alive) ),
inference(split_conjunct,[status(thm)],[190]) ).
cnf(200,negated_conjecture,
host(esk9_0) = host(esk3_0),
inference(rw,[status(thm)],[171,176,theory(equality)]) ).
cnf(284,negated_conjecture,
cons(m_Down(esk4_0),esk1_0) = queue(host(esk3_0)),
inference(spm,[status(thm)],[191,186,theory(equality)]) ).
cnf(315,negated_conjecture,
( host(X1) = host(esk6_0)
| host(X1) != host(esk9_0)
| host(X2) != host(esk6_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(esk6_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[199,169,theory(equality)]) ).
cnf(318,negated_conjecture,
( host(X1) = host(esk6_0)
| host(X1) != host(esk3_0)
| host(X2) != host(esk6_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(esk6_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[315,200,theory(equality)]) ).
cnf(319,negated_conjecture,
( host(X1) = host(esk6_0)
| host(X1) != host(esk3_0)
| host(X2) != host(esk6_0)
| ~ epred1_3(X3,X4,X5)
| $false
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[318,174,theory(equality)]) ).
cnf(320,negated_conjecture,
( host(X1) = host(esk6_0)
| host(X1) != host(esk3_0)
| host(X2) != host(esk6_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[319,theory(equality)]) ).
cnf(340,negated_conjecture,
( elem(X1,queue(host(esk3_0)))
| ~ elem(X1,esk1_0) ),
inference(spm,[status(thm)],[138,284,theory(equality)]) ).
cnf(3026,negated_conjecture,
( host(esk3_0) = host(esk6_0)
| host(X1) != host(esk6_0)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk3_0,alive)
| ~ elem(m_Down(X1),esk1_0) ),
inference(spm,[status(thm)],[320,340,theory(equality)]) ).
cnf(3034,negated_conjecture,
( host(esk3_0) = host(esk6_0)
| host(X1) != host(esk6_0)
| ~ epred1_3(X2,X3,X4)
| $false
| ~ elem(m_Down(X1),esk1_0) ),
inference(rw,[status(thm)],[3026,185,theory(equality)]) ).
cnf(3035,negated_conjecture,
( host(esk3_0) = host(esk6_0)
| host(X1) != host(esk6_0)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk1_0) ),
inference(cn,[status(thm)],[3034,theory(equality)]) ).
cnf(3036,negated_conjecture,
( host(X1) != host(esk6_0)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk1_0) ),
inference(sr,[status(thm)],[3035,177,theory(equality)]) ).
fof(486074,plain,
( ~ epred12_0
<=> ! [X1] :
( ~ elem(m_Down(X1),esk1_0)
| host(X1) != host(esk6_0) ) ),
introduced(definition),
[split] ).
cnf(486075,plain,
( epred12_0
| ~ elem(m_Down(X1),esk1_0)
| host(X1) != host(esk6_0) ),
inference(split_equiv,[status(thm)],[486074]) ).
fof(486076,plain,
( ~ epred13_0
<=> ! [X4,X3,X2] : ~ epred1_3(X2,X3,X4) ),
introduced(definition),
[split] ).
cnf(486077,plain,
( epred13_0
| ~ epred1_3(X2,X3,X4) ),
inference(split_equiv,[status(thm)],[486076]) ).
cnf(486078,negated_conjecture,
( ~ epred13_0
| ~ epred12_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[3036,486074,theory(equality)]),486076,theory(equality)]),
[split] ).
cnf(486079,negated_conjecture,
epred13_0,
inference(spm,[status(thm)],[486077,186,theory(equality)]) ).
cnf(486081,negated_conjecture,
( $false
| ~ epred12_0 ),
inference(rw,[status(thm)],[486078,486079,theory(equality)]) ).
cnf(486082,negated_conjecture,
~ epred12_0,
inference(cn,[status(thm)],[486081,theory(equality)]) ).
cnf(489907,negated_conjecture,
( ~ elem(m_Down(X1),esk1_0)
| host(X1) != host(esk6_0) ),
inference(sr,[status(thm)],[486075,486082,theory(equality)]) ).
cnf(489908,negated_conjecture,
host(esk7_0) != host(esk6_0),
inference(spm,[status(thm)],[489907,170,theory(equality)]) ).
cnf(489909,negated_conjecture,
$false,
inference(rw,[status(thm)],[489908,172,theory(equality)]) ).
cnf(489910,negated_conjecture,
$false,
inference(cn,[status(thm)],[489909,theory(equality)]) ).
cnf(489911,negated_conjecture,
$false,
489910,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV455+1.p
% --creating new selector for [SWV011+0.ax]
% -running prover on /tmp/tmpOTQsYx/sel_SWV455+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV455+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV455+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV455+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
%
%------------------------------------------------------------------------------