TSTP Solution File: SWV455+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV455+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 11:24:52 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % Drodi V3.5.1
% 0.20/0.52 % Refutation found
% 0.20/0.52 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.52 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.52 fof(f47,axiom,(
% 0.20/0.52 (! [X,Y,Q] :( elem(X,cons(Y,Q))<=> ( X = Y| elem(X,Q) ) ) )),
% 0.20/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.52 fof(f67,conjecture,(
% 0.20/0.52 (! [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 )=> (! [Z] :( host(X) != host(Z)=> (! [W0,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(W0),V)& elem(m_Down(Y0),queue(host(Z))) ) ) )) )) )) ) ) ) ) )),
% 0.20/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.52 fof(f68,negated_conjecture,(
% 0.20/0.52 ~((! [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 )=> (! [Z] :( host(X) != host(Z)=> (! [W0,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(W0),V)& elem(m_Down(Y0),queue(host(Z))) ) ) )) )) )) ) ) ) ) ))),
% 0.20/0.52 inference(negated_conjecture,[status(cth)],[f67])).
% 0.20/0.52 fof(f138,plain,(
% 0.20/0.52 ![X,Y,Q]: ((~elem(X,cons(Y,Q))|(X=Y|elem(X,Q)))&(elem(X,cons(Y,Q))|(~X=Y&~elem(X,Q))))),
% 0.20/0.52 inference(NNF_transformation,[status(esa)],[f47])).
% 0.20/0.52 fof(f139,plain,(
% 0.20/0.52 (![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.20/0.52 inference(miniscoping,[status(esa)],[f138])).
% 0.20/0.52 fof(f142,plain,(
% 0.20/0.52 ![X0,X1,X2]: (elem(X0,cons(X1,X2))|~elem(X0,X2))),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f139])).
% 0.20/0.52 fof(f212,plain,(
% 0.20/0.52 (?[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)&(?[Z]: (~host(X)=host(Z)&(?[W0,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(W0),V)&elem(m_Down(Y0),queue(host(Z))))))))))))))))),
% 0.20/0.52 inference(pre_NNF_transformation,[status(esa)],[f68])).
% 0.20/0.52 fof(f213,plain,(
% 0.20/0.52 ?[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)&(?[Z]: (~host(X)=host(Z)&(?[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(W0),V)&elem(m_Down(Y0),queue(host(Z)))))))))))))))),
% 0.20/0.52 inference(miniscoping,[status(esa)],[f212])).
% 0.20/0.52 fof(f214,plain,(
% 0.20/0.52 ((((((((((![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)))))&((((~leq(host(sk0_5),sk0_7)&leq(s(zero),sk0_7))&(~setIn(sk0_7,index(down,host(sk0_5)))&~sk0_7=host(sk0_6)))|~index(status,host(sk0_5))=elec_1)&(~host(sk0_5)=host(sk0_8)&(host(sk0_5)=host(sk0_9)&(((((~host(sk0_9)=host(sk0_8)&setIn(sk0_8,alive))&setIn(sk0_9,alive))&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.20/0.52 inference(skolemization,[status(esa)],[f213])).
% 0.20/0.52 fof(f217,plain,(
% 0.20/0.52 ![X0,X1]: (~elem(m_Down(X0),queue(host(X1)))|~host(X0)=host(X1))),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f222,plain,(
% 0.20/0.52 ![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.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f223,plain,(
% 0.20/0.52 queue(host(sk0_5))=cons(m_Down(sk0_6),sk0_4)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f224,plain,(
% 0.20/0.52 setIn(sk0_5,alive)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f233,plain,(
% 0.20/0.52 host(sk0_5)=host(sk0_9)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f235,plain,(
% 0.20/0.52 setIn(sk0_8,alive)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f237,plain,(
% 0.20/0.52 host(sk0_10)=host(sk0_8)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f238,plain,(
% 0.20/0.52 host(sk0_11)=host(sk0_9)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f239,plain,(
% 0.20/0.52 elem(m_Down(sk0_10),sk0_4)),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f240,plain,(
% 0.20/0.52 elem(m_Down(sk0_11),queue(host(sk0_8)))),
% 0.20/0.52 inference(cnf_transformation,[status(esa)],[f214])).
% 0.20/0.52 fof(f283,plain,(
% 0.20/0.52 host(sk0_11)=host(sk0_5)),
% 0.20/0.52 inference(forward_demodulation,[status(thm)],[f233,f238])).
% 0.20/0.52 fof(f305,plain,(
% 0.20/0.52 ![X0]: (~elem(m_Down(sk0_11),queue(host(X0)))|~host(sk0_5)=host(X0))),
% 0.20/0.52 inference(paramodulation,[status(thm)],[f283,f217])).
% 0.20/0.52 fof(f315,plain,(
% 0.20/0.52 spl0_9 <=> setIn(sk0_5,alive)),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f317,plain,(
% 0.20/0.52 ~setIn(sk0_5,alive)|spl0_9),
% 0.20/0.52 inference(component_clause,[status(thm)],[f315])).
% 0.20/0.52 fof(f326,plain,(
% 0.20/0.52 spl0_12 <=> setIn(sk0_8,alive)),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f328,plain,(
% 0.20/0.52 ~setIn(sk0_8,alive)|spl0_12),
% 0.20/0.52 inference(component_clause,[status(thm)],[f326])).
% 0.20/0.52 fof(f438,plain,(
% 0.20/0.52 $false|spl0_9),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f317,f224])).
% 0.20/0.52 fof(f439,plain,(
% 0.20/0.52 spl0_9),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f438])).
% 0.20/0.52 fof(f453,plain,(
% 0.20/0.52 spl0_34 <=> host(X0)=host(sk0_5)|~setIn(X0,alive)|~host(X1)=host(X0)|~elem(m_Down(X1),queue(host(sk0_5)))|~elem(m_Down(sk0_11),queue(host(X0)))),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f454,plain,(
% 0.20/0.52 ![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_11),queue(host(X0)))|~spl0_34)),
% 0.20/0.52 inference(component_clause,[status(thm)],[f453])).
% 0.20/0.52 fof(f456,plain,(
% 0.20/0.52 ![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_11),queue(host(X0))))),
% 0.20/0.52 inference(resolution,[status(thm)],[f222,f283])).
% 0.20/0.52 fof(f457,plain,(
% 0.20/0.52 spl0_34|~spl0_9),
% 0.20/0.52 inference(split_clause,[status(thm)],[f456,f453,f315])).
% 0.20/0.52 fof(f525,plain,(
% 0.20/0.52 ![X0,X1]: (~setIn(X0,alive)|~host(X1)=host(X0)|~elem(m_Down(X1),queue(host(sk0_5)))|~elem(m_Down(sk0_11),queue(host(X0)))|~spl0_34)),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f454,f305])).
% 0.20/0.52 fof(f526,plain,(
% 0.20/0.52 $false|spl0_12),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f328,f235])).
% 0.20/0.52 fof(f527,plain,(
% 0.20/0.52 spl0_12),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f526])).
% 0.20/0.52 fof(f622,plain,(
% 0.20/0.52 spl0_59 <=> elem(m_Down(sk0_10),queue(host(sk0_5)))),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f624,plain,(
% 0.20/0.52 ~elem(m_Down(sk0_10),queue(host(sk0_5)))|spl0_59),
% 0.20/0.52 inference(component_clause,[status(thm)],[f622])).
% 0.20/0.52 fof(f625,plain,(
% 0.20/0.52 spl0_60 <=> elem(m_Down(sk0_11),queue(host(sk0_8)))),
% 0.20/0.52 introduced(split_symbol_definition)).
% 0.20/0.52 fof(f627,plain,(
% 0.20/0.52 ~elem(m_Down(sk0_11),queue(host(sk0_8)))|spl0_60),
% 0.20/0.52 inference(component_clause,[status(thm)],[f625])).
% 0.20/0.52 fof(f628,plain,(
% 0.20/0.52 ~setIn(sk0_8,alive)|~elem(m_Down(sk0_10),queue(host(sk0_5)))|~elem(m_Down(sk0_11),queue(host(sk0_8)))|~spl0_34),
% 0.20/0.52 inference(resolution,[status(thm)],[f525,f237])).
% 0.20/0.52 fof(f629,plain,(
% 0.20/0.52 ~spl0_12|~spl0_59|~spl0_60|~spl0_34),
% 0.20/0.52 inference(split_clause,[status(thm)],[f628,f326,f622,f625,f453])).
% 0.20/0.52 fof(f661,plain,(
% 0.20/0.52 $false|spl0_60),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f627,f240])).
% 0.20/0.52 fof(f662,plain,(
% 0.20/0.52 spl0_60),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f661])).
% 0.20/0.52 fof(f825,plain,(
% 0.20/0.52 ![X0]: (elem(m_Down(sk0_10),cons(X0,sk0_4)))),
% 0.20/0.52 inference(resolution,[status(thm)],[f142,f239])).
% 0.20/0.52 fof(f830,plain,(
% 0.20/0.52 elem(m_Down(sk0_10),queue(host(sk0_5)))),
% 0.20/0.52 inference(paramodulation,[status(thm)],[f223,f825])).
% 0.20/0.52 fof(f831,plain,(
% 0.20/0.52 $false|spl0_59),
% 0.20/0.52 inference(forward_subsumption_resolution,[status(thm)],[f830,f624])).
% 0.20/0.52 fof(f832,plain,(
% 0.20/0.52 spl0_59),
% 0.20/0.52 inference(contradiction_clause,[status(thm)],[f831])).
% 0.20/0.52 fof(f833,plain,(
% 0.20/0.52 $false),
% 0.20/0.52 inference(sat_refutation,[status(thm)],[f439,f457,f527,f629,f662,f832])).
% 0.20/0.52 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.54 % Elapsed time: 0.192756 seconds
% 0.20/0.54 % CPU time: 0.747546 seconds
% 0.20/0.54 % Memory used: 58.359 MB
%------------------------------------------------------------------------------