TSTP Solution File: GRA002+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRA002+3 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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:09:27 EDT 2023
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRA002+3 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:00:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.21/0.52 % Refutation found
% 0.21/0.52 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.52 % SZS output start CNFRefutation for theBenchmark
% 0.21/0.52 fof(f9,axiom,(
% 0.21/0.52 (! [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.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f11,axiom,(
% 0.21/0.52 (! [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.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f15,axiom,(
% 0.21/0.52 (! [V1,V2,P] :( path(V1,V2,P)=> number_of_in(sequential_pairs,P) = minus(length_of(P),n1) ) )),
% 0.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f16,axiom,(
% 0.21/0.52 (! [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.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f17,axiom,(
% 0.21/0.52 (! [Things,InThese] : less_or_equal(number_of_in(Things,InThese),number_of_in(Things,graph)) )),
% 0.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f18,lemma,(
% 0.21/0.52 ( complete=> (! [V1,V2,E1,E2,P] :( ( shortest_path(V1,V2,P)& precedes(E1,E2,P)& sequential(E1,E2) )=> (? [E3] : triangle(E1,E2,E3) )) )) ),
% 0.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f19,conjecture,(
% 0.21/0.52 ( complete=> (! [P,V1,V2] :( shortest_path(V1,V2,P)=> less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph)) ) )) ),
% 0.21/0.52 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.52 fof(f20,negated_conjecture,(
% 0.21/0.52 ~(( complete=> (! [P,V1,V2] :( shortest_path(V1,V2,P)=> less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph)) ) )) )),
% 0.21/0.52 inference(negated_conjecture,[status(cth)],[f19])).
% 0.21/0.52 fof(f68,plain,(
% 0.21/0.52 ![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.21/0.52 inference(pre_NNF_transformation,[status(esa)],[f9])).
% 0.21/0.52 fof(f69,plain,(
% 0.21/0.52 ![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.21/0.52 inference(miniscoping,[status(esa)],[f68])).
% 0.21/0.52 fof(f70,plain,(
% 0.21/0.52 ![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.21/0.52 inference(cnf_transformation,[status(esa)],[f69])).
% 0.21/0.52 fof(f81,plain,(
% 0.21/0.52 ![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.21/0.52 inference(pre_NNF_transformation,[status(esa)],[f11])).
% 0.21/0.52 fof(f82,plain,(
% 0.21/0.52 ![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.21/0.52 inference(NNF_transformation,[status(esa)],[f81])).
% 0.21/0.52 fof(f83,plain,(
% 0.21/0.52 (![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.21/0.52 inference(miniscoping,[status(esa)],[f82])).
% 0.21/0.52 fof(f84,plain,(
% 0.21/0.52 (![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,sk0_5(SP,V2,V1))&~less_or_equal(length_of(SP),length_of(sk0_5(SP,V2,V1)))))))),
% 0.21/0.52 inference(skolemization,[status(esa)],[f83])).
% 0.21/0.52 fof(f85,plain,(
% 0.21/0.52 ![X0,X1,X2]: (~shortest_path(X0,X1,X2)|path(X0,X1,X2))),
% 0.21/0.52 inference(cnf_transformation,[status(esa)],[f84])).
% 0.21/0.52 fof(f106,plain,(
% 0.21/0.52 ![V1,V2,P]: (~path(V1,V2,P)|number_of_in(sequential_pairs,P)=minus(length_of(P),n1))),
% 0.21/0.52 inference(pre_NNF_transformation,[status(esa)],[f15])).
% 0.21/0.54 fof(f107,plain,(
% 0.21/0.54 ![P]: ((![V1,V2]: ~path(V1,V2,P))|number_of_in(sequential_pairs,P)=minus(length_of(P),n1))),
% 0.21/0.54 inference(miniscoping,[status(esa)],[f106])).
% 0.21/0.54 fof(f108,plain,(
% 0.21/0.54 ![X0,X1,X2]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=minus(length_of(X2),n1))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f107])).
% 0.21/0.54 fof(f109,plain,(
% 0.21/0.54 ![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.21/0.54 inference(pre_NNF_transformation,[status(esa)],[f16])).
% 0.21/0.54 fof(f110,plain,(
% 0.21/0.54 ![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.21/0.54 inference(miniscoping,[status(esa)],[f109])).
% 0.21/0.54 fof(f111,plain,(
% 0.21/0.54 ![P]: (((![V1,V2]: ~path(V1,V2,P))|(((on_path(sk0_6(P),P)&on_path(sk0_7(P),P))&sequential(sk0_6(P),sk0_7(P)))&(![E3]: ~triangle(sk0_6(P),sk0_7(P),E3))))|number_of_in(sequential_pairs,P)=number_of_in(triangles,P))),
% 0.21/0.54 inference(skolemization,[status(esa)],[f110])).
% 0.21/0.54 fof(f112,plain,(
% 0.21/0.54 ![X0,X1,X2]: (~path(X0,X1,X2)|on_path(sk0_6(X2),X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f111])).
% 0.21/0.54 fof(f113,plain,(
% 0.21/0.54 ![X0,X1,X2]: (~path(X0,X1,X2)|on_path(sk0_7(X2),X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f111])).
% 0.21/0.54 fof(f114,plain,(
% 0.21/0.54 ![X0,X1,X2]: (~path(X0,X1,X2)|sequential(sk0_6(X2),sk0_7(X2))|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f111])).
% 0.21/0.54 fof(f115,plain,(
% 0.21/0.54 ![X0,X1,X2,X3]: (~path(X0,X1,X2)|~triangle(sk0_6(X2),sk0_7(X2),X3)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f111])).
% 0.21/0.54 fof(f116,plain,(
% 0.21/0.54 ![X0,X1]: (less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f17])).
% 0.21/0.54 fof(f117,plain,(
% 0.21/0.54 ~complete|(![V1,V2,E1,E2,P]: (((~shortest_path(V1,V2,P)|~precedes(E1,E2,P))|~sequential(E1,E2))|(?[E3]: triangle(E1,E2,E3))))),
% 0.21/0.54 inference(pre_NNF_transformation,[status(esa)],[f18])).
% 0.21/0.54 fof(f118,plain,(
% 0.21/0.54 ~complete|(![E1,E2]: (((![P]: ((![V1,V2]: ~shortest_path(V1,V2,P))|~precedes(E1,E2,P)))|~sequential(E1,E2))|(?[E3]: triangle(E1,E2,E3))))),
% 0.21/0.54 inference(miniscoping,[status(esa)],[f117])).
% 0.21/0.54 fof(f119,plain,(
% 0.21/0.54 ~complete|(![E1,E2]: (((![P]: ((![V1,V2]: ~shortest_path(V1,V2,P))|~precedes(E1,E2,P)))|~sequential(E1,E2))|triangle(E1,E2,sk0_8(E2,E1))))),
% 0.21/0.54 inference(skolemization,[status(esa)],[f118])).
% 0.21/0.54 fof(f120,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4]: (~complete|~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~sequential(X3,X4)|triangle(X3,X4,sk0_8(X4,X3)))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f119])).
% 0.21/0.54 fof(f121,plain,(
% 0.21/0.54 (complete&(?[P,V1,V2]: (shortest_path(V1,V2,P)&~less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph)))))),
% 0.21/0.54 inference(pre_NNF_transformation,[status(esa)],[f20])).
% 0.21/0.54 fof(f122,plain,(
% 0.21/0.54 complete&(?[P]: ((?[V1,V2]: shortest_path(V1,V2,P))&~less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph))))),
% 0.21/0.54 inference(miniscoping,[status(esa)],[f121])).
% 0.21/0.54 fof(f123,plain,(
% 0.21/0.54 complete&(shortest_path(sk0_10,sk0_11,sk0_9)&~less_or_equal(minus(length_of(sk0_9),n1),number_of_in(triangles,graph)))),
% 0.21/0.54 inference(skolemization,[status(esa)],[f122])).
% 0.21/0.54 fof(f124,plain,(
% 0.21/0.54 complete),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f123])).
% 0.21/0.54 fof(f125,plain,(
% 0.21/0.54 shortest_path(sk0_10,sk0_11,sk0_9)),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f123])).
% 0.21/0.54 fof(f126,plain,(
% 0.21/0.54 ~less_or_equal(minus(length_of(sk0_9),n1),number_of_in(triangles,graph))),
% 0.21/0.54 inference(cnf_transformation,[status(esa)],[f123])).
% 0.21/0.54 fof(f137,plain,(
% 0.21/0.54 spl0_0 <=> complete),
% 0.21/0.54 introduced(split_symbol_definition)).
% 0.21/0.54 fof(f139,plain,(
% 0.21/0.54 ~complete|spl0_0),
% 0.21/0.54 inference(component_clause,[status(thm)],[f137])).
% 0.21/0.54 fof(f156,plain,(
% 0.21/0.54 spl0_5 <=> ~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~sequential(X3,X4)|triangle(X3,X4,sk0_8(X4,X3))),
% 0.21/0.54 introduced(split_symbol_definition)).
% 0.21/0.54 fof(f157,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4]: (~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~sequential(X3,X4)|triangle(X3,X4,sk0_8(X4,X3))|~spl0_5)),
% 0.21/0.54 inference(component_clause,[status(thm)],[f156])).
% 0.21/0.54 fof(f159,plain,(
% 0.21/0.54 ~spl0_0|spl0_5),
% 0.21/0.54 inference(split_clause,[status(thm)],[f120,f137,f156])).
% 0.21/0.54 fof(f161,plain,(
% 0.21/0.54 $false|spl0_0),
% 0.21/0.54 inference(forward_subsumption_resolution,[status(thm)],[f139,f124])).
% 0.21/0.54 fof(f162,plain,(
% 0.21/0.54 spl0_0),
% 0.21/0.54 inference(contradiction_clause,[status(thm)],[f161])).
% 0.21/0.54 fof(f166,plain,(
% 0.21/0.54 ![X0,X1,X2]: (number_of_in(sequential_pairs,X0)=minus(length_of(X0),n1)|~shortest_path(X1,X2,X0))),
% 0.21/0.54 inference(resolution,[status(thm)],[f108,f85])).
% 0.21/0.54 fof(f167,plain,(
% 0.21/0.54 number_of_in(sequential_pairs,sk0_9)=minus(length_of(sk0_9),n1)),
% 0.21/0.54 inference(resolution,[status(thm)],[f166,f125])).
% 0.21/0.54 fof(f168,plain,(
% 0.21/0.54 ~less_or_equal(number_of_in(sequential_pairs,sk0_9),number_of_in(triangles,graph))),
% 0.21/0.54 inference(paramodulation,[status(thm)],[f167,f126])).
% 0.21/0.54 fof(f359,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4,X5]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~path(X3,X4,X5)|precedes(sk0_6(X2),sk0_7(X2),X5)|~on_path(sk0_6(X2),X5)|~on_path(sk0_7(X2),X5))),
% 0.21/0.54 inference(resolution,[status(thm)],[f114,f70])).
% 0.21/0.54 fof(f574,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4,X5]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~shortest_path(X3,X4,X5)|~precedes(sk0_6(X2),sk0_7(X2),X5)|~sequential(sk0_6(X2),sk0_7(X2))|~spl0_5)),
% 0.21/0.54 inference(resolution,[status(thm)],[f115,f157])).
% 0.21/0.54 fof(f575,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4,X5]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~shortest_path(X3,X4,X5)|~precedes(sk0_6(X2),sk0_7(X2),X5)|~spl0_5)),
% 0.21/0.54 inference(forward_subsumption_resolution,[status(thm)],[f574,f114])).
% 0.21/0.54 fof(f578,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4,X5,X6]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~path(X3,X4,X2)|precedes(sk0_6(X2),sk0_7(X2),X2)|~on_path(sk0_6(X2),X2)|~path(X5,X6,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2))),
% 0.21/0.54 inference(resolution,[status(thm)],[f359,f113])).
% 0.21/0.54 fof(f579,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4,X5,X6]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~path(X3,X4,X2)|precedes(sk0_6(X2),sk0_7(X2),X2)|~on_path(sk0_6(X2),X2)|~path(X5,X6,X2))),
% 0.21/0.54 inference(duplicate_literals_removal,[status(esa)],[f578])).
% 0.21/0.54 fof(f580,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4,X5,X6]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~path(X3,X4,X2)|precedes(sk0_6(X2),sk0_7(X2),X2)|~path(X5,X6,X2))),
% 0.21/0.54 inference(forward_subsumption_resolution,[status(thm)],[f579,f112])).
% 0.21/0.54 fof(f581,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|precedes(sk0_6(X2),sk0_7(X2),X2)|~shortest_path(X3,X4,X2))),
% 0.21/0.54 inference(resolution,[status(thm)],[f580,f85])).
% 0.21/0.54 fof(f582,plain,(
% 0.21/0.54 ![X0,X1,X2,X3,X4]: (~path(X0,X1,X2)|number_of_in(sequential_pairs,X2)=number_of_in(triangles,X2)|~shortest_path(X3,X4,X2)|~spl0_5)),
% 0.21/0.54 inference(forward_subsumption_resolution,[status(thm)],[f581,f575])).
% 0.21/0.54 fof(f583,plain,(
% 0.21/0.54 spl0_69 <=> ~path(X0,X1,sk0_9)),
% 0.21/0.54 introduced(split_symbol_definition)).
% 0.21/0.54 fof(f584,plain,(
% 0.21/0.54 ![X0,X1]: (~path(X0,X1,sk0_9)|~spl0_69)),
% 0.21/0.54 inference(component_clause,[status(thm)],[f583])).
% 0.21/0.54 fof(f586,plain,(
% 0.21/0.54 spl0_70 <=> number_of_in(sequential_pairs,sk0_9)=number_of_in(triangles,sk0_9)),
% 0.21/0.54 introduced(split_symbol_definition)).
% 0.21/0.54 fof(f587,plain,(
% 0.21/0.54 number_of_in(sequential_pairs,sk0_9)=number_of_in(triangles,sk0_9)|~spl0_70),
% 0.21/0.54 inference(component_clause,[status(thm)],[f586])).
% 0.21/0.54 fof(f589,plain,(
% 0.21/0.54 ![X0,X1]: (~path(X0,X1,sk0_9)|number_of_in(sequential_pairs,sk0_9)=number_of_in(triangles,sk0_9)|~spl0_5)),
% 0.21/0.54 inference(resolution,[status(thm)],[f582,f125])).
% 0.21/0.54 fof(f590,plain,(
% 0.21/0.54 spl0_69|spl0_70|~spl0_5),
% 0.21/0.54 inference(split_clause,[status(thm)],[f589,f583,f586,f156])).
% 0.21/0.54 fof(f591,plain,(
% 0.21/0.54 ![X0,X1]: (~shortest_path(X0,X1,sk0_9)|~spl0_69)),
% 0.21/0.54 inference(resolution,[status(thm)],[f584,f85])).
% 0.21/0.54 fof(f592,plain,(
% 0.21/0.54 $false|~spl0_69),
% 0.21/0.54 inference(backward_subsumption_resolution,[status(thm)],[f125,f591])).
% 0.21/0.54 fof(f593,plain,(
% 0.21/0.54 ~spl0_69),
% 0.21/0.54 inference(contradiction_clause,[status(thm)],[f592])).
% 0.21/0.54 fof(f601,plain,(
% 0.21/0.54 less_or_equal(number_of_in(sequential_pairs,sk0_9),number_of_in(triangles,graph))|~spl0_70),
% 0.21/0.54 inference(paramodulation,[status(thm)],[f587,f116])).
% 0.21/0.54 fof(f602,plain,(
% 0.21/0.54 $false|~spl0_70),
% 0.21/0.54 inference(forward_subsumption_resolution,[status(thm)],[f601,f168])).
% 0.21/0.54 fof(f603,plain,(
% 0.21/0.54 ~spl0_70),
% 0.21/0.54 inference(contradiction_clause,[status(thm)],[f602])).
% 0.21/0.54 fof(f604,plain,(
% 0.21/0.54 $false),
% 0.21/0.54 inference(sat_refutation,[status(thm)],[f159,f162,f590,f593,f603])).
% 0.21/0.54 % SZS output end CNFRefutation for theBenchmark.p
% 0.21/0.55 % Elapsed time: 0.200258 seconds
% 0.21/0.55 % CPU time: 1.087775 seconds
% 0.21/0.55 % Memory used: 58.017 MB
%------------------------------------------------------------------------------