%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:31:01 PM UTC 2026
% Result : Theorem 0.09s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.51 % Computer : n008.cluster.edu
% 0.09/0.51 % Model : x86_64 x86_64
% 0.09/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.51 % Memory : 8046.5625MB
% 0.09/0.51 % OS : Linux 6.8.0-71-generic
% 0.09/0.51 % CPULimit : 300
% 0.09/0.51 % WCLimit : 300
% 0.09/0.51 % DateTime : Sun Sep 20 18:19:39 UTC 2026
% 0.09/0.51 % CPUTime :
% 0.09/0.52 % Drodi V4.1.1
% 0.09/0.56 % Refutation found
% 0.09/0.56 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.56 % SZS output start CNFRefutation for theBenchmark
% 0.09/0.56 fof(f9,axiom,(
% 0.09/0.56 (! [P,V1,V2] :( path(V1,V2,P)=> (! [E1,E2] :( precedes(E1,E2,P)<= ( on_path(E1,P)& on_path(E2,P)& ( sequential(E1,E2)| (? [E3] :( sequential(E1,E3)& precedes(E3,E2,P) ) )) ) ) )) )),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f11,axiom,(
% 0.09/0.56 (! [V1,V2,SP] :( shortest_path(V1,V2,SP)<=> ( path(V1,V2,SP)& V1 != V2& (! [P] :( path(V1,V2,P)=> less_or_equal(length_of(SP),length_of(P)) ) )) ) )),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f15,axiom,(
% 0.09/0.56 (! [V1,V2,P] :( path(V1,V2,P)=> number_of_in(sequential_pairs,P) = minus(length_of(P),n1) ) )),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f16,axiom,(
% 0.09/0.56 (! [P,V1,V2] :( ( path(V1,V2,P)& (! [E1,E2] :( ( on_path(E1,P)& on_path(E2,P)& sequential(E1,E2) )=> (? [E3] : triangle(E1,E2,E3) )) ))=> number_of_in(sequential_pairs,P) = number_of_in(triangles,P) ) )),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f17,axiom,(
% 0.09/0.56 (! [Things,InThese] : less_or_equal(number_of_in(Things,InThese),number_of_in(Things,graph)) )),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f18,lemma,(
% 0.09/0.56 ( complete=> (! [V1,V2,E1,E2,P] :( ( shortest_path(V1,V2,P)& precedes(E1,E2,P)& sequential(E1,E2) )=> (? [E3] : triangle(E1,E2,E3) )) )) ),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f19,conjecture,(
% 0.09/0.56 ( complete=> (! [P,V1,V2] :( shortest_path(V1,V2,P)=> less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph)) ) )) ),
% 0.09/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.56 fof(f20,negated_conjecture,(
% 0.09/0.56 ~(( complete=> (! [P,V1,V2] :( shortest_path(V1,V2,P)=> less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph)) ) )) )),
% 0.09/0.56 inference(negated_conjecture,[status(cth)],[f19])).
% 0.09/0.56 fof(f68,plain,(
% 0.09/0.56 ![P,V1,V2]: (~path(V1,V2,P)|(![E1,E2]: (precedes(E1,E2,P)|((~on_path(E1,P)|~on_path(E2,P))|(~sequential(E1,E2)&(![E3]: (~sequential(E1,E3)|~precedes(E3,E2,P))))))))),
% 0.09/0.56 inference(pre_NNF_transformation,[status(thm)],[f9])).
% 0.09/0.56 fof(f69,plain,(
% 0.09/0.56 ![P]: ((![V1,V2]: ~path(V1,V2,P))|(![E1,E2]: (precedes(E1,E2,P)|((~on_path(E1,P)|~on_path(E2,P))|(~sequential(E1,E2)&(![E3]: (~sequential(E1,E3)|~precedes(E3,E2,P))))))))),
% 0.09/0.56 inference(miniscoping,[status(thm)],[f68])).
% 0.09/0.56 fof(f70,plain,(
% 0.09/0.56 ![X0,X1,X2,X3,X4]: (~path(X0,X1,X2)|precedes(X3,X4,X2)|~on_path(X3,X2)|~on_path(X4,X2)|~sequential(X3,X4))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f69])).
% 0.09/0.56 fof(f81,plain,(
% 0.09/0.56 ![V1,V2,SP]: (shortest_path(V1,V2,SP)<=>((path(V1,V2,SP)&~V1=V2)&(![P]: (~path(V1,V2,P)|less_or_equal(length_of(SP),length_of(P))))))),
% 0.09/0.56 inference(pre_NNF_transformation,[status(thm)],[f11])).
% 0.09/0.56 fof(f82,plain,(
% 0.09/0.56 ![V1,V2,SP]: ((~shortest_path(V1,V2,SP)|((path(V1,V2,SP)&~V1=V2)&(![P]: (~path(V1,V2,P)|less_or_equal(length_of(SP),length_of(P))))))&(shortest_path(V1,V2,SP)|((~path(V1,V2,SP)|V1=V2)|(?[P]: (path(V1,V2,P)&~less_or_equal(length_of(SP),length_of(P)))))))),
% 0.09/0.56 inference(NNF_transformation,[status(thm)],[f81])).
% 0.09/0.56 fof(f83,plain,(
% 0.09/0.56 (![V1,V2,SP]: (~shortest_path(V1,V2,SP)|((path(V1,V2,SP)&~V1=V2)&(![P]: (~path(V1,V2,P)|less_or_equal(length_of(SP),length_of(P)))))))&(![V1,V2,SP]: (shortest_path(V1,V2,SP)|((~path(V1,V2,SP)|V1=V2)|(?[P]: (path(V1,V2,P)&~less_or_equal(length_of(SP),length_of(P)))))))),
% 0.09/0.56 inference(miniscoping,[status(thm)],[f82])).
% 0.09/0.56 fof(f84,plain,(
% 0.09/0.56 (![V1,V2,SP]: (~shortest_path(V1,V2,SP)|((path(V1,V2,SP)&~V1=V2)&(![P]: (~path(V1,V2,P)|less_or_equal(length_of(SP),length_of(P)))))))&(![V1,V2,SP]: (shortest_path(V1,V2,SP)|((~path(V1,V2,SP)|V1=V2)|(path(V1,V2,sK5_skl(SP,V2,V1))&~less_or_equal(length_of(SP),length_of(sK5_skl(SP,V2,V1)))))))),
% 0.09/0.56 inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl]),skolemize(P,sK5_skl(SP,V2,V1))],[f83])).
% 0.09/0.56 fof(f85,plain,(
% 0.09/0.56 ![X0,X1,X2]: (~shortest_path(X0,X1,X2)|path(X0,X1,X2))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f84])).
% 0.09/0.56 fof(f106,plain,(
% 0.09/0.56 ![V1,V2,P]: (~path(V1,V2,P)|number_of_in(sequential_pairs,P)=minus(length_of(P),n1))),
% 0.09/0.56 inference(pre_NNF_transformation,[status(thm)],[f15])).
% 0.09/0.56 fof(f107,plain,(
% 0.09/0.56 ![P]: ((![V1,V2]: ~path(V1,V2,P))|number_of_in(sequential_pairs,P)=minus(length_of(P),n1))),
% 0.09/0.56 inference(miniscoping,[status(thm)],[f106])).
% 0.09/0.56 fof(f108,plain,(
% 0.09/0.56 ![X0,X1,X2]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=minus(length_of(X2),n1))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f107])).
% 0.09/0.56 fof(f109,plain,(
% 0.09/0.56 ![P,V1,V2]: ((~path(V1,V2,P)|(?[E1,E2]: (((on_path(E1,P)&on_path(E2,P))&sequential(E1,E2))&(![E3]: ~triangle(E1,E2,E3)))))|number_of_in(sequential_pairs,P)=number_of_in(triangles,P))),
% 0.09/0.56 inference(pre_NNF_transformation,[status(thm)],[f16])).
% 0.09/0.56 fof(f110,plain,(
% 0.09/0.56 ![P]: (((![V1,V2]: ~path(V1,V2,P))|(?[E1,E2]: (((on_path(E1,P)&on_path(E2,P))&sequential(E1,E2))&(![E3]: ~triangle(E1,E2,E3)))))|number_of_in(sequential_pairs,P)=number_of_in(triangles,P))),
% 0.09/0.56 inference(miniscoping,[status(thm)],[f109])).
% 0.09/0.56 fof(f111,plain,(
% 0.09/0.56 ![P]: (((![V1,V2]: ~path(V1,V2,P))|(((on_path(sK6_skl(P),P)&on_path(sK7_skl(P),P))&sequential(sK6_skl(P),sK7_skl(P)))&(![E3]: ~triangle(sK6_skl(P),sK7_skl(P),E3))))|number_of_in(sequential_pairs,P)=number_of_in(triangles,P))),
% 0.09/0.56 inference(skolemize,[status(esa),new_symbols(skolem,[sK6_skl,sK7_skl]),skolemize(E1,sK6_skl(P)),skolemize(E2,sK7_skl(P))],[f110])).
% 0.09/0.56 fof(f112,plain,(
% 0.09/0.56 ![X0,X1,X2]: (~path(X0,X1,X2)|on_path(sK6_skl(X2),X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f111])).
% 0.09/0.56 fof(f113,plain,(
% 0.09/0.56 ![X0,X1,X2]: (~path(X0,X1,X2)|on_path(sK7_skl(X2),X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f111])).
% 0.09/0.56 fof(f114,plain,(
% 0.09/0.56 ![X0,X1,X2]: (~path(X0,X1,X2)|sequential(sK6_skl(X2),sK7_skl(X2))|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f111])).
% 0.09/0.56 fof(f115,plain,(
% 0.09/0.56 ![X0,X1,X2,X3]: (~path(X0,X1,X2)|~triangle(sK6_skl(X2),sK7_skl(X2),X3)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f111])).
% 0.09/0.56 fof(f116,plain,(
% 0.09/0.56 ![X0,X1]: (less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f17])).
% 0.09/0.56 fof(f117,plain,(
% 0.09/0.56 ~complete|(![V1,V2,E1,E2,P]: (((~shortest_path(V1,V2,P)|~precedes(E1,E2,P))|~sequential(E1,E2))|(?[E3]: triangle(E1,E2,E3))))),
% 0.09/0.56 inference(pre_NNF_transformation,[status(thm)],[f18])).
% 0.09/0.56 fof(f118,plain,(
% 0.09/0.56 ~complete|(![E1,E2]: (((![P]: ((![V1,V2]: ~shortest_path(V1,V2,P))|~precedes(E1,E2,P)))|~sequential(E1,E2))|(?[E3]: triangle(E1,E2,E3))))),
% 0.09/0.56 inference(miniscoping,[status(thm)],[f117])).
% 0.09/0.56 fof(f119,plain,(
% 0.09/0.56 ~complete|(![E1,E2]: (((![P]: ((![V1,V2]: ~shortest_path(V1,V2,P))|~precedes(E1,E2,P)))|~sequential(E1,E2))|triangle(E1,E2,sK8_skl(E2,E1))))),
% 0.09/0.56 inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl]),skolemize(E3,sK8_skl(E2,E1))],[f118])).
% 0.09/0.56 fof(f120,plain,(
% 0.09/0.56 ![X0,X1,X2,X3,X4]: (~complete|~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~sequential(X3,X4)|triangle(X3,X4,sK8_skl(X4,X3)))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f119])).
% 0.09/0.56 fof(f121,plain,(
% 0.09/0.56 (complete&(?[P,V1,V2]: (shortest_path(V1,V2,P)&~less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph)))))),
% 0.09/0.56 inference(pre_NNF_transformation,[status(thm)],[f20])).
% 0.09/0.56 fof(f122,plain,(
% 0.09/0.56 complete&(?[P]: ((?[V1,V2]: shortest_path(V1,V2,P))&~less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph))))),
% 0.09/0.56 inference(miniscoping,[status(thm)],[f121])).
% 0.09/0.56 fof(f123,plain,(
% 0.09/0.56 complete&(shortest_path(sK10_skl,sK11_skl,sK9_skl)&~less_or_equal(minus(length_of(sK9_skl),n1),number_of_in(triangles,graph)))),
% 0.09/0.56 inference(skolemize,[status(esa),new_symbols(skolem,[sK9_skl,sK10_skl,sK11_skl]),skolemize(P,sK9_skl),skolemize(V1,sK10_skl),skolemize(V2,sK11_skl)],[f122])).
% 0.09/0.56 fof(f124,plain,(
% 0.09/0.56 complete),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f123])).
% 0.09/0.56 fof(f125,plain,(
% 0.09/0.56 shortest_path(sK10_skl,sK11_skl,sK9_skl)),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f123])).
% 0.09/0.56 fof(f126,plain,(
% 0.09/0.56 ~less_or_equal(minus(length_of(sK9_skl),n1),number_of_in(triangles,graph))),
% 0.09/0.56 inference(cnf_transformation,[status(thm)],[f123])).
% 0.09/0.56 fof(f142,plain,(
% 0.09/0.56 ![X0,X1,X2,X3,X4]: (~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~sequential(X3,X4)|triangle(X3,X4,sK8_skl(X4,X3)))),
% 0.09/0.56 inference(backward_subsumption_resolution,[status(thm)],[f120,f124])).
% 0.09/0.56 fof(f147,plain,(
% 0.09/0.56 path(sK10_skl,sK11_skl,sK9_skl)),
% 0.09/0.56 inference(resolution,[status(thm)],[f85,f125])).
% 0.09/0.56 fof(f148,plain,(
% 0.09/0.56 number_of_in(sequential_pairs,sK9_skl)=minus(length_of(sK9_skl),n1)),
% 0.09/0.56 inference(resolution,[status(thm)],[f147,f108])).
% 0.09/0.56 fof(f149,plain,(
% 0.09/0.56 ~less_or_equal(number_of_in(sequential_pairs,sK9_skl),number_of_in(triangles,graph))),
% 0.09/0.56 inference(backward_demodulation,[status(thm)],[f148,f126])).
% 0.09/0.56 fof(f158,plain,(
% 0.09/0.56 on_path(sK6_skl(sK9_skl),sK9_skl)|number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)),
% 0.09/0.56 inference(resolution,[status(thm)],[f112,f147])).
% 0.09/0.56 fof(f159,plain,(
% 0.09/0.56 on_path(sK7_skl(sK9_skl),sK9_skl)|number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)),
% 0.09/0.56 inference(resolution,[status(thm)],[f113,f147])).
% 0.09/0.56 fof(f160,plain,(
% 0.09/0.56 sequential(sK6_skl(sK9_skl),sK7_skl(sK9_skl))|number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)),
% 0.09/0.56 inference(resolution,[status(thm)],[f114,f147])).
% 0.09/0.56 fof(f163,plain,(
% 0.09/0.56 ![X0,X1,X2]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|~path(X0,X1,sK9_skl)|precedes(X2,sK7_skl(sK9_skl),sK9_skl)|~on_path(X2,sK9_skl)|~sequential(X2,sK7_skl(sK9_skl)))),
% 0.09/0.56 inference(resolution,[status(thm)],[f159,f70])).
% 0.09/0.56 fof(f170,plain,(
% 0.09/0.56 ![X0,X1,X2]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|~shortest_path(X0,X1,X2)|~precedes(sK6_skl(sK9_skl),sK7_skl(sK9_skl),X2)|triangle(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK8_skl(sK7_skl(sK9_skl),sK6_skl(sK9_skl))))),
% 0.09/0.56 inference(resolution,[status(thm)],[f160,f142])).
% 0.09/0.56 fof(f174,plain,(
% 0.09/0.56 ![X0]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|precedes(X0,sK7_skl(sK9_skl),sK9_skl)|~on_path(X0,sK9_skl)|~sequential(X0,sK7_skl(sK9_skl)))),
% 0.09/0.56 inference(resolution,[status(thm)],[f163,f147])).
% 0.09/0.56 fof(f181,plain,(
% 0.09/0.56 number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|precedes(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK9_skl)|~on_path(sK6_skl(sK9_skl),sK9_skl)|number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)),
% 0.09/0.56 inference(resolution,[status(thm)],[f174,f160])).
% 0.09/0.56 fof(f182,plain,(
% 0.09/0.56 number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|precedes(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK9_skl)|~on_path(sK6_skl(sK9_skl),sK9_skl)),
% 0.09/0.56 inference(duplicate_literals_removal,[status(thm)],[f181])).
% 0.09/0.56 fof(f183,plain,(
% 0.09/0.56 number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|precedes(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK9_skl)),
% 0.09/0.56 inference(forward_subsumption_resolution,[status(thm)],[f182,f158])).
% 0.09/0.56 fof(f184,plain,(
% 0.09/0.56 ![X0,X1]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|~shortest_path(X0,X1,sK9_skl)|triangle(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK8_skl(sK7_skl(sK9_skl),sK6_skl(sK9_skl))))),
% 0.09/0.56 inference(resolution,[status(thm)],[f183,f170])).
% 0.09/0.56 fof(f187,plain,(
% 0.09/0.56 ![X0,X1]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|~shortest_path(X0,X1,sK9_skl)|triangle(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK8_skl(sK7_skl(sK9_skl),sK6_skl(sK9_skl))))),
% 0.09/0.56 inference(duplicate_literals_removal,[status(thm)],[f184])).
% 0.09/0.56 fof(f188,plain,(
% 0.09/0.56 number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|triangle(sK6_skl(sK9_skl),sK7_skl(sK9_skl),sK8_skl(sK7_skl(sK9_skl),sK6_skl(sK9_skl)))),
% 0.09/0.56 inference(resolution,[status(thm)],[f187,f125])).
% 0.09/0.56 fof(f191,plain,(
% 0.09/0.56 ![X0,X1]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|~path(X0,X1,sK9_skl)|number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl))),
% 0.09/0.56 inference(resolution,[status(thm)],[f188,f115])).
% 0.09/0.56 fof(f192,plain,(
% 0.09/0.56 ![X0,X1]: (number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)|~path(X0,X1,sK9_skl))),
% 0.09/0.56 inference(duplicate_literals_removal,[status(thm)],[f191])).
% 0.18/0.57 fof(f193,plain,(
% 0.18/0.57 number_of_in(sequential_pairs,sK9_skl)=number_of_in(triangles,sK9_skl)),
% 0.18/0.57 inference(resolution,[status(thm)],[f192,f147])).
% 0.18/0.57 fof(f213,plain,(
% 0.18/0.57 less_or_equal(number_of_in(sequential_pairs,sK9_skl),number_of_in(triangles,graph))),
% 0.18/0.57 inference(paramodulation,[status(thm)],[f193,f116])).
% 0.18/0.57 fof(f214,plain,(
% 0.18/0.57 $false),
% 0.18/0.57 inference(forward_subsumption_resolution,[status(thm)],[f213,f149])).
% 0.18/0.57 % SZS output end CNFRefutation for theBenchmark.p
% 0.18/0.58 % Elapsed time: 0.067039 seconds
% 0.18/0.58 % CPU time: 0.229386 seconds
% 0.18/0.58 % Total memory used: 84.969 MB
% 0.18/0.58 % Net memory used: 84.776 MB
%------------------------------------------------------------------------------