TSTP Solution File: SWV454+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWV454+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 09:00:27 EST 2010

% Result   : Theorem 11.15s
% Output   : Solution 11.15s
% 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/SystemOnTPTP25201/SWV454+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP25201/SWV454+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25201/SWV454+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 25297
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.03 WC
% PrfWatch: 3.93 CPU 4.03 WC
% PrfWatch: 5.54 CPU 6.04 WC
% # Preprocessing time     : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.16 CPU 8.04 WC
% PrfWatch: 9.15 CPU 10.05 WC
% # SZS output start CNFRefutation.
% fof(16, axiom,![X3]:![X4]:![X2]:(elem(X3,cons(X4,X2))<=>(X3=X4|elem(X3,X2))),file('/tmp/SRASS.s.p', axiom_46)).
% fof(67, conjecture,![X12]:![X13]:![X3]:![X4]:(((((((((![X5]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X5)))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(setIn(X14,alive))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(host(X14)=host(X5))))&![X5]:![X14]:(elem(m_Halt(X14),queue(host(X5)))=>~(leq(host(X5),host(X14)))))&![X5]:![X15]:![X14]:(elem(m_Ack(X14,X5),queue(host(X15)))=>~(leq(host(X5),host(X14)))))&![X5]:![X14]:(((~(setIn(X5,alive))&leq(X14,X5))&host(X14)=host(X5))=>~(setIn(X14,alive))))&![X5]:![X14]:((~(X14=X5)&host(X14)=host(X5))=>(~(setIn(X5,alive))|~(setIn(X14,alive)))))&![X5]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X5))&setIn(X5,alive))&setIn(X15,alive))&host(X16)=host(X5))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X5)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X3))=cons(m_Down(X4),X12))=>(setIn(X3,alive)=>(~(leq(host(X3),host(X4)))=>(~(((index(ldr,host(X3))=host(X4)&index(status,host(X3))=norm)|(index(status,host(X3))=wait&host(X4)=host(index(elid,host(X3))))))=>((![X5]:((~(leq(host(X3),X5))&leq(s(zero),X5))=>(setIn(X5,index(down,host(X3)))|X5=host(X4)))&index(status,host(X3))=elec_1)=>(~(leq(nbr_proc,host(X3)))=>![X5]:(~(s(host(X3))=host(X5))=>(host(X3)=host(X5)=>![X17]:![X18]:(~(s(host(X3))=host(X18))=>(~(host(X3)=host(X18))=>![X19]:(((((~(host(X18)=host(X5))&setIn(X5,alive))&setIn(X18,alive))&host(X17)=host(X5))&host(X19)=host(X18))=>~((elem(m_Down(X19),X12)&elem(m_Down(X17),queue(host(X18)))))))))))))))),file('/tmp/SRASS.s.p', conj)).
% fof(68, negated_conjecture,~(![X12]:![X13]:![X3]:![X4]:(((((((((![X5]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X5)))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(setIn(X14,alive))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(host(X14)=host(X5))))&![X5]:![X14]:(elem(m_Halt(X14),queue(host(X5)))=>~(leq(host(X5),host(X14)))))&![X5]:![X15]:![X14]:(elem(m_Ack(X14,X5),queue(host(X15)))=>~(leq(host(X5),host(X14)))))&![X5]:![X14]:(((~(setIn(X5,alive))&leq(X14,X5))&host(X14)=host(X5))=>~(setIn(X14,alive))))&![X5]:![X14]:((~(X14=X5)&host(X14)=host(X5))=>(~(setIn(X5,alive))|~(setIn(X14,alive)))))&![X5]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X5))&setIn(X5,alive))&setIn(X15,alive))&host(X16)=host(X5))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X5)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X3))=cons(m_Down(X4),X12))=>(setIn(X3,alive)=>(~(leq(host(X3),host(X4)))=>(~(((index(ldr,host(X3))=host(X4)&index(status,host(X3))=norm)|(index(status,host(X3))=wait&host(X4)=host(index(elid,host(X3))))))=>((![X5]:((~(leq(host(X3),X5))&leq(s(zero),X5))=>(setIn(X5,index(down,host(X3)))|X5=host(X4)))&index(status,host(X3))=elec_1)=>(~(leq(nbr_proc,host(X3)))=>![X5]:(~(s(host(X3))=host(X5))=>(host(X3)=host(X5)=>![X17]:![X18]:(~(s(host(X3))=host(X18))=>(~(host(X3)=host(X18))=>![X19]:(((((~(host(X18)=host(X5))&setIn(X5,alive))&setIn(X18,alive))&host(X17)=host(X5))&host(X19)=host(X18))=>~((elem(m_Down(X19),X12)&elem(m_Down(X17),queue(host(X18))))))))))))))))),inference(assume_negation,[status(cth)],[67])).
% fof(73, negated_conjecture,~(![X12]:![X13]:![X3]:![X4]:(((((((((![X5]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X5)))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(setIn(X14,alive))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(host(X14)=host(X5))))&![X5]:![X14]:(elem(m_Halt(X14),queue(host(X5)))=>~(leq(host(X5),host(X14)))))&![X5]:![X15]:![X14]:(elem(m_Ack(X14,X5),queue(host(X15)))=>~(leq(host(X5),host(X14)))))&![X5]:![X14]:(((~(setIn(X5,alive))&leq(X14,X5))&host(X14)=host(X5))=>~(setIn(X14,alive))))&![X5]:![X14]:((~(X14=X5)&host(X14)=host(X5))=>(~(setIn(X5,alive))|~(setIn(X14,alive)))))&![X5]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X5))&setIn(X5,alive))&setIn(X15,alive))&host(X16)=host(X5))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X5)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X3))=cons(m_Down(X4),X12))=>(setIn(X3,alive)=>(~(leq(host(X3),host(X4)))=>(~(((index(ldr,host(X3))=host(X4)&index(status,host(X3))=norm)|(index(status,host(X3))=wait&host(X4)=host(index(elid,host(X3))))))=>((![X5]:((~(leq(host(X3),X5))&leq(s(zero),X5))=>(setIn(X5,index(down,host(X3)))|X5=host(X4)))&index(status,host(X3))=elec_1)=>(~(leq(nbr_proc,host(X3)))=>![X5]:(~(s(host(X3))=host(X5))=>(host(X3)=host(X5)=>![X17]:![X18]:(~(s(host(X3))=host(X18))=>(~(host(X3)=host(X18))=>![X19]:(((((~(host(X18)=host(X5))&setIn(X5,alive))&setIn(X18,alive))&host(X17)=host(X5))&host(X19)=host(X18))=>~((elem(m_Down(X19),X12)&elem(m_Down(X17),queue(host(X18))))))))))))))))),inference(fof_simplification,[status(thm)],[68,theory(equality)])).
% fof(74, plain,![X12]:![X4]:![X3]:(epred1_3(X3,X4,X12)=>((((((((![X5]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X5)))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(setIn(X14,alive))))&![X5]:![X14]:(elem(m_Down(X14),queue(host(X5)))=>~(host(X14)=host(X5))))&![X5]:![X14]:(elem(m_Halt(X14),queue(host(X5)))=>~(leq(host(X5),host(X14)))))&![X5]:![X15]:![X14]:(elem(m_Ack(X14,X5),queue(host(X15)))=>~(leq(host(X5),host(X14)))))&![X5]:![X14]:(((~(setIn(X5,alive))&leq(X14,X5))&host(X14)=host(X5))=>~(setIn(X14,alive))))&![X5]:![X14]:((~(X14=X5)&host(X14)=host(X5))=>(~(setIn(X5,alive))|~(setIn(X14,alive)))))&![X5]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X5))&setIn(X5,alive))&setIn(X15,alive))&host(X16)=host(X5))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X5)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X3))=cons(m_Down(X4),X12))),introduced(definition)).
% fof(75, negated_conjecture,~(![X12]:![X13]:![X3]:![X4]:(epred1_3(X3,X4,X12)=>(setIn(X3,alive)=>(~(leq(host(X3),host(X4)))=>(~(((index(ldr,host(X3))=host(X4)&index(status,host(X3))=norm)|(index(status,host(X3))=wait&host(X4)=host(index(elid,host(X3))))))=>((![X5]:((~(leq(host(X3),X5))&leq(s(zero),X5))=>(setIn(X5,index(down,host(X3)))|X5=host(X4)))&index(status,host(X3))=elec_1)=>(~(leq(nbr_proc,host(X3)))=>![X5]:(~(s(host(X3))=host(X5))=>(host(X3)=host(X5)=>![X17]:![X18]:(~(s(host(X3))=host(X18))=>(~(host(X3)=host(X18))=>![X19]:(((((~(host(X18)=host(X5))&setIn(X5,alive))&setIn(X18,alive))&host(X17)=host(X5))&host(X19)=host(X18))=>~((elem(m_Down(X19),X12)&elem(m_Down(X17),queue(host(X18))))))))))))))))),inference(apply_def,[status(esa)],[73,74,theory(equality)])).
% fof(110, plain,![X3]:![X4]:![X2]:((~(elem(X3,cons(X4,X2)))|(X3=X4|elem(X3,X2)))&((~(X3=X4)&~(elem(X3,X2)))|elem(X3,cons(X4,X2)))),inference(fof_nnf,[status(thm)],[16])).
% fof(111, 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)],[110])).
% fof(112, 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)],[111])).
% cnf(113,plain,(elem(X1,cons(X2,X3))|~elem(X1,X3)),inference(split_conjunct,[status(thm)],[112])).
% fof(265, negated_conjecture,?[X12]:?[X13]:?[X3]:?[X4]:(epred1_3(X3,X4,X12)&(setIn(X3,alive)&(~(leq(host(X3),host(X4)))&(((~(index(ldr,host(X3))=host(X4))|~(index(status,host(X3))=norm))&(~(index(status,host(X3))=wait)|~(host(X4)=host(index(elid,host(X3))))))&((![X5]:((leq(host(X3),X5)|~(leq(s(zero),X5)))|(setIn(X5,index(down,host(X3)))|X5=host(X4)))&index(status,host(X3))=elec_1)&(~(leq(nbr_proc,host(X3)))&?[X5]:(~(s(host(X3))=host(X5))&(host(X3)=host(X5)&?[X17]:?[X18]:(~(s(host(X3))=host(X18))&(~(host(X3)=host(X18))&?[X19]:(((((~(host(X18)=host(X5))&setIn(X5,alive))&setIn(X18,alive))&host(X17)=host(X5))&host(X19)=host(X18))&(elem(m_Down(X19),X12)&elem(m_Down(X17),queue(host(X18))))))))))))))),inference(fof_nnf,[status(thm)],[75])).
% fof(266, 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)&(~(leq(nbr_proc,host(X22)))&?[X25]:(~(s(host(X22))=host(X25))&(host(X22)=host(X25)&?[X26]:?[X27]:(~(s(host(X22))=host(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(X28),X20)&elem(m_Down(X26),queue(host(X27))))))))))))))),inference(variable_rename,[status(thm)],[265])).
% fof(267, negated_conjecture,(epred1_3(esk6_0,esk7_0,esk4_0)&(setIn(esk6_0,alive)&(~(leq(host(esk6_0),host(esk7_0)))&(((~(index(ldr,host(esk6_0))=host(esk7_0))|~(index(status,host(esk6_0))=norm))&(~(index(status,host(esk6_0))=wait)|~(host(esk7_0)=host(index(elid,host(esk6_0))))))&((![X24]:((leq(host(esk6_0),X24)|~(leq(s(zero),X24)))|(setIn(X24,index(down,host(esk6_0)))|X24=host(esk7_0)))&index(status,host(esk6_0))=elec_1)&(~(leq(nbr_proc,host(esk6_0)))&(~(s(host(esk6_0))=host(esk8_0))&(host(esk6_0)=host(esk8_0)&(~(s(host(esk6_0))=host(esk10_0))&(~(host(esk6_0)=host(esk10_0))&(((((~(host(esk10_0)=host(esk8_0))&setIn(esk8_0,alive))&setIn(esk10_0,alive))&host(esk9_0)=host(esk8_0))&host(esk11_0)=host(esk10_0))&(elem(m_Down(esk11_0),esk4_0)&elem(m_Down(esk9_0),queue(host(esk10_0))))))))))))))),inference(skolemize,[status(esa)],[266])).
% fof(268, negated_conjecture,![X24]:((((((((leq(host(esk6_0),X24)|~(leq(s(zero),X24)))|(setIn(X24,index(down,host(esk6_0)))|X24=host(esk7_0)))&index(status,host(esk6_0))=elec_1)&(~(leq(nbr_proc,host(esk6_0)))&(~(s(host(esk6_0))=host(esk8_0))&(host(esk6_0)=host(esk8_0)&(~(s(host(esk6_0))=host(esk10_0))&(~(host(esk6_0)=host(esk10_0))&(((((~(host(esk10_0)=host(esk8_0))&setIn(esk8_0,alive))&setIn(esk10_0,alive))&host(esk9_0)=host(esk8_0))&host(esk11_0)=host(esk10_0))&(elem(m_Down(esk11_0),esk4_0)&elem(m_Down(esk9_0),queue(host(esk10_0)))))))))))&((~(index(ldr,host(esk6_0))=host(esk7_0))|~(index(status,host(esk6_0))=norm))&(~(index(status,host(esk6_0))=wait)|~(host(esk7_0)=host(index(elid,host(esk6_0)))))))&~(leq(host(esk6_0),host(esk7_0))))&setIn(esk6_0,alive))&epred1_3(esk6_0,esk7_0,esk4_0)),inference(shift_quantors,[status(thm)],[267])).
% cnf(269,negated_conjecture,(epred1_3(esk6_0,esk7_0,esk4_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(270,negated_conjecture,(setIn(esk6_0,alive)),inference(split_conjunct,[status(thm)],[268])).
% cnf(274,negated_conjecture,(elem(m_Down(esk9_0),queue(host(esk10_0)))),inference(split_conjunct,[status(thm)],[268])).
% cnf(275,negated_conjecture,(elem(m_Down(esk11_0),esk4_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(276,negated_conjecture,(host(esk11_0)=host(esk10_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(277,negated_conjecture,(host(esk9_0)=host(esk8_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(278,negated_conjecture,(setIn(esk10_0,alive)),inference(split_conjunct,[status(thm)],[268])).
% cnf(281,negated_conjecture,(host(esk6_0)!=host(esk10_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(283,negated_conjecture,(host(esk6_0)=host(esk8_0)),inference(split_conjunct,[status(thm)],[268])).
% fof(288, plain,![X12]:![X4]:![X3]:(~(epred1_3(X3,X4,X12))|((((((((![X5]:![X14]:(~(setIn(X14,alive))|~(elem(m_Down(X14),queue(host(X5)))))&![X5]:![X14]:(~(elem(m_Down(X14),queue(host(X5))))|~(setIn(X14,alive))))&![X5]:![X14]:(~(elem(m_Down(X14),queue(host(X5))))|~(host(X14)=host(X5))))&![X5]:![X14]:(~(elem(m_Halt(X14),queue(host(X5))))|~(leq(host(X5),host(X14)))))&![X5]:![X15]:![X14]:(~(elem(m_Ack(X14,X5),queue(host(X15))))|~(leq(host(X5),host(X14)))))&![X5]:![X14]:(((setIn(X5,alive)|~(leq(X14,X5)))|~(host(X14)=host(X5)))|~(setIn(X14,alive))))&![X5]:![X14]:((X14=X5|~(host(X14)=host(X5)))|(~(setIn(X5,alive))|~(setIn(X14,alive)))))&![X5]:![X16]:![X15]:![X14]:(((((host(X15)=host(X5)|~(setIn(X5,alive)))|~(setIn(X15,alive)))|~(host(X16)=host(X5)))|~(host(X14)=host(X15)))|(~(elem(m_Down(X14),queue(host(X5))))|~(elem(m_Down(X16),queue(host(X15)))))))&queue(host(X3))=cons(m_Down(X4),X12))),inference(fof_nnf,[status(thm)],[74])).
% fof(289, 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)],[288])).
% fof(290, 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)],[289])).
% fof(291, 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)],[290])).
% cnf(292,plain,(queue(host(X1))=cons(m_Down(X2),X3)|~epred1_3(X1,X2,X3)),inference(split_conjunct,[status(thm)],[291])).
% cnf(300,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)],[291])).
% cnf(304,negated_conjecture,(host(esk9_0)=host(esk6_0)),inference(rw,[status(thm)],[277,283,theory(equality)])).
% cnf(418,negated_conjecture,(cons(m_Down(esk7_0),esk4_0)=queue(host(esk6_0))),inference(spm,[status(thm)],[292,269,theory(equality)])).
% cnf(629,plain,(host(X1)=host(esk6_0)|host(X1)!=host(X2)|host(X3)!=host(esk6_0)|~epred1_3(X4,X5,X6)|~setIn(esk6_0,alive)|~setIn(X1,alive)|~elem(m_Down(X2),cons(m_Down(esk7_0),esk4_0))|~elem(m_Down(X3),queue(host(X1)))),inference(spm,[status(thm)],[300,418,theory(equality)])).
% cnf(630,plain,(host(X1)=host(esk6_0)|host(X1)!=host(X2)|host(X3)!=host(esk6_0)|~epred1_3(X4,X5,X6)|$false|~setIn(X1,alive)|~elem(m_Down(X2),cons(m_Down(esk7_0),esk4_0))|~elem(m_Down(X3),queue(host(X1)))),inference(rw,[status(thm)],[629,270,theory(equality)])).
% cnf(631,plain,(host(X1)=host(esk6_0)|host(X1)!=host(X2)|host(X3)!=host(esk6_0)|~epred1_3(X4,X5,X6)|~setIn(X1,alive)|~elem(m_Down(X2),cons(m_Down(esk7_0),esk4_0))|~elem(m_Down(X3),queue(host(X1)))),inference(cn,[status(thm)],[630,theory(equality)])).
% cnf(5118,plain,(host(X1)=host(esk6_0)|host(X2)!=host(esk6_0)|host(X1)!=host(X3)|~epred1_3(X4,X5,X6)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))|~elem(m_Down(X3),esk4_0)),inference(spm,[status(thm)],[631,113,theory(equality)])).
% cnf(292218,negated_conjecture,(host(esk10_0)=host(esk6_0)|host(esk9_0)!=host(esk6_0)|host(esk10_0)!=host(X1)|~epred1_3(X2,X3,X4)|~setIn(esk10_0,alive)|~elem(m_Down(X1),esk4_0)),inference(spm,[status(thm)],[5118,274,theory(equality)])).
% cnf(292220,negated_conjecture,(host(esk10_0)=host(esk6_0)|$false|host(esk10_0)!=host(X1)|~epred1_3(X2,X3,X4)|~setIn(esk10_0,alive)|~elem(m_Down(X1),esk4_0)),inference(rw,[status(thm)],[292218,304,theory(equality)])).
% cnf(292221,negated_conjecture,(host(esk10_0)=host(esk6_0)|$false|host(esk10_0)!=host(X1)|~epred1_3(X2,X3,X4)|$false|~elem(m_Down(X1),esk4_0)),inference(rw,[status(thm)],[292220,278,theory(equality)])).
% cnf(292222,negated_conjecture,(host(esk10_0)=host(esk6_0)|host(esk10_0)!=host(X1)|~epred1_3(X2,X3,X4)|~elem(m_Down(X1),esk4_0)),inference(cn,[status(thm)],[292221,theory(equality)])).
% cnf(292223,negated_conjecture,(host(esk10_0)!=host(X1)|~epred1_3(X2,X3,X4)|~elem(m_Down(X1),esk4_0)),inference(sr,[status(thm)],[292222,281,theory(equality)])).
% fof(292225, plain,(~(epred13_0)<=>![X1]:(~(host(esk10_0)=host(X1))|~(elem(m_Down(X1),esk4_0)))),introduced(definition),['split']).
% cnf(292226,plain,(epred13_0|~elem(m_Down(X1),esk4_0)|host(esk10_0)!=host(X1)),inference(split_equiv,[status(thm)],[292225])).
% fof(292227, plain,(~(epred14_0)<=>![X4]:![X3]:![X2]:~(epred1_3(X2,X3,X4))),introduced(definition),['split']).
% cnf(292228,plain,(epred14_0|~epred1_3(X2,X3,X4)),inference(split_equiv,[status(thm)],[292227])).
% cnf(292229,negated_conjecture,(~epred14_0|~epred13_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[292223,292225,theory(equality)]),292227,theory(equality)]),['split']).
% cnf(292230,negated_conjecture,(epred14_0),inference(spm,[status(thm)],[292228,269,theory(equality)])).
% cnf(292231,negated_conjecture,($false|~epred13_0),inference(rw,[status(thm)],[292229,292230,theory(equality)])).
% cnf(292232,negated_conjecture,(~epred13_0),inference(cn,[status(thm)],[292231,theory(equality)])).
% cnf(292234,negated_conjecture,(~elem(m_Down(X1),esk4_0)|host(esk10_0)!=host(X1)),inference(sr,[status(thm)],[292226,292232,theory(equality)])).
% cnf(292238,negated_conjecture,(host(esk10_0)!=host(esk11_0)),inference(spm,[status(thm)],[292234,275,theory(equality)])).
% cnf(292239,negated_conjecture,($false),inference(rw,[status(thm)],[292238,276,theory(equality)])).
% cnf(292240,negated_conjecture,($false),inference(cn,[status(thm)],[292239,theory(equality)])).
% cnf(292241,negated_conjecture,($false),292240,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 9559
% # ...of these trivial                : 193
% # ...subsumed                        : 7246
% # ...remaining for further processing: 2120
% # Other redundant clauses eliminated : 61
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 66
% # Backward-rewritten                 : 20
% # Generated clauses                  : 224457
% # ...of the previous two non-trivial : 178055
% # Contextual simplify-reflections    : 1908
% # Paramodulations                    : 224068
% # Factorizations                     : 191
% # Equation resolutions               : 178
% # Current number of processed clauses: 2023
% #    Positive orientable unit clauses: 103
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 125
% #    Non-unit-clauses                : 1795
% # Current number of unprocessed clauses: 156740
% # ...number of literals in the above : 604557
% # Clause-clause subsumption calls (NU) : 359085
% # Rec. Clause-clause subsumption calls : 299907
% # Unit Clause-clause subsumption calls : 2081
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 438
% # Indexed BW rewrite successes       : 10
% # Backwards rewriting index:   615 leaves,   2.53+/-3.925 terms/leaf
% # Paramod-from index:          213 leaves,   2.04+/-3.278 terms/leaf
% # Paramod-into index:          525 leaves,   2.35+/-3.796 terms/leaf
% # -------------------------------------------------
% # User time              : 6.718 s
% # System time            : 0.227 s
% # Total time             : 6.945 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.18 CPU 11.08 WC
% FINAL PrfWatch: 10.18 CPU 11.08 WC
% SZS output end Solution for /tmp/SystemOnTPTP25201/SWV454+1.tptp
% 
%------------------------------------------------------------------------------