TSTP Solution File: SWV454+1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n023.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 : Wed May 31 12:41:45 EDT 2023

% Result   : Theorem 0.16s 0.33s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWV454+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n023.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue May 30 11:58:38 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.16/0.32  % Drodi V3.5.1
% 0.16/0.33  % Refutation found
% 0.16/0.33  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.33  % SZS output start CNFRefutation for theBenchmark
% 0.16/0.33  fof(f47,axiom,(
% 0.16/0.33    (! [X,Y,Q] :( elem(X,cons(Y,Q))<=> ( X = Y| elem(X,Q) ) ) )),
% 0.16/0.33    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.16/0.33  fof(f67,conjecture,(
% 0.16/0.33    (! [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] :( ( ~ leq(host(X),Z)& leq(s(zero),Z) )=> ( setIn(Z,index(down,host(X)))| Z = host(Y) ) ))& index(status,host(X)) = elec_1 )=> ( ~ leq(nbr_proc,host(X))=> (! [Z] :( s(host(X)) != host(Z)=> ( host(X) = host(Z)=> (! [W0,X0] :( s(host(X)) != host(X0)=> ( host(X) != host(X0)=> (! [Y0] :( ( host(X0) != host(Z)& setIn(Z,alive)& setIn(X0,alive)& host(W0) = host(Z)& host(Y0) = host(X0) )=> ~ ( elem(m_Down(Y0),V)& elem(m_Down(W0),queue(host(X0))) ) ) )) ) )) ) )) ) ) ) ) ) )),
% 0.16/0.33    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.16/0.33  fof(f68,negated_conjecture,(
% 0.16/0.33    ~((! [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] :( ( ~ leq(host(X),Z)& leq(s(zero),Z) )=> ( setIn(Z,index(down,host(X)))| Z = host(Y) ) ))& index(status,host(X)) = elec_1 )=> ( ~ leq(nbr_proc,host(X))=> (! [Z] :( s(host(X)) != host(Z)=> ( host(X) = host(Z)=> (! [W0,X0] :( s(host(X)) != host(X0)=> ( host(X) != host(X0)=> (! [Y0] :( ( host(X0) != host(Z)& setIn(Z,alive)& setIn(X0,alive)& host(W0) = host(Z)& host(Y0) = host(X0) )=> ~ ( elem(m_Down(Y0),V)& elem(m_Down(W0),queue(host(X0))) ) ) )) ) )) ) )) ) ) ) ) ) ))),
% 0.16/0.33    inference(negated_conjecture,[status(cth)],[f67])).
% 0.16/0.33  fof(f138,plain,(
% 0.16/0.33    ![X,Y,Q]: ((~elem(X,cons(Y,Q))|(X=Y|elem(X,Q)))&(elem(X,cons(Y,Q))|(~X=Y&~elem(X,Q))))),
% 0.16/0.33    inference(NNF_transformation,[status(esa)],[f47])).
% 0.16/0.33  fof(f139,plain,(
% 0.16/0.33    (![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.16/0.33    inference(miniscoping,[status(esa)],[f138])).
% 0.16/0.33  fof(f142,plain,(
% 0.16/0.33    ![X0,X1,X2]: (elem(X0,cons(X1,X2))|~elem(X0,X2))),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f139])).
% 0.16/0.33  fof(f212,plain,(
% 0.16/0.33    (?[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]: ((leq(host(X),Z)|~leq(s(zero),Z))|(setIn(Z,index(down,host(X)))|Z=host(Y))))&index(status,host(X))=elec_1)&(~leq(nbr_proc,host(X))&(?[Z]: (~s(host(X))=host(Z)&(host(X)=host(Z)&(?[W0,X0]: (~s(host(X))=host(X0)&(~host(X)=host(X0)&(?[Y0]: (((((~host(X0)=host(Z)&setIn(Z,alive))&setIn(X0,alive))&host(W0)=host(Z))&host(Y0)=host(X0))&(elem(m_Down(Y0),V)&elem(m_Down(W0),queue(host(X0)))))))))))))))))))),
% 0.16/0.33    inference(pre_NNF_transformation,[status(esa)],[f68])).
% 0.16/0.33  fof(f213,plain,(
% 0.16/0.33    ?[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))&(((~index(ldr,host(X))=host(Y)|~index(status,host(X))=norm)&(~index(status,host(X))=wait|~host(Y)=host(index(elid,host(X)))))&(((![Z]: ((leq(host(X),Z)|~leq(s(zero),Z))|(setIn(Z,index(down,host(X)))|Z=host(Y))))&index(status,host(X))=elec_1)&(~leq(nbr_proc,host(X))&(?[Z]: (~s(host(X))=host(Z)&(host(X)=host(Z)&(?[X0]: (~s(host(X))=host(X0)&(~host(X)=host(X0)&(?[W0,Y0]: (((((~host(X0)=host(Z)&setIn(Z,alive))&setIn(X0,alive))&host(W0)=host(Z))&host(Y0)=host(X0))&(elem(m_Down(Y0),V)&elem(m_Down(W0),queue(host(X0))))))))))))))))))),
% 0.16/0.33    inference(miniscoping,[status(esa)],[f212])).
% 0.16/0.33  fof(f214,plain,(
% 0.16/0.33    ((((((((((![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))&(((~index(ldr,host(sk0_5))=host(sk0_6)|~index(status,host(sk0_5))=norm)&(~index(status,host(sk0_5))=wait|~host(sk0_6)=host(index(elid,host(sk0_5)))))&(((![Z]: ((leq(host(sk0_5),Z)|~leq(s(zero),Z))|(setIn(Z,index(down,host(sk0_5)))|Z=host(sk0_6))))&index(status,host(sk0_5))=elec_1)&(~leq(nbr_proc,host(sk0_5))&(~s(host(sk0_5))=host(sk0_7)&(host(sk0_5)=host(sk0_7)&(~s(host(sk0_5))=host(sk0_8)&(~host(sk0_5)=host(sk0_8)&(((((~host(sk0_8)=host(sk0_7)&setIn(sk0_7,alive))&setIn(sk0_8,alive))&host(sk0_9)=host(sk0_7))&host(sk0_10)=host(sk0_8))&(elem(m_Down(sk0_10),sk0_4)&elem(m_Down(sk0_9),queue(host(sk0_8)))))))))))))))),
% 0.16/0.33    inference(skolemization,[status(esa)],[f213])).
% 0.16/0.33  fof(f217,plain,(
% 0.16/0.33    ![X0,X1]: (~elem(m_Down(X0),queue(host(X1)))|~host(X0)=host(X1))),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f222,plain,(
% 0.16/0.33    ![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.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f223,plain,(
% 0.16/0.33    queue(host(sk0_5))=cons(m_Down(sk0_6),sk0_4)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f224,plain,(
% 0.16/0.33    setIn(sk0_5,alive)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f232,plain,(
% 0.16/0.33    host(sk0_5)=host(sk0_7)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f237,plain,(
% 0.16/0.33    setIn(sk0_8,alive)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f238,plain,(
% 0.16/0.33    host(sk0_9)=host(sk0_7)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f239,plain,(
% 0.16/0.33    host(sk0_10)=host(sk0_8)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f240,plain,(
% 0.16/0.33    elem(m_Down(sk0_10),sk0_4)),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f241,plain,(
% 0.16/0.33    elem(m_Down(sk0_9),queue(host(sk0_8)))),
% 0.16/0.33    inference(cnf_transformation,[status(esa)],[f214])).
% 0.16/0.33  fof(f278,plain,(
% 0.16/0.33    host(sk0_9)=host(sk0_5)),
% 0.16/0.33    inference(forward_demodulation,[status(thm)],[f232,f238])).
% 0.16/0.33  fof(f320,plain,(
% 0.16/0.33    ![X0]: (~elem(m_Down(sk0_9),queue(host(X0)))|~host(sk0_5)=host(X0))),
% 0.16/0.33    inference(paramodulation,[status(thm)],[f278,f217])).
% 0.16/0.33  fof(f341,plain,(
% 0.16/0.33    spl0_11 <=> setIn(sk0_8,alive)),
% 0.16/0.33    introduced(split_symbol_definition)).
% 0.16/0.33  fof(f343,plain,(
% 0.16/0.33    ~setIn(sk0_8,alive)|spl0_11),
% 0.16/0.33    inference(component_clause,[status(thm)],[f341])).
% 0.16/0.33  fof(f352,plain,(
% 0.16/0.33    spl0_14 <=> setIn(sk0_5,alive)),
% 0.16/0.33    introduced(split_symbol_definition)).
% 0.16/0.33  fof(f354,plain,(
% 0.16/0.33    ~setIn(sk0_5,alive)|spl0_14),
% 0.16/0.33    inference(component_clause,[status(thm)],[f352])).
% 0.16/0.33  fof(f397,plain,(
% 0.16/0.33    $false|spl0_14),
% 0.16/0.33    inference(forward_subsumption_resolution,[status(thm)],[f354,f224])).
% 0.16/0.33  fof(f398,plain,(
% 0.16/0.33    spl0_14),
% 0.16/0.33    inference(contradiction_clause,[status(thm)],[f397])).
% 0.16/0.33  fof(f501,plain,(
% 0.16/0.33    $false|spl0_11),
% 0.16/0.33    inference(forward_subsumption_resolution,[status(thm)],[f343,f237])).
% 0.16/0.33  fof(f502,plain,(
% 0.16/0.33    spl0_11),
% 0.16/0.33    inference(contradiction_clause,[status(thm)],[f501])).
% 0.16/0.33  fof(f577,plain,(
% 0.16/0.33    spl0_47 <=> host(X0)=host(sk0_5)|~setIn(X0,alive)|~host(X1)=host(X0)|~elem(m_Down(X1),queue(host(sk0_5)))|~elem(m_Down(sk0_9),queue(host(X0)))),
% 0.16/0.33    introduced(split_symbol_definition)).
% 0.16/0.33  fof(f578,plain,(
% 0.16/0.33    ![X0,X1]: (host(X0)=host(sk0_5)|~setIn(X0,alive)|~host(X1)=host(X0)|~elem(m_Down(X1),queue(host(sk0_5)))|~elem(m_Down(sk0_9),queue(host(X0)))|~spl0_47)),
% 0.16/0.33    inference(component_clause,[status(thm)],[f577])).
% 0.16/0.33  fof(f580,plain,(
% 0.16/0.33    ![X0,X1]: (host(X0)=host(sk0_5)|~setIn(sk0_5,alive)|~setIn(X0,alive)|~host(X1)=host(X0)|~elem(m_Down(X1),queue(host(sk0_5)))|~elem(m_Down(sk0_9),queue(host(X0))))),
% 0.16/0.33    inference(resolution,[status(thm)],[f222,f278])).
% 0.16/0.33  fof(f581,plain,(
% 0.16/0.33    spl0_47|~spl0_14),
% 0.16/0.33    inference(split_clause,[status(thm)],[f580,f577,f352])).
% 0.16/0.33  fof(f636,plain,(
% 0.16/0.33    ![X0,X1]: (~setIn(X0,alive)|~host(X1)=host(X0)|~elem(m_Down(X1),queue(host(sk0_5)))|~elem(m_Down(sk0_9),queue(host(X0)))|~spl0_47)),
% 0.16/0.33    inference(forward_subsumption_resolution,[status(thm)],[f578,f320])).
% 0.16/0.33  fof(f638,plain,(
% 0.16/0.33    spl0_56 <=> elem(m_Down(sk0_10),queue(host(sk0_5)))),
% 0.16/0.33    introduced(split_symbol_definition)).
% 0.16/0.33  fof(f640,plain,(
% 0.16/0.33    ~elem(m_Down(sk0_10),queue(host(sk0_5)))|spl0_56),
% 0.16/0.33    inference(component_clause,[status(thm)],[f638])).
% 0.16/0.33  fof(f641,plain,(
% 0.16/0.33    spl0_57 <=> elem(m_Down(sk0_9),queue(host(sk0_8)))),
% 0.16/0.33    introduced(split_symbol_definition)).
% 0.16/0.33  fof(f643,plain,(
% 0.16/0.33    ~elem(m_Down(sk0_9),queue(host(sk0_8)))|spl0_57),
% 0.16/0.33    inference(component_clause,[status(thm)],[f641])).
% 0.16/0.33  fof(f644,plain,(
% 0.16/0.33    ~setIn(sk0_8,alive)|~elem(m_Down(sk0_10),queue(host(sk0_5)))|~elem(m_Down(sk0_9),queue(host(sk0_8)))|~spl0_47),
% 0.16/0.57    inference(resolution,[status(thm)],[f636,f239])).
% 0.16/0.57  fof(f645,plain,(
% 0.16/0.57    ~spl0_11|~spl0_56|~spl0_57|~spl0_47),
% 0.16/0.57    inference(split_clause,[status(thm)],[f644,f341,f638,f641,f577])).
% 0.16/0.57  fof(f679,plain,(
% 0.16/0.57    $false|spl0_57),
% 0.16/0.57    inference(forward_subsumption_resolution,[status(thm)],[f643,f241])).
% 0.16/0.57  fof(f680,plain,(
% 0.16/0.57    spl0_57),
% 0.16/0.57    inference(contradiction_clause,[status(thm)],[f679])).
% 0.16/0.57  fof(f883,plain,(
% 0.16/0.57    ![X0]: (elem(X0,queue(host(sk0_5)))|~elem(X0,sk0_4))),
% 0.16/0.57    inference(paramodulation,[status(thm)],[f223,f142])).
% 0.16/0.57  fof(f1146,plain,(
% 0.16/0.57    ~elem(m_Down(sk0_10),sk0_4)|spl0_56),
% 0.16/0.57    inference(resolution,[status(thm)],[f883,f640])).
% 0.16/0.57  fof(f1147,plain,(
% 0.16/0.57    $false|spl0_56),
% 0.16/0.57    inference(forward_subsumption_resolution,[status(thm)],[f1146,f240])).
% 0.16/0.57  fof(f1148,plain,(
% 0.16/0.57    spl0_56),
% 0.16/0.57    inference(contradiction_clause,[status(thm)],[f1147])).
% 0.16/0.57  fof(f1149,plain,(
% 0.16/0.57    $false),
% 0.16/0.57    inference(sat_refutation,[status(thm)],[f398,f502,f581,f645,f680,f1148])).
% 0.16/0.57  % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.57  % Elapsed time: 0.048220 seconds
% 0.16/0.57  % CPU time: 0.034909 seconds
% 0.16/0.57  % Memory used: 4.452 MB
%------------------------------------------------------------------------------