TSTP Solution File: SWV453+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWV453+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:47:07 EDT 2024

% Result   : Theorem 0.12s 0.39s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV453+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Apr 30 00:29:03 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.6.0
% 0.12/0.39  % Refutation found
% 0.12/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.39  fof(f47,axiom,(
% 0.12/0.39    (! [X,Y,Q] :( elem(X,cons(Y,Q))<=> ( X = Y| elem(X,Q) ) ) )),
% 0.12/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f67,conjecture,(
% 0.12/0.39    (! [V,W,X,Y] :( ( (! [Z,Pid0] :( setIn(Pid0,alive)=> ~ elem(m_Down(Pid0),queue(host(Z))) ))& (! [Z,Pid0] :( elem(m_Down(Pid0),queue(host(Z)))=> ~ setIn(Pid0,alive) ))& (! [Z,Pid0] :( elem(m_Down(Pid0),queue(host(Z)))=> host(Pid0) != host(Z) ))& (! [Z,Pid0] :( elem(m_Halt(Pid0),queue(host(Z)))=> ~ leq(host(Z),host(Pid0)) ))& (! [Z,Pid20,Pid0] :( elem(m_Ack(Pid0,Z),queue(host(Pid20)))=> ~ leq(host(Z),host(Pid0)) ))& (! [Z,Pid0] :( ( ~ setIn(Z,alive)& leq(Pid0,Z)& host(Pid0) = host(Z) )=> ~ setIn(Pid0,alive) ))& (! [Z,Pid0] :( ( Pid0 != Z& host(Pid0) = host(Z) )=> ( ~ setIn(Z,alive)| ~ setIn(Pid0,alive) ) ))& (! [Z,Pid30,Pid20,Pid0] :( ( host(Pid20) != host(Z)& setIn(Z,alive)& setIn(Pid20,alive)& host(Pid30) = host(Z)& host(Pid0) = host(Pid20) )=> ~ ( elem(m_Down(Pid0),queue(host(Z)))& elem(m_Down(Pid30),queue(host(Pid20))) ) ))& queue(host(X)) = cons(m_Down(Y),V) )=> ( setIn(X,alive)=> ( ~ leq(host(X),host(Y))=> ( ( ( index(ldr,host(X)) = host(Y)& index(status,host(X)) = norm )| ( index(status,host(X)) = wait& host(Y) = host(index(elid,host(X))) ) )=> ( ( (! [Z] :( host(X) = host(Z)=> leq(Z,W) ))& ~ setIn(W,pids)& host(X) = host(W) )=> ( host(W) != s(zero)=> (! [Z] :( host(X) != host(Z)=> (! [X0,Y0] :( host(X) = host(Y0)=> (! [Z0] :( ( ( ( Z != X& setIn(Z,alive) )| Z = W )& ( ( Y0 != X& setIn(Y0,alive) )| Y0 = W )& host(Y0) != host(Z)& host(X0) = host(Z)& host(Z0) = host(Y0) )=> ~ ( elem(m_Down(X0),V)& elem(m_Down(Z0),queue(host(Z))) ) ) )) )) )) ) ) ) ) ) )),
% 0.12/0.39    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.39  fof(f68,negated_conjecture,(
% 0.12/0.39    ~((! [V,W,X,Y] :( ( (! [Z,Pid0] :( setIn(Pid0,alive)=> ~ elem(m_Down(Pid0),queue(host(Z))) ))& (! [Z,Pid0] :( elem(m_Down(Pid0),queue(host(Z)))=> ~ setIn(Pid0,alive) ))& (! [Z,Pid0] :( elem(m_Down(Pid0),queue(host(Z)))=> host(Pid0) != host(Z) ))& (! [Z,Pid0] :( elem(m_Halt(Pid0),queue(host(Z)))=> ~ leq(host(Z),host(Pid0)) ))& (! [Z,Pid20,Pid0] :( elem(m_Ack(Pid0,Z),queue(host(Pid20)))=> ~ leq(host(Z),host(Pid0)) ))& (! [Z,Pid0] :( ( ~ setIn(Z,alive)& leq(Pid0,Z)& host(Pid0) = host(Z) )=> ~ setIn(Pid0,alive) ))& (! [Z,Pid0] :( ( Pid0 != Z& host(Pid0) = host(Z) )=> ( ~ setIn(Z,alive)| ~ setIn(Pid0,alive) ) ))& (! [Z,Pid30,Pid20,Pid0] :( ( host(Pid20) != host(Z)& setIn(Z,alive)& setIn(Pid20,alive)& host(Pid30) = host(Z)& host(Pid0) = host(Pid20) )=> ~ ( elem(m_Down(Pid0),queue(host(Z)))& elem(m_Down(Pid30),queue(host(Pid20))) ) ))& queue(host(X)) = cons(m_Down(Y),V) )=> ( setIn(X,alive)=> ( ~ leq(host(X),host(Y))=> ( ( ( index(ldr,host(X)) = host(Y)& index(status,host(X)) = norm )| ( index(status,host(X)) = wait& host(Y) = host(index(elid,host(X))) ) )=> ( ( (! [Z] :( host(X) = host(Z)=> leq(Z,W) ))& ~ setIn(W,pids)& host(X) = host(W) )=> ( host(W) != s(zero)=> (! [Z] :( host(X) != host(Z)=> (! [X0,Y0] :( host(X) = host(Y0)=> (! [Z0] :( ( ( ( Z != X& setIn(Z,alive) )| Z = W )& ( ( Y0 != X& setIn(Y0,alive) )| Y0 = W )& host(Y0) != host(Z)& host(X0) = host(Z)& host(Z0) = host(Y0) )=> ~ ( elem(m_Down(X0),V)& elem(m_Down(Z0),queue(host(Z))) ) ) )) )) )) ) ) ) ) ) ))),
% 0.12/0.39    inference(negated_conjecture,[status(cth)],[f67])).
% 0.12/0.39  fof(f138,plain,(
% 0.12/0.39    ![X,Y,Q]: ((~elem(X,cons(Y,Q))|(X=Y|elem(X,Q)))&(elem(X,cons(Y,Q))|(~X=Y&~elem(X,Q))))),
% 0.12/0.39    inference(NNF_transformation,[status(esa)],[f47])).
% 0.12/0.39  fof(f139,plain,(
% 0.12/0.39    (![X,Y,Q]: (~elem(X,cons(Y,Q))|(X=Y|elem(X,Q))))&(![X,Y,Q]: (elem(X,cons(Y,Q))|(~X=Y&~elem(X,Q))))),
% 0.12/0.39    inference(miniscoping,[status(esa)],[f138])).
% 0.12/0.39  fof(f142,plain,(
% 0.12/0.39    ![X0,X1,X2]: (elem(X0,cons(X1,X2))|~elem(X0,X2))),
% 0.12/0.39    inference(cnf_transformation,[status(esa)],[f139])).
% 0.12/0.39  fof(f212,plain,(
% 0.12/0.39    (?[V,W,X,Y]: ((((((((((![Z,Pid0]: (~setIn(Pid0,alive)|~elem(m_Down(Pid0),queue(host(Z)))))&(![Z,Pid0]: (~elem(m_Down(Pid0),queue(host(Z)))|~setIn(Pid0,alive))))&(![Z,Pid0]: (~elem(m_Down(Pid0),queue(host(Z)))|~host(Pid0)=host(Z))))&(![Z,Pid0]: (~elem(m_Halt(Pid0),queue(host(Z)))|~leq(host(Z),host(Pid0)))))&(![Z,Pid20,Pid0]: (~elem(m_Ack(Pid0,Z),queue(host(Pid20)))|~leq(host(Z),host(Pid0)))))&(![Z,Pid0]: (((setIn(Z,alive)|~leq(Pid0,Z))|~host(Pid0)=host(Z))|~setIn(Pid0,alive))))&(![Z,Pid0]: ((Pid0=Z|~host(Pid0)=host(Z))|(~setIn(Z,alive)|~setIn(Pid0,alive)))))&(![Z,Pid30,Pid20,Pid0]: (((((host(Pid20)=host(Z)|~setIn(Z,alive))|~setIn(Pid20,alive))|~host(Pid30)=host(Z))|~host(Pid0)=host(Pid20))|(~elem(m_Down(Pid0),queue(host(Z)))|~elem(m_Down(Pid30),queue(host(Pid20)))))))&queue(host(X))=cons(m_Down(Y),V))&(setIn(X,alive)&(~leq(host(X),host(Y))&(((index(ldr,host(X))=host(Y)&index(status,host(X))=norm)|(index(status,host(X))=wait&host(Y)=host(index(elid,host(X)))))&((((![Z]: (~host(X)=host(Z)|leq(Z,W)))&~setIn(W,pids))&host(X)=host(W))&(~host(W)=s(zero)&(?[Z]: (~host(X)=host(Z)&(?[X0,Y0]: (host(X)=host(Y0)&(?[Z0]: (((((((~Z=X&setIn(Z,alive))|Z=W)&((~Y0=X&setIn(Y0,alive))|Y0=W))&~host(Y0)=host(Z))&host(X0)=host(Z))&host(Z0)=host(Y0))&(elem(m_Down(X0),V)&elem(m_Down(Z0),queue(host(Z)))))))))))))))))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(esa)],[f68])).
% 0.12/0.40  fof(f213,plain,(
% 0.12/0.40    ![X,Y]: (pd0_0(Y,X)=>(index(ldr,host(X))=host(Y)&index(status,host(X))=norm))),
% 0.12/0.40    introduced(predicate_definition,[f212])).
% 0.12/0.40  fof(f214,plain,(
% 0.12/0.40    ?[V,W,X,Y]: ((((((((((![Z,Pid0]: (~setIn(Pid0,alive)|~elem(m_Down(Pid0),queue(host(Z)))))&(![Z,Pid0]: (~elem(m_Down(Pid0),queue(host(Z)))|~setIn(Pid0,alive))))&(![Z,Pid0]: (~elem(m_Down(Pid0),queue(host(Z)))|~host(Pid0)=host(Z))))&(![Z,Pid0]: (~elem(m_Halt(Pid0),queue(host(Z)))|~leq(host(Z),host(Pid0)))))&(![Z,Pid20,Pid0]: (~elem(m_Ack(Pid0,Z),queue(host(Pid20)))|~leq(host(Z),host(Pid0)))))&(![Z,Pid0]: (((setIn(Z,alive)|~leq(Pid0,Z))|~host(Pid0)=host(Z))|~setIn(Pid0,alive))))&(![Z,Pid0]: ((Pid0=Z|~host(Pid0)=host(Z))|(~setIn(Z,alive)|~setIn(Pid0,alive)))))&(![Z,Pid30,Pid20,Pid0]: (((((host(Pid20)=host(Z)|~setIn(Z,alive))|~setIn(Pid20,alive))|~host(Pid30)=host(Z))|~host(Pid0)=host(Pid20))|(~elem(m_Down(Pid0),queue(host(Z)))|~elem(m_Down(Pid30),queue(host(Pid20)))))))&queue(host(X))=cons(m_Down(Y),V))&(setIn(X,alive)&(~leq(host(X),host(Y))&((pd0_0(Y,X)|(index(status,host(X))=wait&host(Y)=host(index(elid,host(X)))))&((((![Z]: (~host(X)=host(Z)|leq(Z,W)))&~setIn(W,pids))&host(X)=host(W))&(~host(W)=s(zero)&(?[Z]: (~host(X)=host(Z)&(?[X0,Y0]: (host(X)=host(Y0)&(?[Z0]: (((((((~Z=X&setIn(Z,alive))|Z=W)&((~Y0=X&setIn(Y0,alive))|Y0=W))&~host(Y0)=host(Z))&host(X0)=host(Z))&host(Z0)=host(Y0))&(elem(m_Down(X0),V)&elem(m_Down(Z0),queue(host(Z))))))))))))))))),
% 0.12/0.40    inference(formula_renaming,[status(thm)],[f212,f213])).
% 0.12/0.40  fof(f215,plain,(
% 0.12/0.40    ?[V,X,Y]: ((((((((((![Pid0]: (~setIn(Pid0,alive)|(![Z]: ~elem(m_Down(Pid0),queue(host(Z))))))&(![Pid0]: ((![Z]: ~elem(m_Down(Pid0),queue(host(Z))))|~setIn(Pid0,alive))))&(![Z,Pid0]: (~elem(m_Down(Pid0),queue(host(Z)))|~host(Pid0)=host(Z))))&(![Z,Pid0]: (~elem(m_Halt(Pid0),queue(host(Z)))|~leq(host(Z),host(Pid0)))))&(![Z,Pid0]: ((![Pid20]: ~elem(m_Ack(Pid0,Z),queue(host(Pid20))))|~leq(host(Z),host(Pid0)))))&(![Pid0]: ((![Z]: ((setIn(Z,alive)|~leq(Pid0,Z))|~host(Pid0)=host(Z)))|~setIn(Pid0,alive))))&(![Z,Pid0]: ((Pid0=Z|~host(Pid0)=host(Z))|(~setIn(Z,alive)|~setIn(Pid0,alive)))))&(![Z,Pid30,Pid20,Pid0]: (((((host(Pid20)=host(Z)|~setIn(Z,alive))|~setIn(Pid20,alive))|~host(Pid30)=host(Z))|~host(Pid0)=host(Pid20))|(~elem(m_Down(Pid0),queue(host(Z)))|~elem(m_Down(Pid30),queue(host(Pid20)))))))&queue(host(X))=cons(m_Down(Y),V))&(setIn(X,alive)&(~leq(host(X),host(Y))&((pd0_0(Y,X)|(index(status,host(X))=wait&host(Y)=host(index(elid,host(X)))))&(?[W]: ((((![Z]: (~host(X)=host(Z)|leq(Z,W)))&~setIn(W,pids))&host(X)=host(W))&(~host(W)=s(zero)&(?[Z]: (~host(X)=host(Z)&(?[Y0]: (host(X)=host(Y0)&(?[X0,Z0]: (((((((~Z=X&setIn(Z,alive))|Z=W)&((~Y0=X&setIn(Y0,alive))|Y0=W))&~host(Y0)=host(Z))&host(X0)=host(Z))&host(Z0)=host(Y0))&(elem(m_Down(X0),V)&elem(m_Down(Z0),queue(host(Z)))))))))))))))))),
% 0.12/0.40    inference(miniscoping,[status(esa)],[f214])).
% 0.12/0.40  fof(f216,plain,(
% 0.12/0.40    ((((((((((![Pid0]: (~setIn(Pid0,alive)|(![Z]: ~elem(m_Down(Pid0),queue(host(Z))))))&(![Pid0]: ((![Z]: ~elem(m_Down(Pid0),queue(host(Z))))|~setIn(Pid0,alive))))&(![Z,Pid0]: (~elem(m_Down(Pid0),queue(host(Z)))|~host(Pid0)=host(Z))))&(![Z,Pid0]: (~elem(m_Halt(Pid0),queue(host(Z)))|~leq(host(Z),host(Pid0)))))&(![Z,Pid0]: ((![Pid20]: ~elem(m_Ack(Pid0,Z),queue(host(Pid20))))|~leq(host(Z),host(Pid0)))))&(![Pid0]: ((![Z]: ((setIn(Z,alive)|~leq(Pid0,Z))|~host(Pid0)=host(Z)))|~setIn(Pid0,alive))))&(![Z,Pid0]: ((Pid0=Z|~host(Pid0)=host(Z))|(~setIn(Z,alive)|~setIn(Pid0,alive)))))&(![Z,Pid30,Pid20,Pid0]: (((((host(Pid20)=host(Z)|~setIn(Z,alive))|~setIn(Pid20,alive))|~host(Pid30)=host(Z))|~host(Pid0)=host(Pid20))|(~elem(m_Down(Pid0),queue(host(Z)))|~elem(m_Down(Pid30),queue(host(Pid20)))))))&queue(host(sk0_5))=cons(m_Down(sk0_6),sk0_4))&(setIn(sk0_5,alive)&(~leq(host(sk0_5),host(sk0_6))&((pd0_0(sk0_6,sk0_5)|(index(status,host(sk0_5))=wait&host(sk0_6)=host(index(elid,host(sk0_5)))))&((((![Z]: (~host(sk0_5)=host(Z)|leq(Z,sk0_7)))&~setIn(sk0_7,pids))&host(sk0_5)=host(sk0_7))&(~host(sk0_7)=s(zero)&(~host(sk0_5)=host(sk0_8)&(host(sk0_5)=host(sk0_9)&(((((((~sk0_8=sk0_5&setIn(sk0_8,alive))|sk0_8=sk0_7)&((~sk0_9=sk0_5&setIn(sk0_9,alive))|sk0_9=sk0_7))&~host(sk0_9)=host(sk0_8))&host(sk0_10)=host(sk0_8))&host(sk0_11)=host(sk0_9))&(elem(m_Down(sk0_10),sk0_4)&elem(m_Down(sk0_11),queue(host(sk0_8)))))))))))))),
% 0.12/0.40    inference(skolemization,[status(esa)],[f215])).
% 0.12/0.40  fof(f223,plain,(
% 0.12/0.40    ![X0,X1]: (X0=X1|~host(X0)=host(X1)|~setIn(X1,alive)|~setIn(X0,alive))),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f224,plain,(
% 0.12/0.40    ![X0,X1,X2,X3]: (host(X0)=host(X1)|~setIn(X1,alive)|~setIn(X0,alive)|~host(X2)=host(X1)|~host(X3)=host(X0)|~elem(m_Down(X3),queue(host(X1)))|~elem(m_Down(X2),queue(host(X0))))),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f225,plain,(
% 0.12/0.40    queue(host(sk0_5))=cons(m_Down(sk0_6),sk0_4)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f226,plain,(
% 0.12/0.40    setIn(sk0_5,alive)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f232,plain,(
% 0.12/0.40    host(sk0_5)=host(sk0_7)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f234,plain,(
% 0.12/0.40    ~host(sk0_5)=host(sk0_8)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f235,plain,(
% 0.12/0.40    host(sk0_5)=host(sk0_9)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f236,plain,(
% 0.12/0.40    ~sk0_8=sk0_5|sk0_8=sk0_7),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f237,plain,(
% 0.12/0.40    setIn(sk0_8,alive)|sk0_8=sk0_7),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f241,plain,(
% 0.12/0.40    host(sk0_10)=host(sk0_8)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f242,plain,(
% 0.12/0.40    host(sk0_11)=host(sk0_9)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f243,plain,(
% 0.12/0.40    elem(m_Down(sk0_10),sk0_4)),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f244,plain,(
% 0.12/0.40    elem(m_Down(sk0_11),queue(host(sk0_8)))),
% 0.12/0.40    inference(cnf_transformation,[status(esa)],[f216])).
% 0.12/0.40  fof(f259,plain,(
% 0.12/0.40    spl0_3 <=> sk0_8=sk0_5),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f262,plain,(
% 0.12/0.40    spl0_4 <=> sk0_8=sk0_7),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f263,plain,(
% 0.12/0.40    sk0_8=sk0_7|~spl0_4),
% 0.12/0.40    inference(component_clause,[status(thm)],[f262])).
% 0.12/0.40  fof(f265,plain,(
% 0.12/0.40    ~spl0_3|spl0_4),
% 0.12/0.40    inference(split_clause,[status(thm)],[f236,f259,f262])).
% 0.12/0.40  fof(f266,plain,(
% 0.12/0.40    spl0_5 <=> setIn(sk0_8,alive)),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f267,plain,(
% 0.12/0.40    setIn(sk0_8,alive)|~spl0_5),
% 0.12/0.40    inference(component_clause,[status(thm)],[f266])).
% 0.12/0.40  fof(f269,plain,(
% 0.12/0.40    spl0_5|spl0_4),
% 0.12/0.40    inference(split_clause,[status(thm)],[f237,f266,f262])).
% 0.12/0.40  fof(f302,plain,(
% 0.12/0.40    ~host(sk0_5)=host(sk0_7)|~spl0_4),
% 0.12/0.40    inference(backward_demodulation,[status(thm)],[f263,f234])).
% 0.12/0.40  fof(f303,plain,(
% 0.12/0.40    ~host(sk0_5)=host(sk0_5)|~spl0_4),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f232,f302])).
% 0.12/0.40  fof(f304,plain,(
% 0.12/0.40    $false|~spl0_4),
% 0.12/0.40    inference(trivial_equality_resolution,[status(esa)],[f303])).
% 0.12/0.40  fof(f305,plain,(
% 0.12/0.40    ~spl0_4),
% 0.12/0.40    inference(contradiction_clause,[status(thm)],[f304])).
% 0.12/0.40  fof(f355,plain,(
% 0.12/0.40    host(sk0_11)=host(sk0_5)),
% 0.12/0.40    inference(backward_demodulation,[status(thm)],[f235,f242])).
% 0.12/0.40  fof(f383,plain,(
% 0.12/0.40    spl0_18 <=> host(sk0_5)=host(sk0_5)),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f385,plain,(
% 0.12/0.40    ~host(sk0_5)=host(sk0_5)|spl0_18),
% 0.12/0.40    inference(component_clause,[status(thm)],[f383])).
% 0.12/0.40  fof(f396,plain,(
% 0.12/0.40    spl0_21 <=> host(sk0_5)=host(sk0_8)),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f410,plain,(
% 0.12/0.40    $false|spl0_18),
% 0.12/0.40    inference(trivial_equality_resolution,[status(esa)],[f385])).
% 0.12/0.40  fof(f411,plain,(
% 0.12/0.40    spl0_18),
% 0.12/0.40    inference(contradiction_clause,[status(thm)],[f410])).
% 0.12/0.40  fof(f433,plain,(
% 0.12/0.40    spl0_26 <=> setIn(sk0_5,alive)),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f435,plain,(
% 0.12/0.40    ~setIn(sk0_5,alive)|spl0_26),
% 0.12/0.40    inference(component_clause,[status(thm)],[f433])).
% 0.12/0.40  fof(f481,plain,(
% 0.12/0.40    ![X0]: (X0=sk0_8|~host(X0)=host(sk0_8)|~setIn(X0,alive)|~spl0_5)),
% 0.12/0.40    inference(resolution,[status(thm)],[f223,f267])).
% 0.12/0.40  fof(f542,plain,(
% 0.12/0.40    sk0_5=sk0_8|~host(sk0_5)=host(sk0_8)|~spl0_5),
% 0.12/0.40    inference(resolution,[status(thm)],[f481,f226])).
% 0.12/0.40  fof(f543,plain,(
% 0.12/0.40    spl0_3|~spl0_21|~spl0_5),
% 0.12/0.40    inference(split_clause,[status(thm)],[f542,f259,f396,f266])).
% 0.12/0.40  fof(f585,plain,(
% 0.12/0.40    $false|spl0_26),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f435,f226])).
% 0.12/0.40  fof(f586,plain,(
% 0.12/0.40    spl0_26),
% 0.12/0.40    inference(contradiction_clause,[status(thm)],[f585])).
% 0.12/0.40  fof(f648,plain,(
% 0.12/0.40    spl0_57 <=> host(X0)=host(sk0_8)|~setIn(X0,alive)|~host(X1)=host(sk0_8)|~host(sk0_11)=host(X0)|~elem(m_Down(X1),queue(host(X0)))),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f649,plain,(
% 0.12/0.40    ![X0,X1]: (host(X0)=host(sk0_8)|~setIn(X0,alive)|~host(X1)=host(sk0_8)|~host(sk0_11)=host(X0)|~elem(m_Down(X1),queue(host(X0)))|~spl0_57)),
% 0.12/0.40    inference(component_clause,[status(thm)],[f648])).
% 0.12/0.40  fof(f651,plain,(
% 0.12/0.40    ![X0,X1]: (host(X0)=host(sk0_8)|~setIn(sk0_8,alive)|~setIn(X0,alive)|~host(X1)=host(sk0_8)|~host(sk0_11)=host(X0)|~elem(m_Down(X1),queue(host(X0))))),
% 0.12/0.40    inference(resolution,[status(thm)],[f224,f244])).
% 0.12/0.40  fof(f652,plain,(
% 0.12/0.40    spl0_57|~spl0_5),
% 0.12/0.40    inference(split_clause,[status(thm)],[f651,f648,f266])).
% 0.12/0.40  fof(f666,plain,(
% 0.12/0.40    ![X0,X1]: (host(X0)=host(sk0_8)|~setIn(X0,alive)|~host(X1)=host(sk0_8)|~host(sk0_5)=host(X0)|~elem(m_Down(X1),queue(host(X0)))|~spl0_57)),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f355,f649])).
% 0.12/0.40  fof(f784,plain,(
% 0.12/0.40    ![X0]: (elem(m_Down(sk0_10),cons(X0,sk0_4)))),
% 0.12/0.40    inference(resolution,[status(thm)],[f142,f243])).
% 0.12/0.40  fof(f930,plain,(
% 0.12/0.40    spl0_89 <=> host(sk0_10)=host(sk0_8)),
% 0.12/0.40    introduced(split_symbol_definition)).
% 0.12/0.40  fof(f932,plain,(
% 0.12/0.40    ~host(sk0_10)=host(sk0_8)|spl0_89),
% 0.12/0.40    inference(component_clause,[status(thm)],[f930])).
% 0.12/0.40  fof(f1011,plain,(
% 0.12/0.40    elem(m_Down(sk0_10),queue(host(sk0_5)))),
% 0.12/0.40    inference(paramodulation,[status(thm)],[f225,f784])).
% 0.12/0.40  fof(f1488,plain,(
% 0.12/0.40    host(sk0_5)=host(sk0_8)|~setIn(sk0_5,alive)|~host(sk0_10)=host(sk0_8)|~host(sk0_5)=host(sk0_5)|~spl0_57),
% 0.12/0.40    inference(resolution,[status(thm)],[f1011,f666])).
% 0.12/0.40  fof(f1489,plain,(
% 0.12/0.40    spl0_21|~spl0_26|~spl0_89|~spl0_18|~spl0_57),
% 0.12/0.40    inference(split_clause,[status(thm)],[f1488,f396,f433,f930,f383,f648])).
% 0.12/0.40  fof(f1500,plain,(
% 0.12/0.40    ~host(sk0_8)=host(sk0_8)|spl0_89),
% 0.12/0.40    inference(forward_demodulation,[status(thm)],[f241,f932])).
% 0.12/0.40  fof(f1501,plain,(
% 0.12/0.40    $false|spl0_89),
% 0.12/0.40    inference(trivial_equality_resolution,[status(esa)],[f1500])).
% 0.12/0.40  fof(f1502,plain,(
% 0.12/0.40    spl0_89),
% 0.12/0.40    inference(contradiction_clause,[status(thm)],[f1501])).
% 0.12/0.40  fof(f1503,plain,(
% 0.12/0.40    $false),
% 0.12/0.40    inference(sat_refutation,[status(thm)],[f265,f269,f305,f411,f543,f586,f652,f1489,f1502])).
% 0.12/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.40  % Elapsed time: 0.063498 seconds
% 0.12/0.40  % CPU time: 0.371552 seconds
% 0.12/0.40  % Total memory used: 66.592 MB
% 0.12/0.40  % Net memory used: 66.287 MB
%------------------------------------------------------------------------------