TSTP Solution File: SWV451+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV451+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:49 EST 2010
% Result : Theorem 5.83s
% Output : Solution 5.83s
% 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/SystemOnTPTP24906/SWV451+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24906/SWV451+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24906/SWV451+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 25002
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.51 CPU 4.01 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X3]:![X4]:(s(host(X3))=host(X4)=>~(host(X3)=host(X4))),file('/tmp/SRASS.s.p', axiom_01)).
% fof(10, axiom,![X5]:![X6]:~(m_Down(X5)=m_Halt(X6)),file('/tmp/SRASS.s.p', axiom_17)).
% fof(19, axiom,![X5]:![X6]:![X4]:(elem(X5,cons(X6,X4))<=>(X5=X6|elem(X5,X4))),file('/tmp/SRASS.s.p', axiom_46)).
% fof(20, axiom,![X5]:![X6]:![X4]:(elem(X5,snoc(X4,X6))<=>(X5=X6|elem(X5,X4))),file('/tmp/SRASS.s.p', axiom_47)).
% fof(67, conjecture,![X12]:![X13]:![X5]:![X6]:(((((((((![X7]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X7)))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(setIn(X14,alive))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(host(X14)=host(X7))))&![X7]:![X14]:(elem(m_Halt(X14),queue(host(X7)))=>~(leq(host(X7),host(X14)))))&![X7]:![X15]:![X14]:(elem(m_Ack(X14,X7),queue(host(X15)))=>~(leq(host(X7),host(X14)))))&![X7]:![X14]:(((~(setIn(X7,alive))&leq(X14,X7))&host(X14)=host(X7))=>~(setIn(X14,alive))))&![X7]:![X14]:((~(X14=X7)&host(X14)=host(X7))=>(~(setIn(X7,alive))|~(setIn(X14,alive)))))&![X7]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X7))&setIn(X7,alive))&setIn(X15,alive))&host(X16)=host(X7))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X7)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X6))=cons(m_NotNorm(X5),X12))=>(setIn(X6,alive)=>(((index(ldr,host(X6))=host(X6)&index(status,host(X6))=norm)&index(elid,host(X6))=X5)=>(((![X7]:(host(X6)=host(X7)=>leq(X7,X13))&~(setIn(X13,pids)))&host(X6)=host(X13))=>(host(X13)=s(zero)=>(~(leq(nbr_proc,host(X13)))=>![X7]:(s(host(X13))=host(X7)=>(~(host(X6)=host(X7))=>![X17]:![X18]:(~(s(host(X13))=host(X18))=>(host(X6)=host(X18)=>![X19]:(((((((~(X7=X6)&setIn(X7,alive))|X7=X13)&((~(X18=X6)&setIn(X18,alive))|X18=X13))&~(host(X18)=host(X7)))&host(X17)=host(X7))&host(X19)=host(X18))=>~((elem(m_Down(X17),X12)&elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13)))))))))))))))),file('/tmp/SRASS.s.p', conj)).
% fof(68, negated_conjecture,~(![X12]:![X13]:![X5]:![X6]:(((((((((![X7]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X7)))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(setIn(X14,alive))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(host(X14)=host(X7))))&![X7]:![X14]:(elem(m_Halt(X14),queue(host(X7)))=>~(leq(host(X7),host(X14)))))&![X7]:![X15]:![X14]:(elem(m_Ack(X14,X7),queue(host(X15)))=>~(leq(host(X7),host(X14)))))&![X7]:![X14]:(((~(setIn(X7,alive))&leq(X14,X7))&host(X14)=host(X7))=>~(setIn(X14,alive))))&![X7]:![X14]:((~(X14=X7)&host(X14)=host(X7))=>(~(setIn(X7,alive))|~(setIn(X14,alive)))))&![X7]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X7))&setIn(X7,alive))&setIn(X15,alive))&host(X16)=host(X7))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X7)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X6))=cons(m_NotNorm(X5),X12))=>(setIn(X6,alive)=>(((index(ldr,host(X6))=host(X6)&index(status,host(X6))=norm)&index(elid,host(X6))=X5)=>(((![X7]:(host(X6)=host(X7)=>leq(X7,X13))&~(setIn(X13,pids)))&host(X6)=host(X13))=>(host(X13)=s(zero)=>(~(leq(nbr_proc,host(X13)))=>![X7]:(s(host(X13))=host(X7)=>(~(host(X6)=host(X7))=>![X17]:![X18]:(~(s(host(X13))=host(X18))=>(host(X6)=host(X18)=>![X19]:(((((((~(X7=X6)&setIn(X7,alive))|X7=X13)&((~(X18=X6)&setIn(X18,alive))|X18=X13))&~(host(X18)=host(X7)))&host(X17)=host(X7))&host(X19)=host(X18))=>~((elem(m_Down(X17),X12)&elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))))))))))))))))),inference(assume_negation,[status(cth)],[67])).
% fof(73, negated_conjecture,~(![X12]:![X13]:![X5]:![X6]:(((((((((![X7]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X7)))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(setIn(X14,alive))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(host(X14)=host(X7))))&![X7]:![X14]:(elem(m_Halt(X14),queue(host(X7)))=>~(leq(host(X7),host(X14)))))&![X7]:![X15]:![X14]:(elem(m_Ack(X14,X7),queue(host(X15)))=>~(leq(host(X7),host(X14)))))&![X7]:![X14]:(((~(setIn(X7,alive))&leq(X14,X7))&host(X14)=host(X7))=>~(setIn(X14,alive))))&![X7]:![X14]:((~(X14=X7)&host(X14)=host(X7))=>(~(setIn(X7,alive))|~(setIn(X14,alive)))))&![X7]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X7))&setIn(X7,alive))&setIn(X15,alive))&host(X16)=host(X7))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X7)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X6))=cons(m_NotNorm(X5),X12))=>(setIn(X6,alive)=>(((index(ldr,host(X6))=host(X6)&index(status,host(X6))=norm)&index(elid,host(X6))=X5)=>(((![X7]:(host(X6)=host(X7)=>leq(X7,X13))&~(setIn(X13,pids)))&host(X6)=host(X13))=>(host(X13)=s(zero)=>(~(leq(nbr_proc,host(X13)))=>![X7]:(s(host(X13))=host(X7)=>(~(host(X6)=host(X7))=>![X17]:![X18]:(~(s(host(X13))=host(X18))=>(host(X6)=host(X18)=>![X19]:(((((((~(X7=X6)&setIn(X7,alive))|X7=X13)&((~(X18=X6)&setIn(X18,alive))|X18=X13))&~(host(X18)=host(X7)))&host(X17)=host(X7))&host(X19)=host(X18))=>~((elem(m_Down(X17),X12)&elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))))))))))))))))),inference(fof_simplification,[status(thm)],[68,theory(equality)])).
% fof(74, plain,![X5]:![X12]:![X6]:(epred1_3(X6,X12,X5)=>((((((((![X7]:![X14]:(setIn(X14,alive)=>~(elem(m_Down(X14),queue(host(X7)))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(setIn(X14,alive))))&![X7]:![X14]:(elem(m_Down(X14),queue(host(X7)))=>~(host(X14)=host(X7))))&![X7]:![X14]:(elem(m_Halt(X14),queue(host(X7)))=>~(leq(host(X7),host(X14)))))&![X7]:![X15]:![X14]:(elem(m_Ack(X14,X7),queue(host(X15)))=>~(leq(host(X7),host(X14)))))&![X7]:![X14]:(((~(setIn(X7,alive))&leq(X14,X7))&host(X14)=host(X7))=>~(setIn(X14,alive))))&![X7]:![X14]:((~(X14=X7)&host(X14)=host(X7))=>(~(setIn(X7,alive))|~(setIn(X14,alive)))))&![X7]:![X16]:![X15]:![X14]:(((((~(host(X15)=host(X7))&setIn(X7,alive))&setIn(X15,alive))&host(X16)=host(X7))&host(X14)=host(X15))=>~((elem(m_Down(X14),queue(host(X7)))&elem(m_Down(X16),queue(host(X15)))))))&queue(host(X6))=cons(m_NotNorm(X5),X12))),introduced(definition)).
% fof(75, negated_conjecture,~(![X12]:![X13]:![X5]:![X6]:(epred1_3(X6,X12,X5)=>(setIn(X6,alive)=>(((index(ldr,host(X6))=host(X6)&index(status,host(X6))=norm)&index(elid,host(X6))=X5)=>(((![X7]:(host(X6)=host(X7)=>leq(X7,X13))&~(setIn(X13,pids)))&host(X6)=host(X13))=>(host(X13)=s(zero)=>(~(leq(nbr_proc,host(X13)))=>![X7]:(s(host(X13))=host(X7)=>(~(host(X6)=host(X7))=>![X17]:![X18]:(~(s(host(X13))=host(X18))=>(host(X6)=host(X18)=>![X19]:(((((((~(X7=X6)&setIn(X7,alive))|X7=X13)&((~(X18=X6)&setIn(X18,alive))|X18=X13))&~(host(X18)=host(X7)))&host(X17)=host(X7))&host(X19)=host(X18))=>~((elem(m_Down(X17),X12)&elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))))))))))))))))),inference(apply_def,[status(esa)],[73,74,theory(equality)])).
% fof(81, plain,![X3]:![X4]:(~(s(host(X3))=host(X4))|~(host(X3)=host(X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(82, plain,![X5]:![X6]:(~(s(host(X5))=host(X6))|~(host(X5)=host(X6))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(host(X1)!=host(X2)|s(host(X1))!=host(X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(97, plain,![X7]:![X8]:~(m_Down(X7)=m_Halt(X8)),inference(variable_rename,[status(thm)],[10])).
% cnf(98,plain,(m_Down(X1)!=m_Halt(X2)),inference(split_conjunct,[status(thm)],[97])).
% fof(124, plain,![X5]:![X6]:![X4]:((~(elem(X5,cons(X6,X4)))|(X5=X6|elem(X5,X4)))&((~(X5=X6)&~(elem(X5,X4)))|elem(X5,cons(X6,X4)))),inference(fof_nnf,[status(thm)],[19])).
% fof(125, plain,![X7]:![X8]:![X9]:((~(elem(X7,cons(X8,X9)))|(X7=X8|elem(X7,X9)))&((~(X7=X8)&~(elem(X7,X9)))|elem(X7,cons(X8,X9)))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X7]:![X8]:![X9]:((~(elem(X7,cons(X8,X9)))|(X7=X8|elem(X7,X9)))&((~(X7=X8)|elem(X7,cons(X8,X9)))&(~(elem(X7,X9))|elem(X7,cons(X8,X9))))),inference(distribute,[status(thm)],[125])).
% cnf(127,plain,(elem(X1,cons(X2,X3))|~elem(X1,X3)),inference(split_conjunct,[status(thm)],[126])).
% fof(130, plain,![X5]:![X6]:![X4]:((~(elem(X5,snoc(X4,X6)))|(X5=X6|elem(X5,X4)))&((~(X5=X6)&~(elem(X5,X4)))|elem(X5,snoc(X4,X6)))),inference(fof_nnf,[status(thm)],[20])).
% fof(131, plain,![X7]:![X8]:![X9]:((~(elem(X7,snoc(X9,X8)))|(X7=X8|elem(X7,X9)))&((~(X7=X8)&~(elem(X7,X9)))|elem(X7,snoc(X9,X8)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X7]:![X8]:![X9]:((~(elem(X7,snoc(X9,X8)))|(X7=X8|elem(X7,X9)))&((~(X7=X8)|elem(X7,snoc(X9,X8)))&(~(elem(X7,X9))|elem(X7,snoc(X9,X8))))),inference(distribute,[status(thm)],[131])).
% cnf(135,plain,(elem(X1,X2)|X1=X3|~elem(X1,snoc(X2,X3))),inference(split_conjunct,[status(thm)],[132])).
% fof(265, negated_conjecture,?[X12]:?[X13]:?[X5]:?[X6]:(epred1_3(X6,X12,X5)&(setIn(X6,alive)&(((index(ldr,host(X6))=host(X6)&index(status,host(X6))=norm)&index(elid,host(X6))=X5)&(((![X7]:(~(host(X6)=host(X7))|leq(X7,X13))&~(setIn(X13,pids)))&host(X6)=host(X13))&(host(X13)=s(zero)&(~(leq(nbr_proc,host(X13)))&?[X7]:(s(host(X13))=host(X7)&(~(host(X6)=host(X7))&?[X17]:?[X18]:(~(s(host(X13))=host(X18))&(host(X6)=host(X18)&?[X19]:(((((((~(X7=X6)&setIn(X7,alive))|X7=X13)&((~(X18=X6)&setIn(X18,alive))|X18=X13))&~(host(X18)=host(X7)))&host(X17)=host(X7))&host(X19)=host(X18))&(elem(m_Down(X17),X12)&elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))))))))))))))),inference(fof_nnf,[status(thm)],[75])).
% fof(266, negated_conjecture,?[X20]:?[X21]:?[X22]:?[X23]:(epred1_3(X23,X20,X22)&(setIn(X23,alive)&(((index(ldr,host(X23))=host(X23)&index(status,host(X23))=norm)&index(elid,host(X23))=X22)&(((![X24]:(~(host(X23)=host(X24))|leq(X24,X21))&~(setIn(X21,pids)))&host(X23)=host(X21))&(host(X21)=s(zero)&(~(leq(nbr_proc,host(X21)))&?[X25]:(s(host(X21))=host(X25)&(~(host(X23)=host(X25))&?[X26]:?[X27]:(~(s(host(X21))=host(X27))&(host(X23)=host(X27)&?[X28]:(((((((~(X25=X23)&setIn(X25,alive))|X25=X21)&((~(X27=X23)&setIn(X27,alive))|X27=X21))&~(host(X27)=host(X25)))&host(X26)=host(X25))&host(X28)=host(X27))&(elem(m_Down(X26),X20)&elem(m_Down(X28),snoc(queue(host(X25)),m_Halt(X21))))))))))))))),inference(variable_rename,[status(thm)],[265])).
% fof(267, negated_conjecture,(epred1_3(esk7_0,esk4_0,esk6_0)&(setIn(esk7_0,alive)&(((index(ldr,host(esk7_0))=host(esk7_0)&index(status,host(esk7_0))=norm)&index(elid,host(esk7_0))=esk6_0)&(((![X24]:(~(host(esk7_0)=host(X24))|leq(X24,esk5_0))&~(setIn(esk5_0,pids)))&host(esk7_0)=host(esk5_0))&(host(esk5_0)=s(zero)&(~(leq(nbr_proc,host(esk5_0)))&(s(host(esk5_0))=host(esk8_0)&(~(host(esk7_0)=host(esk8_0))&(~(s(host(esk5_0))=host(esk10_0))&(host(esk7_0)=host(esk10_0)&(((((((~(esk8_0=esk7_0)&setIn(esk8_0,alive))|esk8_0=esk5_0)&((~(esk10_0=esk7_0)&setIn(esk10_0,alive))|esk10_0=esk5_0))&~(host(esk10_0)=host(esk8_0)))&host(esk9_0)=host(esk8_0))&host(esk11_0)=host(esk10_0))&(elem(m_Down(esk9_0),esk4_0)&elem(m_Down(esk11_0),snoc(queue(host(esk8_0)),m_Halt(esk5_0))))))))))))))),inference(skolemize,[status(esa)],[266])).
% fof(268, negated_conjecture,![X24]:(((((((~(host(esk7_0)=host(X24))|leq(X24,esk5_0))&~(setIn(esk5_0,pids)))&host(esk7_0)=host(esk5_0))&(host(esk5_0)=s(zero)&(~(leq(nbr_proc,host(esk5_0)))&(s(host(esk5_0))=host(esk8_0)&(~(host(esk7_0)=host(esk8_0))&(~(s(host(esk5_0))=host(esk10_0))&(host(esk7_0)=host(esk10_0)&(((((((~(esk8_0=esk7_0)&setIn(esk8_0,alive))|esk8_0=esk5_0)&((~(esk10_0=esk7_0)&setIn(esk10_0,alive))|esk10_0=esk5_0))&~(host(esk10_0)=host(esk8_0)))&host(esk9_0)=host(esk8_0))&host(esk11_0)=host(esk10_0))&(elem(m_Down(esk9_0),esk4_0)&elem(m_Down(esk11_0),snoc(queue(host(esk8_0)),m_Halt(esk5_0))))))))))))&((index(ldr,host(esk7_0))=host(esk7_0)&index(status,host(esk7_0))=norm)&index(elid,host(esk7_0))=esk6_0))&setIn(esk7_0,alive))&epred1_3(esk7_0,esk4_0,esk6_0)),inference(shift_quantors,[status(thm)],[267])).
% fof(269, negated_conjecture,![X24]:(((((((~(host(esk7_0)=host(X24))|leq(X24,esk5_0))&~(setIn(esk5_0,pids)))&host(esk7_0)=host(esk5_0))&(host(esk5_0)=s(zero)&(~(leq(nbr_proc,host(esk5_0)))&(s(host(esk5_0))=host(esk8_0)&(~(host(esk7_0)=host(esk8_0))&(~(s(host(esk5_0))=host(esk10_0))&(host(esk7_0)=host(esk10_0)&(((((((~(esk8_0=esk7_0)|esk8_0=esk5_0)&(setIn(esk8_0,alive)|esk8_0=esk5_0))&((~(esk10_0=esk7_0)|esk10_0=esk5_0)&(setIn(esk10_0,alive)|esk10_0=esk5_0)))&~(host(esk10_0)=host(esk8_0)))&host(esk9_0)=host(esk8_0))&host(esk11_0)=host(esk10_0))&(elem(m_Down(esk9_0),esk4_0)&elem(m_Down(esk11_0),snoc(queue(host(esk8_0)),m_Halt(esk5_0))))))))))))&((index(ldr,host(esk7_0))=host(esk7_0)&index(status,host(esk7_0))=norm)&index(elid,host(esk7_0))=esk6_0))&setIn(esk7_0,alive))&epred1_3(esk7_0,esk4_0,esk6_0)),inference(distribute,[status(thm)],[268])).
% cnf(270,negated_conjecture,(epred1_3(esk7_0,esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(271,negated_conjecture,(setIn(esk7_0,alive)),inference(split_conjunct,[status(thm)],[269])).
% cnf(275,negated_conjecture,(elem(m_Down(esk11_0),snoc(queue(host(esk8_0)),m_Halt(esk5_0)))),inference(split_conjunct,[status(thm)],[269])).
% cnf(276,negated_conjecture,(elem(m_Down(esk9_0),esk4_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(277,negated_conjecture,(host(esk11_0)=host(esk10_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(278,negated_conjecture,(host(esk9_0)=host(esk8_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(282,negated_conjecture,(esk8_0=esk5_0|setIn(esk8_0,alive)),inference(split_conjunct,[status(thm)],[269])).
% cnf(284,negated_conjecture,(host(esk7_0)=host(esk10_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(287,negated_conjecture,(s(host(esk5_0))=host(esk8_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(290,negated_conjecture,(host(esk7_0)=host(esk5_0)),inference(split_conjunct,[status(thm)],[269])).
% cnf(292,negated_conjecture,(leq(X1,esk5_0)|host(esk7_0)!=host(X1)),inference(split_conjunct,[status(thm)],[269])).
% fof(293, plain,![X5]:![X12]:![X6]:(~(epred1_3(X6,X12,X5))|((((((((![X7]:![X14]:(~(setIn(X14,alive))|~(elem(m_Down(X14),queue(host(X7)))))&![X7]:![X14]:(~(elem(m_Down(X14),queue(host(X7))))|~(setIn(X14,alive))))&![X7]:![X14]:(~(elem(m_Down(X14),queue(host(X7))))|~(host(X14)=host(X7))))&![X7]:![X14]:(~(elem(m_Halt(X14),queue(host(X7))))|~(leq(host(X7),host(X14)))))&![X7]:![X15]:![X14]:(~(elem(m_Ack(X14,X7),queue(host(X15))))|~(leq(host(X7),host(X14)))))&![X7]:![X14]:(((setIn(X7,alive)|~(leq(X14,X7)))|~(host(X14)=host(X7)))|~(setIn(X14,alive))))&![X7]:![X14]:((X14=X7|~(host(X14)=host(X7)))|(~(setIn(X7,alive))|~(setIn(X14,alive)))))&![X7]:![X16]:![X15]:![X14]:(((((host(X15)=host(X7)|~(setIn(X7,alive)))|~(setIn(X15,alive)))|~(host(X16)=host(X7)))|~(host(X14)=host(X15)))|(~(elem(m_Down(X14),queue(host(X7))))|~(elem(m_Down(X16),queue(host(X15)))))))&queue(host(X6))=cons(m_NotNorm(X5),X12))),inference(fof_nnf,[status(thm)],[74])).
% fof(294, 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_NotNorm(X17),X18))),inference(variable_rename,[status(thm)],[293])).
% fof(295, 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_NotNorm(X17),X18))|~(epred1_3(X19,X18,X17))),inference(shift_quantors,[status(thm)],[294])).
% fof(296, 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_NotNorm(X17),X18)|~(epred1_3(X19,X18,X17)))),inference(distribute,[status(thm)],[295])).
% cnf(297,plain,(queue(host(X1))=cons(m_NotNorm(X3),X2)|~epred1_3(X1,X2,X3)),inference(split_conjunct,[status(thm)],[296])).
% cnf(303,plain,(setIn(X5,alive)|~epred1_3(X1,X2,X3)|~setIn(X4,alive)|host(X4)!=host(X5)|~leq(X4,X5)),inference(split_conjunct,[status(thm)],[296])).
% cnf(304,plain,(X4=X5|~epred1_3(X1,X2,X3)|~setIn(X4,alive)|~setIn(X5,alive)|host(X4)!=host(X5)),inference(split_conjunct,[status(thm)],[296])).
% cnf(305,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)],[296])).
% cnf(311,negated_conjecture,(host(esk11_0)=host(esk7_0)),inference(rw,[status(thm)],[277,284,theory(equality)])).
% cnf(318,negated_conjecture,(s(host(esk7_0))=host(esk8_0)),inference(rw,[status(thm)],[287,290,theory(equality)])).
% cnf(328,negated_conjecture,(s(host(esk7_0))!=host(X1)|host(esk7_0)!=host(X1)),inference(spm,[status(thm)],[83,311,theory(equality)])).
% cnf(333,negated_conjecture,(host(esk8_0)!=host(X1)|host(esk7_0)!=host(X1)),inference(rw,[status(thm)],[328,318,theory(equality)])).
% cnf(462,negated_conjecture,(m_Down(esk11_0)=m_Halt(esk5_0)|elem(m_Down(esk11_0),queue(host(esk8_0)))),inference(spm,[status(thm)],[135,275,theory(equality)])).
% cnf(463,negated_conjecture,(elem(m_Down(esk11_0),queue(host(esk8_0)))),inference(sr,[status(thm)],[462,98,theory(equality)])).
% cnf(469,negated_conjecture,(X1=X2|host(X1)!=host(X2)|~setIn(X2,alive)|~setIn(X1,alive)),inference(spm,[status(thm)],[304,270,theory(equality)])).
% cnf(488,negated_conjecture,(cons(m_NotNorm(esk6_0),esk4_0)=queue(host(esk7_0))),inference(spm,[status(thm)],[297,270,theory(equality)])).
% cnf(500,negated_conjecture,(setIn(X1,alive)|host(X2)!=host(X1)|~leq(X2,X1)|~setIn(X2,alive)),inference(spm,[status(thm)],[303,270,theory(equality)])).
% cnf(646,plain,(host(X1)=host(esk8_0)|host(X1)!=host(esk11_0)|host(X2)!=host(esk8_0)|~epred1_3(X3,X4,X5)|~setIn(esk8_0,alive)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(spm,[status(thm)],[305,463,theory(equality)])).
% cnf(647,plain,(host(X1)=host(esk8_0)|host(X1)!=host(esk7_0)|host(X2)!=host(esk8_0)|~epred1_3(X3,X4,X5)|~setIn(esk8_0,alive)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(rw,[status(thm)],[646,311,theory(equality)])).
% cnf(2164,negated_conjecture,(X1=esk7_0|host(X1)!=host(esk7_0)|~setIn(X1,alive)),inference(spm,[status(thm)],[469,271,theory(equality)])).
% cnf(2697,negated_conjecture,(elem(X1,queue(host(esk7_0)))|~elem(X1,esk4_0)),inference(spm,[status(thm)],[127,488,theory(equality)])).
% cnf(2819,negated_conjecture,(setIn(X1,alive)|host(esk7_0)!=host(X1)|~leq(esk7_0,X1)),inference(spm,[status(thm)],[500,271,theory(equality)])).
% cnf(4545,plain,(host(X1)!=host(esk7_0)|host(X2)!=host(esk8_0)|~epred1_3(X3,X4,X5)|~setIn(esk8_0,alive)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))),inference(csr,[status(thm)],[647,333])).
% fof(4546, plain,(~(epred11_0)<=>![X1]:![X2]:((((~(host(X2)=host(esk8_0))|~(host(X1)=host(esk7_0)))|~(setIn(esk8_0,alive)))|~(setIn(X1,alive)))|~(elem(m_Down(X2),queue(host(X1)))))),introduced(definition),['split']).
% cnf(4547,plain,(epred11_0|~elem(m_Down(X2),queue(host(X1)))|~setIn(X1,alive)|~setIn(esk8_0,alive)|host(X2)!=host(esk8_0)|host(X1)!=host(esk7_0)),inference(split_equiv,[status(thm)],[4546])).
% fof(4548, plain,(~(epred12_0)<=>![X5]:![X4]:![X3]:~(epred1_3(X3,X4,X5))),introduced(definition),['split']).
% cnf(4549,plain,(epred12_0|~epred1_3(X3,X4,X5)),inference(split_equiv,[status(thm)],[4548])).
% cnf(4550,plain,(~epred12_0|~epred11_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[4545,4546,theory(equality)]),4548,theory(equality)]),['split']).
% cnf(4551,negated_conjecture,(epred12_0),inference(spm,[status(thm)],[4549,270,theory(equality)])).
% cnf(4553,plain,($false|~epred11_0),inference(rw,[status(thm)],[4550,4551,theory(equality)])).
% cnf(4554,plain,(~epred11_0),inference(cn,[status(thm)],[4553,theory(equality)])).
% cnf(86831,negated_conjecture,(X1=esk7_0|host(X1)!=host(esk7_0)|~leq(esk7_0,X1)),inference(spm,[status(thm)],[2164,2819,theory(equality)])).
% cnf(86836,negated_conjecture,(esk5_0=esk7_0|host(esk5_0)!=host(esk7_0)),inference(spm,[status(thm)],[86831,292,theory(equality)])).
% cnf(86993,negated_conjecture,(esk5_0=esk7_0|$false),inference(rw,[status(thm)],[86836,290,theory(equality)])).
% cnf(86994,negated_conjecture,(esk5_0=esk7_0),inference(cn,[status(thm)],[86993,theory(equality)])).
% cnf(87640,negated_conjecture,(esk8_0=esk7_0|setIn(esk8_0,alive)),inference(rw,[status(thm)],[282,86994,theory(equality)])).
% cnf(146150,plain,(~elem(m_Down(X2),queue(host(X1)))|~setIn(X1,alive)|~setIn(esk8_0,alive)|host(X2)!=host(esk8_0)|host(X1)!=host(esk7_0)),inference(sr,[status(thm)],[4547,4554,theory(equality)])).
% cnf(146156,negated_conjecture,(host(X1)!=host(esk8_0)|~setIn(esk8_0,alive)|~setIn(esk7_0,alive)|~elem(m_Down(X1),esk4_0)),inference(spm,[status(thm)],[146150,2697,theory(equality)])).
% cnf(146158,negated_conjecture,(host(X1)!=host(esk8_0)|~setIn(esk8_0,alive)|$false|~elem(m_Down(X1),esk4_0)),inference(rw,[status(thm)],[146156,271,theory(equality)])).
% cnf(146159,negated_conjecture,(host(X1)!=host(esk8_0)|~setIn(esk8_0,alive)|~elem(m_Down(X1),esk4_0)),inference(cn,[status(thm)],[146158,theory(equality)])).
% cnf(146163,negated_conjecture,(host(esk9_0)!=host(esk8_0)|~setIn(esk8_0,alive)),inference(spm,[status(thm)],[146159,276,theory(equality)])).
% cnf(146164,negated_conjecture,($false|~setIn(esk8_0,alive)),inference(rw,[status(thm)],[146163,278,theory(equality)])).
% cnf(146165,negated_conjecture,(~setIn(esk8_0,alive)),inference(cn,[status(thm)],[146164,theory(equality)])).
% cnf(146168,negated_conjecture,(esk8_0=esk7_0),inference(sr,[status(thm)],[87640,146165,theory(equality)])).
% cnf(146278,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[146165,146168,theory(equality)]),271,theory(equality)])).
% cnf(146279,negated_conjecture,($false),inference(cn,[status(thm)],[146278,theory(equality)])).
% cnf(146280,negated_conjecture,($false),146279,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8272
% # ...of these trivial : 149
% # ...subsumed : 5983
% # ...remaining for further processing: 2140
% # Other redundant clauses eliminated : 10
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 95
% # Backward-rewritten : 883
% # Generated clauses : 98632
% # ...of the previous two non-trivial : 78541
% # Contextual simplify-reflections : 1304
% # Paramodulations : 98459
% # Factorizations : 54
% # Equation resolutions : 101
% # Current number of processed clauses: 1151
% # Positive orientable unit clauses: 92
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 114
% # Non-unit-clauses : 945
% # Current number of unprocessed clauses: 31279
% # ...number of literals in the above : 107384
% # Clause-clause subsumption calls (NU) : 182757
% # Rec. Clause-clause subsumption calls : 162449
% # Unit Clause-clause subsumption calls : 1765
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 272
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 540 leaves, 2.16+/-2.792 terms/leaf
% # Paramod-from index: 176 leaves, 1.69+/-2.217 terms/leaf
% # Paramod-into index: 454 leaves, 1.98+/-2.548 terms/leaf
% # -------------------------------------------------
% # User time : 3.114 s
% # System time : 0.101 s
% # Total time : 3.215 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.88 CPU 5.73 WC
% FINAL PrfWatch: 4.88 CPU 5.73 WC
% SZS output end Solution for /tmp/SystemOnTPTP24906/SWV451+1.tptp
%
%------------------------------------------------------------------------------