TSTP Solution File: SWV455+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV455+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 : art05.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:41 EST 2010
% Result : Theorem 23.53s
% Output : Solution 23.53s
% 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/SystemOnTPTP4945/SWV455+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4945/SWV455+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4945/SWV455+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 5041
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.04 WC
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.89 CPU 10.05 WC
% PrfWatch: 11.89 CPU 12.05 WC
% PrfWatch: 13.87 CPU 14.06 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 15.48 CPU 16.06 WC
% PrfWatch: 17.13 CPU 18.07 WC
% PrfWatch: 19.11 CPU 20.07 WC
% PrfWatch: 21.11 CPU 22.08 WC
% # SZS output start CNFRefutation.
% fof(14, 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))=>![X5]:(~(host(X3)=host(X5))=>![X17]:![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(X17),X12)&elem(m_Down(X19),queue(host(X5))))))))))))),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))=>![X5]:(~(host(X3)=host(X5))=>![X17]:![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(X17),X12)&elem(m_Down(X19),queue(host(X5)))))))))))))),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))=>![X5]:(~(host(X3)=host(X5))=>![X17]:![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(X17),X12)&elem(m_Down(X19),queue(host(X5)))))))))))))),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))=>![X5]:(~(host(X3)=host(X5))=>![X17]:![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(X17),X12)&elem(m_Down(X19),queue(host(X5)))))))))))))),inference(apply_def,[status(esa)],[73,74,theory(equality)])).
% fof(107, 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)],[14])).
% fof(108, 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)],[107])).
% fof(109, 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)],[108])).
% cnf(110,plain,(elem(X1,cons(X2,X3))|~elem(X1,X3)),inference(split_conjunct,[status(thm)],[109])).
% 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))&?[X5]:(~(host(X3)=host(X5))&?[X17]:?[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(X17),X12)&elem(m_Down(X19),queue(host(X5)))))))))))),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))&?[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)],[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))))))&((((~(leq(host(esk6_0),esk8_0))&leq(s(zero),esk8_0))&(~(setIn(esk8_0,index(down,host(esk6_0))))&~(esk8_0=host(esk7_0))))|~(index(status,host(esk6_0))=elec_1))&(~(host(esk6_0)=host(esk9_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),esk4_0)&elem(m_Down(esk12_0),queue(host(esk9_0)))))))))))),inference(skolemize,[status(esa)],[266])).
% fof(268, 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))))))&((((~(leq(host(esk6_0),esk8_0))|~(index(status,host(esk6_0))=elec_1))&(leq(s(zero),esk8_0)|~(index(status,host(esk6_0))=elec_1)))&((~(setIn(esk8_0,index(down,host(esk6_0))))|~(index(status,host(esk6_0))=elec_1))&(~(esk8_0=host(esk7_0))|~(index(status,host(esk6_0))=elec_1))))&(~(host(esk6_0)=host(esk9_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),esk4_0)&elem(m_Down(esk12_0),queue(host(esk9_0)))))))))))),inference(distribute,[status(thm)],[267])).
% cnf(269,negated_conjecture,(elem(m_Down(esk12_0),queue(host(esk9_0)))),inference(split_conjunct,[status(thm)],[268])).
% cnf(270,negated_conjecture,(elem(m_Down(esk10_0),esk4_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(271,negated_conjecture,(host(esk12_0)=host(esk11_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(272,negated_conjecture,(host(esk10_0)=host(esk9_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(274,negated_conjecture,(setIn(esk9_0,alive)),inference(split_conjunct,[status(thm)],[268])).
% cnf(276,negated_conjecture,(host(esk6_0)=host(esk11_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(277,negated_conjecture,(host(esk6_0)!=host(esk9_0)),inference(split_conjunct,[status(thm)],[268])).
% cnf(285,negated_conjecture,(setIn(esk6_0,alive)),inference(split_conjunct,[status(thm)],[268])).
% cnf(286,negated_conjecture,(epred1_3(esk6_0,esk7_0,esk4_0)),inference(split_conjunct,[status(thm)],[268])).
% fof(287, 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(288, 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)],[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]:((((((((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)],[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))))))|~(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)],[289])).
% cnf(291,plain,(queue(host(X1))=cons(m_Down(X2),X3)|~epred1_3(X1,X2,X3)),inference(split_conjunct,[status(thm)],[290])).
% cnf(299,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)],[290])).
% cnf(302,negated_conjecture,(host(esk12_0)=host(esk6_0)),inference(rw,[status(thm)],[271,276,theory(equality)])).
% cnf(424,negated_conjecture,(cons(m_Down(esk7_0),esk4_0)=queue(host(esk6_0))),inference(spm,[status(thm)],[291,286,theory(equality)])).
% cnf(616,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)],[299,424,theory(equality)])).
% cnf(617,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)],[616,285,theory(equality)])).
% cnf(618,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)],[617,theory(equality)])).
% cnf(5951,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)],[618,110,theory(equality)])).
% cnf(620391,negated_conjecture,(host(esk9_0)=host(esk6_0)|host(esk12_0)!=host(esk6_0)|host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|~setIn(esk9_0,alive)|~elem(m_Down(X1),esk4_0)),inference(spm,[status(thm)],[5951,269,theory(equality)])).
% cnf(620393,negated_conjecture,(host(esk9_0)=host(esk6_0)|$false|host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|~setIn(esk9_0,alive)|~elem(m_Down(X1),esk4_0)),inference(rw,[status(thm)],[620391,302,theory(equality)])).
% cnf(620394,negated_conjecture,(host(esk9_0)=host(esk6_0)|$false|host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|$false|~elem(m_Down(X1),esk4_0)),inference(rw,[status(thm)],[620393,274,theory(equality)])).
% cnf(620395,negated_conjecture,(host(esk9_0)=host(esk6_0)|host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|~elem(m_Down(X1),esk4_0)),inference(cn,[status(thm)],[620394,theory(equality)])).
% cnf(620396,negated_conjecture,(host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|~elem(m_Down(X1),esk4_0)),inference(sr,[status(thm)],[620395,277,theory(equality)])).
% fof(620397, plain,(~(epred15_0)<=>![X1]:(~(host(esk9_0)=host(X1))|~(elem(m_Down(X1),esk4_0)))),introduced(definition),['split']).
% cnf(620398,plain,(epred15_0|~elem(m_Down(X1),esk4_0)|host(esk9_0)!=host(X1)),inference(split_equiv,[status(thm)],[620397])).
% fof(620399, plain,(~(epred16_0)<=>![X4]:![X3]:![X2]:~(epred1_3(X2,X3,X4))),introduced(definition),['split']).
% cnf(620400,plain,(epred16_0|~epred1_3(X2,X3,X4)),inference(split_equiv,[status(thm)],[620399])).
% cnf(620401,negated_conjecture,(~epred16_0|~epred15_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[620396,620397,theory(equality)]),620399,theory(equality)]),['split']).
% cnf(620402,negated_conjecture,(epred16_0),inference(spm,[status(thm)],[620400,286,theory(equality)])).
% cnf(620404,negated_conjecture,($false|~epred15_0),inference(rw,[status(thm)],[620401,620402,theory(equality)])).
% cnf(620405,negated_conjecture,(~epred15_0),inference(cn,[status(thm)],[620404,theory(equality)])).
% cnf(620425,negated_conjecture,(~elem(m_Down(X1),esk4_0)|host(esk9_0)!=host(X1)),inference(sr,[status(thm)],[620398,620405,theory(equality)])).
% cnf(620429,negated_conjecture,(host(esk9_0)!=host(esk10_0)),inference(spm,[status(thm)],[620425,270,theory(equality)])).
% cnf(620430,negated_conjecture,($false),inference(rw,[status(thm)],[620429,272,theory(equality)])).
% cnf(620431,negated_conjecture,($false),inference(cn,[status(thm)],[620430,theory(equality)])).
% cnf(620432,negated_conjecture,($false),620431,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 14265
% # ...of these trivial : 282
% # ...subsumed : 10955
% # ...remaining for further processing: 3028
% # Other redundant clauses eliminated : 96
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 136
% # Backward-rewritten : 20
% # Generated clauses : 510294
% # ...of the previous two non-trivial : 436175
% # Contextual simplify-reflections : 2476
% # Paramodulations : 509685
% # Factorizations : 330
% # Equation resolutions : 256
% # Current number of processed clauses: 2860
% # Positive orientable unit clauses: 125
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 137
% # Non-unit-clauses : 2598
% # Current number of unprocessed clauses: 371571
% # ...number of literals in the above : 1532030
% # Clause-clause subsumption calls (NU) : 757062
% # Rec. Clause-clause subsumption calls : 599746
% # Unit Clause-clause subsumption calls : 6983
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 728
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 684 leaves, 2.61+/-4.527 terms/leaf
% # Paramod-from index: 244 leaves, 2.23+/-3.886 terms/leaf
% # Paramod-into index: 583 leaves, 2.47+/-4.520 terms/leaf
% # -------------------------------------------------
% # User time : 14.848 s
% # System time : 0.486 s
% # Total time : 15.334 s
% # Maximum resident set size: 0 pages
% PrfWatch: 22.53 CPU 23.50 WC
% FINAL PrfWatch: 22.53 CPU 23.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP4945/SWV455+1.tptp
%
%------------------------------------------------------------------------------