TSTP Solution File: SWV449+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV449+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 12:47:31 EST 2010
% Result : Theorem 0.99s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 57 ( 21 unt; 0 def)
% Number of atoms : 481 ( 191 equ)
% Maximal formula atoms : 44 ( 8 avg)
% Number of connectives : 665 ( 241 ~; 162 |; 187 &)
% ( 2 <=>; 73 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 9 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 335 ( 44 sgn 242 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1,X2] : m_Down(X1) != m_Ldr(X2),
file('/tmp/tmp9EUllL/sel_SWV449+1.p_1',axiom_18) ).
fof(31,axiom,
! [X1,X2,X4] :
( elem(X1,snoc(X4,X2))
<=> ( X1 = X2
| elem(X1,X4) ) ),
file('/tmp/tmp9EUllL/sel_SWV449+1.p_1',axiom_47) ).
fof(32,axiom,
! [X1,X2,X4] :
( elem(X1,cons(X2,X4))
<=> ( X1 = X2
| elem(X1,X4) ) ),
file('/tmp/tmp9EUllL/sel_SWV449+1.p_1',axiom_46) ).
fof(34,axiom,
! [X1,X2,X4] : snoc(cons(X1,X4),X2) = cons(X1,snoc(X4,X2)),
file('/tmp/tmp9EUllL/sel_SWV449+1.p_1',axiom_44) ).
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_Ack(X13,X2),X12) )
=> ( setIn(X1,alive)
=> ( ( index(elid,host(X1)) = X13
& index(status,host(X1)) = elec_2
& host(X2) = index(pendack,host(X1)) )
=> ( leq(nbr_proc,index(pendack,host(X1)))
=> ! [X3] :
( ( setIn(host(X3),index(acks,host(X1)))
| host(X3) = host(X2) )
=> ! [X17] :
( host(X3) = host(X17)
=> ( host(X1) = host(X17)
=> ! [X18,X19] :
( host(X3) != host(X19)
=> ( host(X1) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X1))) ) ) ) ) ) ) ) ) ) ) ),
file('/tmp/tmp9EUllL/sel_SWV449+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_Ack(X13,X2),X12) )
=> ( setIn(X1,alive)
=> ( ( index(elid,host(X1)) = X13
& index(status,host(X1)) = elec_2
& host(X2) = index(pendack,host(X1)) )
=> ( leq(nbr_proc,index(pendack,host(X1)))
=> ! [X3] :
( ( setIn(host(X3),index(acks,host(X1)))
| host(X3) = host(X2) )
=> ! [X17] :
( host(X3) = host(X17)
=> ( host(X1) = host(X17)
=> ! [X18,X19] :
( host(X3) != host(X19)
=> ( host(X1) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X1))) ) ) ) ) ) ) ) ) ) ) ),
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_Ack(X13,X2),X12) )
=> ( setIn(X1,alive)
=> ( ( index(elid,host(X1)) = X13
& index(status,host(X1)) = elec_2
& host(X2) = index(pendack,host(X1)) )
=> ( leq(nbr_proc,index(pendack,host(X1)))
=> ! [X3] :
( ( setIn(host(X3),index(acks,host(X1)))
| host(X3) = host(X2) )
=> ! [X17] :
( host(X3) = host(X17)
=> ( host(X1) = host(X17)
=> ! [X18,X19] :
( host(X3) != host(X19)
=> ( host(X1) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X1))) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[45,theory(equality)]) ).
fof(50,plain,
! [X13,X12,X2,X1] :
( epred1_4(X1,X2,X12,X13)
=> ( ! [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_Ack(X13,X2),X12) ) ),
introduced(definition) ).
fof(51,negated_conjecture,
~ ! [X12,X13,X1,X2] :
( epred1_4(X1,X2,X12,X13)
=> ( setIn(X1,alive)
=> ( ( index(elid,host(X1)) = X13
& index(status,host(X1)) = elec_2
& host(X2) = index(pendack,host(X1)) )
=> ( leq(nbr_proc,index(pendack,host(X1)))
=> ! [X3] :
( ( setIn(host(X3),index(acks,host(X1)))
| host(X3) = host(X2) )
=> ! [X17] :
( host(X3) = host(X17)
=> ( host(X1) = host(X17)
=> ! [X18,X19] :
( host(X3) != host(X19)
=> ( host(X1) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X1))) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(esa)],[49,50,theory(equality)]) ).
fof(73,plain,
! [X3,X4] : m_Down(X3) != m_Ldr(X4),
inference(variable_rename,[status(thm)],[10]) ).
cnf(74,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[73]) ).
fof(129,plain,
! [X1,X2,X4] :
( ( ~ elem(X1,snoc(X4,X2))
| X1 = X2
| elem(X1,X4) )
& ( ( X1 != X2
& ~ elem(X1,X4) )
| elem(X1,snoc(X4,X2)) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(130,plain,
! [X5,X6,X7] :
( ( ~ elem(X5,snoc(X7,X6))
| X5 = X6
| elem(X5,X7) )
& ( ( X5 != X6
& ~ elem(X5,X7) )
| elem(X5,snoc(X7,X6)) ) ),
inference(variable_rename,[status(thm)],[129]) ).
fof(131,plain,
! [X5,X6,X7] :
( ( ~ elem(X5,snoc(X7,X6))
| X5 = X6
| elem(X5,X7) )
& ( X5 != X6
| elem(X5,snoc(X7,X6)) )
& ( ~ elem(X5,X7)
| elem(X5,snoc(X7,X6)) ) ),
inference(distribute,[status(thm)],[130]) ).
cnf(134,plain,
( elem(X1,X2)
| X1 = X3
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[131]) ).
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(142,plain,
! [X5,X6,X7] : snoc(cons(X5,X7),X6) = cons(X5,snoc(X7,X6)),
inference(variable_rename,[status(thm)],[34]) ).
cnf(143,plain,
snoc(cons(X1,X2),X3) = cons(X1,snoc(X2,X3)),
inference(split_conjunct,[status(thm)],[142]) ).
fof(165,negated_conjecture,
? [X12,X13,X1,X2] :
( epred1_4(X1,X2,X12,X13)
& setIn(X1,alive)
& index(elid,host(X1)) = X13
& index(status,host(X1)) = elec_2
& host(X2) = index(pendack,host(X1))
& leq(nbr_proc,index(pendack,host(X1)))
& ? [X3] :
( ( setIn(host(X3),index(acks,host(X1)))
| host(X3) = host(X2) )
& ? [X17] :
( host(X3) = host(X17)
& host(X1) = host(X17)
& ? [X18,X19] :
( host(X3) != host(X19)
& host(X1) != host(X19)
& ? [X20] :
( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19)
& elem(m_Down(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X1))) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[51]) ).
fof(166,negated_conjecture,
? [X21,X22,X23,X24] :
( epred1_4(X23,X24,X21,X22)
& setIn(X23,alive)
& index(elid,host(X23)) = X22
& index(status,host(X23)) = elec_2
& host(X24) = index(pendack,host(X23))
& leq(nbr_proc,index(pendack,host(X23)))
& ? [X25] :
( ( setIn(host(X25),index(acks,host(X23)))
| host(X25) = host(X24) )
& ? [X26] :
( host(X25) = host(X26)
& host(X23) = host(X26)
& ? [X27,X28] :
( host(X25) != host(X28)
& host(X23) != host(X28)
& ? [X29] :
( host(X28) != host(X26)
& setIn(X26,alive)
& setIn(X28,alive)
& host(X27) = host(X26)
& host(X29) = host(X28)
& elem(m_Down(X27),queue(host(X28)))
& elem(m_Down(X29),snoc(X21,m_Ldr(X23))) ) ) ) ) ),
inference(variable_rename,[status(thm)],[165]) ).
fof(167,negated_conjecture,
( epred1_4(esk3_0,esk4_0,esk1_0,esk2_0)
& setIn(esk3_0,alive)
& index(elid,host(esk3_0)) = esk2_0
& index(status,host(esk3_0)) = elec_2
& host(esk4_0) = index(pendack,host(esk3_0))
& leq(nbr_proc,index(pendack,host(esk3_0)))
& ( setIn(host(esk5_0),index(acks,host(esk3_0)))
| host(esk5_0) = host(esk4_0) )
& host(esk5_0) = host(esk6_0)
& host(esk3_0) = host(esk6_0)
& host(esk5_0) != host(esk8_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),queue(host(esk8_0)))
& elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk3_0))) ),
inference(skolemize,[status(esa)],[166]) ).
cnf(168,negated_conjecture,
elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk3_0))),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(169,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk8_0))),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(170,negated_conjecture,
host(esk9_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(171,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(172,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(175,negated_conjecture,
host(esk3_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(177,negated_conjecture,
host(esk3_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(184,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[167]) ).
cnf(185,negated_conjecture,
epred1_4(esk3_0,esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[167]) ).
fof(186,plain,
! [X13,X12,X2,X1] :
( ~ epred1_4(X1,X2,X12,X13)
| ( ! [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_Ack(X13,X2),X12) ) ),
inference(fof_nnf,[status(thm)],[50]) ).
fof(187,plain,
! [X17,X18,X19,X20] :
( ~ epred1_4(X20,X19,X18,X17)
| ( ! [X21,X22] :
( ~ setIn(X22,alive)
| ~ elem(m_Down(X22),queue(host(X21))) )
& ! [X23,X24] :
( ~ elem(m_Down(X24),queue(host(X23)))
| ~ setIn(X24,alive) )
& ! [X25,X26] :
( ~ elem(m_Down(X26),queue(host(X25)))
| host(X26) != host(X25) )
& ! [X27,X28] :
( ~ elem(m_Halt(X28),queue(host(X27)))
| ~ leq(host(X27),host(X28)) )
& ! [X29,X30,X31] :
( ~ elem(m_Ack(X31,X29),queue(host(X30)))
| ~ leq(host(X29),host(X31)) )
& ! [X32,X33] :
( setIn(X32,alive)
| ~ leq(X33,X32)
| host(X33) != host(X32)
| ~ setIn(X33,alive) )
& ! [X34,X35] :
( X35 = X34
| host(X35) != host(X34)
| ~ setIn(X34,alive)
| ~ setIn(X35,alive) )
& ! [X36,X37,X38,X39] :
( host(X38) = host(X36)
| ~ setIn(X36,alive)
| ~ setIn(X38,alive)
| host(X37) != host(X36)
| host(X39) != host(X38)
| ~ elem(m_Down(X39),queue(host(X36)))
| ~ elem(m_Down(X37),queue(host(X38))) )
& queue(host(X20)) = cons(m_Ack(X17,X19),X18) ) ),
inference(variable_rename,[status(thm)],[186]) ).
fof(188,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39] :
( ( ( host(X38) = host(X36)
| ~ setIn(X36,alive)
| ~ setIn(X38,alive)
| host(X37) != host(X36)
| host(X39) != host(X38)
| ~ elem(m_Down(X39),queue(host(X36)))
| ~ elem(m_Down(X37),queue(host(X38))) )
& ( X35 = X34
| host(X35) != host(X34)
| ~ setIn(X34,alive)
| ~ setIn(X35,alive) )
& ( setIn(X32,alive)
| ~ leq(X33,X32)
| host(X33) != host(X32)
| ~ setIn(X33,alive) )
& ( ~ elem(m_Ack(X31,X29),queue(host(X30)))
| ~ leq(host(X29),host(X31)) )
& ( ~ elem(m_Halt(X28),queue(host(X27)))
| ~ leq(host(X27),host(X28)) )
& ( ~ elem(m_Down(X26),queue(host(X25)))
| host(X26) != host(X25) )
& ( ~ elem(m_Down(X24),queue(host(X23)))
| ~ setIn(X24,alive) )
& ( ~ setIn(X22,alive)
| ~ elem(m_Down(X22),queue(host(X21))) )
& queue(host(X20)) = cons(m_Ack(X17,X19),X18) )
| ~ epred1_4(X20,X19,X18,X17) ),
inference(shift_quantors,[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,X39] :
( ( host(X38) = host(X36)
| ~ setIn(X36,alive)
| ~ setIn(X38,alive)
| host(X37) != host(X36)
| host(X39) != host(X38)
| ~ elem(m_Down(X39),queue(host(X36)))
| ~ elem(m_Down(X37),queue(host(X38)))
| ~ epred1_4(X20,X19,X18,X17) )
& ( X35 = X34
| host(X35) != host(X34)
| ~ setIn(X34,alive)
| ~ setIn(X35,alive)
| ~ epred1_4(X20,X19,X18,X17) )
& ( setIn(X32,alive)
| ~ leq(X33,X32)
| host(X33) != host(X32)
| ~ setIn(X33,alive)
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Ack(X31,X29),queue(host(X30)))
| ~ leq(host(X29),host(X31))
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Halt(X28),queue(host(X27)))
| ~ leq(host(X27),host(X28))
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Down(X26),queue(host(X25)))
| host(X26) != host(X25)
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ elem(m_Down(X24),queue(host(X23)))
| ~ setIn(X24,alive)
| ~ epred1_4(X20,X19,X18,X17) )
& ( ~ setIn(X22,alive)
| ~ elem(m_Down(X22),queue(host(X21)))
| ~ epred1_4(X20,X19,X18,X17) )
& ( queue(host(X20)) = cons(m_Ack(X17,X19),X18)
| ~ epred1_4(X20,X19,X18,X17) ) ),
inference(distribute,[status(thm)],[188]) ).
cnf(190,plain,
( queue(host(X1)) = cons(m_Ack(X4,X2),X3)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[189]) ).
cnf(198,plain,
( host(X6) = host(X8)
| ~ epred1_4(X1,X2,X3,X4)
| ~ elem(m_Down(X5),queue(host(X6)))
| ~ elem(m_Down(X7),queue(host(X8)))
| host(X7) != host(X6)
| host(X5) != host(X8)
| ~ setIn(X6,alive)
| ~ setIn(X8,alive) ),
inference(split_conjunct,[status(thm)],[189]) ).
cnf(200,negated_conjecture,
host(esk7_0) = host(esk3_0),
inference(rw,[status(thm)],[171,177,theory(equality)]) ).
cnf(293,plain,
( elem(X1,snoc(cons(X2,X3),X4))
| ~ elem(X1,snoc(X3,X4)) ),
inference(spm,[status(thm)],[138,143,theory(equality)]) ).
cnf(295,negated_conjecture,
cons(m_Ack(esk2_0,esk4_0),esk1_0) = queue(host(esk3_0)),
inference(spm,[status(thm)],[190,185,theory(equality)]) ).
cnf(321,negated_conjecture,
( host(X1) = host(esk8_0)
| host(X1) != host(esk7_0)
| host(X2) != host(esk8_0)
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(esk8_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(spm,[status(thm)],[198,169,theory(equality)]) ).
cnf(324,negated_conjecture,
( host(X1) = host(esk8_0)
| host(X1) != host(esk3_0)
| host(X2) != host(esk8_0)
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(esk8_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[321,200,theory(equality)]) ).
cnf(325,negated_conjecture,
( host(X1) = host(esk8_0)
| host(X1) != host(esk3_0)
| host(X2) != host(esk8_0)
| ~ epred1_4(X3,X4,X5,X6)
| $false
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[324,172,theory(equality)]) ).
cnf(326,negated_conjecture,
( host(X1) = host(esk8_0)
| host(X1) != host(esk3_0)
| host(X2) != host(esk8_0)
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[325,theory(equality)]) ).
cnf(2338,negated_conjecture,
( elem(X1,snoc(queue(host(esk3_0)),X2))
| ~ elem(X1,snoc(esk1_0,X2)) ),
inference(spm,[status(thm)],[293,295,theory(equality)]) ).
cnf(23610,negated_conjecture,
( X1 = X2
| elem(X1,queue(host(esk3_0)))
| ~ elem(X1,snoc(esk1_0,X2)) ),
inference(spm,[status(thm)],[134,2338,theory(equality)]) ).
cnf(23920,negated_conjecture,
( m_Down(esk9_0) = m_Ldr(esk3_0)
| elem(m_Down(esk9_0),queue(host(esk3_0))) ),
inference(spm,[status(thm)],[23610,168,theory(equality)]) ).
cnf(23922,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk3_0))),
inference(sr,[status(thm)],[23920,74,theory(equality)]) ).
cnf(23927,negated_conjecture,
( host(esk3_0) = host(esk8_0)
| host(esk9_0) != host(esk8_0)
| ~ epred1_4(X1,X2,X3,X4)
| ~ setIn(esk3_0,alive) ),
inference(spm,[status(thm)],[326,23922,theory(equality)]) ).
cnf(23934,negated_conjecture,
( host(esk3_0) = host(esk8_0)
| $false
| ~ epred1_4(X1,X2,X3,X4)
| ~ setIn(esk3_0,alive) ),
inference(rw,[status(thm)],[23927,170,theory(equality)]) ).
cnf(23935,negated_conjecture,
( host(esk3_0) = host(esk8_0)
| $false
| ~ epred1_4(X1,X2,X3,X4)
| $false ),
inference(rw,[status(thm)],[23934,184,theory(equality)]) ).
cnf(23936,negated_conjecture,
( host(esk3_0) = host(esk8_0)
| ~ epred1_4(X1,X2,X3,X4) ),
inference(cn,[status(thm)],[23935,theory(equality)]) ).
cnf(23937,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(sr,[status(thm)],[23936,175,theory(equality)]) ).
cnf(23941,negated_conjecture,
$false,
inference(sr,[status(thm)],[185,23937,theory(equality)]) ).
cnf(23942,negated_conjecture,
$false,
23941,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV449+1.p
% --creating new selector for [SWV011+0.ax]
% -running prover on /tmp/tmp9EUllL/sel_SWV449+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV449+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV449+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV449+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
%
%------------------------------------------------------------------------------