TSTP Solution File: SWV449+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV449+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %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 : Thu Dec 30 08:59:25 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP24647/SWV449+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24647/SWV449+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24647/SWV449+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 24743
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X2]:![X3]:~(m_Down(X2)=m_Ldr(X3)),file('/tmp/SRASS.s.p', axiom_18)).
% fof(15, axiom,![X2]:![X3]:![X11]:(elem(X2,cons(X3,X11))<=>(X2=X3|elem(X2,X11))),file('/tmp/SRASS.s.p', axiom_46)).
% fof(16, axiom,![X2]:![X3]:![X11]:(elem(X2,snoc(X11,X3))<=>(X2=X3|elem(X2,X11))),file('/tmp/SRASS.s.p', axiom_47)).
% fof(67, conjecture,![X12]:![X13]:![X2]:![X3]:(((((((((![X4]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X4)))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(setIn(X14,alive))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(host(X14)=host(X4))))&![X4]:![X14]:(elem(m_Halt(X14),queue(host(X4)))=>~(leq(host(X4),host(X14)))))&![X4]:![X15]:![X14]:(elem(m_Ack(X14,X4),queue(host(X15)))=>~(leq(host(X4),host(X14)))))&![X4]:![X14]:(((~(setIn(X4,alive))&leq(X14,X4))&host(X14)=host(X4))=>~(setIn(X14,alive))))&![X4]:![X14]:((~(X14=X4)&host(X14)=host(X4))=>(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X4))&setIn(X4,alive))&setIn(X15,alive))&host(X16)=host(X4))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X4)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X2))=cons(m_Ack(X13,X3),X12))=>(setIn(X2,alive)=>(((index(elid,host(X2))=X13&index(status,host(X2))=elec_2)&host(X3)=index(pendack,host(X2)))=>(leq(nbr_proc,index(pendack,host(X2)))=>![X4]:((setIn(host(X4),index(acks,host(X2)))|host(X4)=host(X3))=>![X17]:(host(X4)=host(X17)=>(host(X2)=host(X17)=>![X18]:![X19]:(~(host(X4)=host(X19))=>(~(host(X2)=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(X2))))))))))))))),file('/tmp/SRASS.s.p', conj)).
% fof(68, negated_conjecture,~(![X12]:![X13]:![X2]:![X3]:(((((((((![X4]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X4)))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(setIn(X14,alive))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(host(X14)=host(X4))))&![X4]:![X14]:(elem(m_Halt(X14),queue(host(X4)))=>~(leq(host(X4),host(X14)))))&![X4]:![X15]:![X14]:(elem(m_Ack(X14,X4),queue(host(X15)))=>~(leq(host(X4),host(X14)))))&![X4]:![X14]:(((~(setIn(X4,alive))&leq(X14,X4))&host(X14)=host(X4))=>~(setIn(X14,alive))))&![X4]:![X14]:((~(X14=X4)&host(X14)=host(X4))=>(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X4))&setIn(X4,alive))&setIn(X15,alive))&host(X16)=host(X4))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X4)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X2))=cons(m_Ack(X13,X3),X12))=>(setIn(X2,alive)=>(((index(elid,host(X2))=X13&index(status,host(X2))=elec_2)&host(X3)=index(pendack,host(X2)))=>(leq(nbr_proc,index(pendack,host(X2)))=>![X4]:((setIn(host(X4),index(acks,host(X2)))|host(X4)=host(X3))=>![X17]:(host(X4)=host(X17)=>(host(X2)=host(X17)=>![X18]:![X19]:(~(host(X4)=host(X19))=>(~(host(X2)=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(X2)))))))))))))))),inference(assume_negation,[status(cth)],[67])).
% fof(73, negated_conjecture,~(![X12]:![X13]:![X2]:![X3]:(((((((((![X4]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X4)))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(setIn(X14,alive))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(host(X14)=host(X4))))&![X4]:![X14]:(elem(m_Halt(X14),queue(host(X4)))=>~(leq(host(X4),host(X14)))))&![X4]:![X15]:![X14]:(elem(m_Ack(X14,X4),queue(host(X15)))=>~(leq(host(X4),host(X14)))))&![X4]:![X14]:(((~(setIn(X4,alive))&leq(X14,X4))&host(X14)=host(X4))=>~(setIn(X14,alive))))&![X4]:![X14]:((~(X14=X4)&host(X14)=host(X4))=>(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X4))&setIn(X4,alive))&setIn(X15,alive))&host(X16)=host(X4))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X4)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X2))=cons(m_Ack(X13,X3),X12))=>(setIn(X2,alive)=>(((index(elid,host(X2))=X13&index(status,host(X2))=elec_2)&host(X3)=index(pendack,host(X2)))=>(leq(nbr_proc,index(pendack,host(X2)))=>![X4]:((setIn(host(X4),index(acks,host(X2)))|host(X4)=host(X3))=>![X17]:(host(X4)=host(X17)=>(host(X2)=host(X17)=>![X18]:![X19]:(~(host(X4)=host(X19))=>(~(host(X2)=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(X2)))))))))))))))),inference(fof_simplification,[status(thm)],[68,theory(equality)])).
% fof(74, plain,![X13]:![X12]:![X3]:![X2]:(epred1_4(X2,X3,X12,X13)=>((((((((![X4]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X4)))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(setIn(X14,alive))))&![X4]:![X14]:(elem(m_Down(X14),queue(host(X4)))=>~(host(X14)=host(X4))))&![X4]:![X14]:(elem(m_Halt(X14),queue(host(X4)))=>~(leq(host(X4),host(X14)))))&![X4]:![X15]:![X14]:(elem(m_Ack(X14,X4),queue(host(X15)))=>~(leq(host(X4),host(X14)))))&![X4]:![X14]:(((~(setIn(X4,alive))&leq(X14,X4))&host(X14)=host(X4))=>~(setIn(X14,alive))))&![X4]:![X14]:((~(X14=X4)&host(X14)=host(X4))=>(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X4))&setIn(X4,alive))&setIn(X15,alive))&host(X16)=host(X4))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X4)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X2))=cons(m_Ack(X13,X3),X12))),introduced(definition)).
% fof(75, negated_conjecture,~(![X12]:![X13]:![X2]:![X3]:(epred1_4(X2,X3,X12,X13)=>(setIn(X2,alive)=>(((index(elid,host(X2))=X13&index(status,host(X2))=elec_2)&host(X3)=index(pendack,host(X2)))=>(leq(nbr_proc,index(pendack,host(X2)))=>![X4]:((setIn(host(X4),index(acks,host(X2)))|host(X4)=host(X3))=>![X17]:(host(X4)=host(X17)=>(host(X2)=host(X17)=>![X18]:![X19]:(~(host(X4)=host(X19))=>(~(host(X2)=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(X2)))))))))))))))),inference(apply_def,[status(esa)],[73,74,theory(equality)])).
% fof(86, plain,![X4]:![X5]:~(m_Down(X4)=m_Ldr(X5)),inference(variable_rename,[status(thm)],[6])).
% cnf(87,plain,(m_Down(X1)!=m_Ldr(X2)),inference(split_conjunct,[status(thm)],[86])).
% fof(113, plain,![X2]:![X3]:![X11]:((~(elem(X2,cons(X3,X11)))|(X2=X3|elem(X2,X11)))&((~(X2=X3)&~(elem(X2,X11)))|elem(X2,cons(X3,X11)))),inference(fof_nnf,[status(thm)],[15])).
% fof(114, plain,![X12]:![X13]:![X14]:((~(elem(X12,cons(X13,X14)))|(X12=X13|elem(X12,X14)))&((~(X12=X13)&~(elem(X12,X14)))|elem(X12,cons(X13,X14)))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X12]:![X13]:![X14]:((~(elem(X12,cons(X13,X14)))|(X12=X13|elem(X12,X14)))&((~(X12=X13)|elem(X12,cons(X13,X14)))&(~(elem(X12,X14))|elem(X12,cons(X13,X14))))),inference(distribute,[status(thm)],[114])).
% cnf(116,plain,(elem(X1,cons(X2,X3))|~elem(X1,X3)),inference(split_conjunct,[status(thm)],[115])).
% fof(119, plain,![X2]:![X3]:![X11]:((~(elem(X2,snoc(X11,X3)))|(X2=X3|elem(X2,X11)))&((~(X2=X3)&~(elem(X2,X11)))|elem(X2,snoc(X11,X3)))),inference(fof_nnf,[status(thm)],[16])).
% fof(120, plain,![X12]:![X13]:![X14]:((~(elem(X12,snoc(X14,X13)))|(X12=X13|elem(X12,X14)))&((~(X12=X13)&~(elem(X12,X14)))|elem(X12,snoc(X14,X13)))),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,![X12]:![X13]:![X14]:((~(elem(X12,snoc(X14,X13)))|(X12=X13|elem(X12,X14)))&((~(X12=X13)|elem(X12,snoc(X14,X13)))&(~(elem(X12,X14))|elem(X12,snoc(X14,X13))))),inference(distribute,[status(thm)],[120])).
% cnf(124,plain,(elem(X1,X2)|X1=X3|~elem(X1,snoc(X2,X3))),inference(split_conjunct,[status(thm)],[121])).
% fof(265, negated_conjecture,?[X12]:?[X13]:?[X2]:?[X3]:(epred1_4(X2,X3,X12,X13)&(setIn(X2,alive)&(((index(elid,host(X2))=X13&index(status,host(X2))=elec_2)&host(X3)=index(pendack,host(X2)))&(leq(nbr_proc,index(pendack,host(X2)))&?[X4]:((setIn(host(X4),index(acks,host(X2)))|host(X4)=host(X3))&?[X17]:(host(X4)=host(X17)&(host(X2)=host(X17)&?[X18]:?[X19]:(~(host(X4)=host(X19))&(~(host(X2)=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(X2)))))))))))))),inference(fof_nnf,[status(thm)],[75])).
% fof(266, 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)],[265])).
% fof(267, negated_conjecture,(epred1_4(esk6_0,esk7_0,esk4_0,esk5_0)&(setIn(esk6_0,alive)&(((index(elid,host(esk6_0))=esk5_0&index(status,host(esk6_0))=elec_2)&host(esk7_0)=index(pendack,host(esk6_0)))&(leq(nbr_proc,index(pendack,host(esk6_0)))&((setIn(host(esk8_0),index(acks,host(esk6_0)))|host(esk8_0)=host(esk7_0))&(host(esk8_0)=host(esk9_0)&(host(esk6_0)=host(esk9_0)&(~(host(esk8_0)=host(esk11_0))&(~(host(esk6_0)=host(esk11_0))&(((((~(host(esk11_0)=host(esk9_0))&setIn(esk9_0,alive))&setIn(esk11_0,alive))&host(esk10_0)=host(esk9_0))&host(esk12_0)=host(esk11_0))&(elem(m_Down(esk10_0),queue(host(esk11_0)))&elem(m_Down(esk12_0),snoc(esk4_0,m_Ldr(esk6_0)))))))))))))),inference(skolemize,[status(esa)],[266])).
% cnf(268,negated_conjecture,(elem(m_Down(esk12_0),snoc(esk4_0,m_Ldr(esk6_0)))),inference(split_conjunct,[status(thm)],[267])).
% cnf(269,negated_conjecture,(elem(m_Down(esk10_0),queue(host(esk11_0)))),inference(split_conjunct,[status(thm)],[267])).
% cnf(270,negated_conjecture,(host(esk12_0)=host(esk11_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(271,negated_conjecture,(host(esk10_0)=host(esk9_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(272,negated_conjecture,(setIn(esk11_0,alive)),inference(split_conjunct,[status(thm)],[267])).
% cnf(275,negated_conjecture,(host(esk6_0)!=host(esk11_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(277,negated_conjecture,(host(esk6_0)=host(esk9_0)),inference(split_conjunct,[status(thm)],[267])).
% cnf(284,negated_conjecture,(setIn(esk6_0,alive)),inference(split_conjunct,[status(thm)],[267])).
% cnf(285,negated_conjecture,(epred1_4(esk6_0,esk7_0,esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[267])).
% fof(286, plain,![X13]:![X12]:![X3]:![X2]:(~(epred1_4(X2,X3,X12,X13))|((((((((![X4]:![X14]:(~(setIn(X14,alive))|~(elem(m_Down(X14),queue(host(X4)))))&![X4]:![X14]:(~(elem(m_Down(X14),queue(host(X4))))|~(setIn(X14,alive))))&![X4]:![X14]:(~(elem(m_Down(X14),queue(host(X4))))|~(host(X14)=host(X4))))&![X4]:![X14]:(~(elem(m_Halt(X14),queue(host(X4))))|~(leq(host(X4),host(X14)))))&![X4]:![X15]:![X14]:(~(elem(m_Ack(X14,X4),queue(host(X15))))|~(leq(host(X4),host(X14)))))&![X4]:![X14]:(((setIn(X4,alive)|~(leq(X14,X4)))|~(host(X14)=host(X4)))|~(setIn(X14,alive))))&![X4]:![X14]:((X14=X4|~(host(X14)=host(X4)))|(~(setIn(X4,alive))|~(setIn(X14,alive)))))&![X4]:![X16]:![X15]:![X14]:(((((host(X15)=host(X4)|~(setIn(X4,alive)))|~(setIn(X15,alive)))|~(host(X16)=host(X4)))|~(host(X14)=host(X15)))|(~(elem(m_Down(X14),queue(host(X4))))|~(elem(m_Down(X16),queue(host(X15)))))))&queue(host(X2))=cons(m_Ack(X13,X3),X12))),inference(fof_nnf,[status(thm)],[74])).
% fof(287, 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)],[286])).
% fof(288, 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)],[287])).
% fof(289, 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)],[288])).
% cnf(290,plain,(queue(host(X1))=cons(m_Ack(X4,X2),X3)|~epred1_4(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[289])).
% cnf(298,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)],[289])).
% cnf(304,negated_conjecture,(host(esk10_0)=host(esk6_0)),inference(rw,[status(thm)],[271,277,theory(equality)])).
% cnf(365,negated_conjecture,(m_Down(esk12_0)=m_Ldr(esk6_0)|elem(m_Down(esk12_0),esk4_0)),inference(spm,[status(thm)],[124,268,theory(equality)])).
% cnf(366,negated_conjecture,(elem(m_Down(esk12_0),esk4_0)),inference(sr,[status(thm)],[365,87,theory(equality)])).
% cnf(472,negated_conjecture,(cons(m_Ack(esk5_0,esk7_0),esk4_0)=queue(host(esk6_0))),inference(spm,[status(thm)],[290,285,theory(equality)])).
% cnf(528,negated_conjecture,(host(X1)=host(esk11_0)|host(X1)!=host(esk10_0)|host(X2)!=host(esk11_0)|~epred1_4(X3,X4,X5,X6)|~setIn(esk11_0,alive)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(spm,[status(thm)],[298,269,theory(equality)])).
% cnf(531,negated_conjecture,(host(X1)=host(esk11_0)|host(X1)!=host(esk6_0)|host(X2)!=host(esk11_0)|~epred1_4(X3,X4,X5,X6)|~setIn(esk11_0,alive)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(rw,[status(thm)],[528,304,theory(equality)])).
% cnf(532,negated_conjecture,(host(X1)=host(esk11_0)|host(X1)!=host(esk6_0)|host(X2)!=host(esk11_0)|~epred1_4(X3,X4,X5,X6)|$false|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(rw,[status(thm)],[531,272,theory(equality)])).
% cnf(533,negated_conjecture,(host(X1)=host(esk11_0)|host(X1)!=host(esk6_0)|host(X2)!=host(esk11_0)|~epred1_4(X3,X4,X5,X6)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(cn,[status(thm)],[532,theory(equality)])).
% cnf(1098,negated_conjecture,(elem(X1,queue(host(esk6_0)))|~elem(X1,esk4_0)),inference(spm,[status(thm)],[116,472,theory(equality)])).
% cnf(3599,negated_conjecture,(host(esk6_0)=host(esk11_0)|host(X1)!=host(esk11_0)|~epred1_4(X2,X3,X4,X5)|~setIn(esk6_0,alive)|~elem(m_Down(X1),esk4_0)),inference(spm,[status(thm)],[533,1098,theory(equality)])).
% cnf(3602,negated_conjecture,(host(esk6_0)=host(esk11_0)|host(X1)!=host(esk11_0)|~epred1_4(X2,X3,X4,X5)|$false|~elem(m_Down(X1),esk4_0)),inference(rw,[status(thm)],[3599,284,theory(equality)])).
% cnf(3603,negated_conjecture,(host(esk6_0)=host(esk11_0)|host(X1)!=host(esk11_0)|~epred1_4(X2,X3,X4,X5)|~elem(m_Down(X1),esk4_0)),inference(cn,[status(thm)],[3602,theory(equality)])).
% cnf(3604,negated_conjecture,(host(X1)!=host(esk11_0)|~epred1_4(X2,X3,X4,X5)|~elem(m_Down(X1),esk4_0)),inference(sr,[status(thm)],[3603,275,theory(equality)])).
% fof(3605, plain,(~(epred11_0)<=>![X1]:(~(host(X1)=host(esk11_0))|~(elem(m_Down(X1),esk4_0)))),introduced(definition),['split']).
% cnf(3606,plain,(epred11_0|~elem(m_Down(X1),esk4_0)|host(X1)!=host(esk11_0)),inference(split_equiv,[status(thm)],[3605])).
% fof(3607, plain,(~(epred12_0)<=>![X3]:![X5]:![X4]:![X2]:~(epred1_4(X2,X3,X4,X5))),introduced(definition),['split']).
% cnf(3608,plain,(epred12_0|~epred1_4(X2,X3,X4,X5)),inference(split_equiv,[status(thm)],[3607])).
% cnf(3609,negated_conjecture,(~epred12_0|~epred11_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[3604,3605,theory(equality)]),3607,theory(equality)]),['split']).
% cnf(3610,negated_conjecture,(epred12_0),inference(spm,[status(thm)],[3608,285,theory(equality)])).
% cnf(3611,negated_conjecture,($false|~epred11_0),inference(rw,[status(thm)],[3609,3610,theory(equality)])).
% cnf(3612,negated_conjecture,(~epred11_0),inference(cn,[status(thm)],[3611,theory(equality)])).
% cnf(3632,negated_conjecture,(~elem(m_Down(X1),esk4_0)|host(X1)!=host(esk11_0)),inference(sr,[status(thm)],[3606,3612,theory(equality)])).
% cnf(3633,negated_conjecture,(host(esk12_0)!=host(esk11_0)),inference(spm,[status(thm)],[3632,366,theory(equality)])).
% cnf(3634,negated_conjecture,($false),inference(rw,[status(thm)],[3633,270,theory(equality)])).
% cnf(3635,negated_conjecture,($false),inference(cn,[status(thm)],[3634,theory(equality)])).
% cnf(3636,negated_conjecture,($false),3635,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 667
% # ...of these trivial : 14
% # ...subsumed : 281
% # ...remaining for further processing: 372
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 21
% # Generated clauses : 2564
% # ...of the previous two non-trivial : 2166
% # Contextual simplify-reflections : 44
% # Paramodulations : 2496
% # Factorizations : 22
% # Equation resolutions : 29
% # Current number of processed clauses: 334
% # Positive orientable unit clauses: 56
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 52
% # Non-unit-clauses : 226
% # Current number of unprocessed clauses: 1441
% # ...number of literals in the above : 5040
% # Clause-clause subsumption calls (NU) : 4220
% # Rec. Clause-clause subsumption calls : 2897
% # Unit Clause-clause subsumption calls : 345
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 307 leaves, 1.44+/-1.042 terms/leaf
% # Paramod-from index: 104 leaves, 1.18+/-0.617 terms/leaf
% # Paramod-into index: 268 leaves, 1.37+/-0.916 terms/leaf
% # -------------------------------------------------
% # User time : 0.120 s
% # System time : 0.003 s
% # Total time : 0.123 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.34 WC
% FINAL PrfWatch: 0.25 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP24647/SWV449+1.tptp
%
%------------------------------------------------------------------------------