TSTP Solution File: GRA003+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRA003+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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.10s 0.35s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRA003+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33 % Computer : n013.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Tue May 30 10:32:50 EDT 2023
% 0.10/0.34 % CPUTime :
% 0.10/0.34 % Drodi V3.5.1
% 0.10/0.35 % Refutation found
% 0.10/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.35 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.35 fof(f5,axiom,(
% 0.10/0.35 (! [V1,V2,P] :( path(V1,V2,P)=> ( vertex(V1)& vertex(V2)& (? [E] :( edge(E)& V1 = tail_of(E)& ( ( V2 = head_of(E)& P = path_cons(E,empty) )<~> (? [TP] :( path(head_of(E),V2,TP)& P = path_cons(E,TP) ) )) ) )) ) )),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.35 fof(f6,axiom,(
% 0.10/0.35 (! [V1,V2,P,E] :( ( path(V1,V2,P)& on_path(E,P) )=> ( edge(E)& in_path(head_of(E),P)& in_path(tail_of(E),P) ) ) )),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.35 fof(f10,axiom,(
% 0.10/0.35 (! [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.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.35 fof(f11,axiom,(
% 0.10/0.35 (! [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.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.35 fof(f12,axiom,(
% 0.10/0.35 (! [V1,V2,E1,E2,P] :( ( shortest_path(V1,V2,P)& precedes(E1,E2,P) )=> ( ~ (? [E3] :( tail_of(E3) = tail_of(E1)& head_of(E3) = head_of(E2) ))& ~ precedes(E2,E1,P) ) ) )),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.35 fof(f18,conjecture,(
% 0.10/0.35 (! [V1,V2,E1,E2,P] :( ( shortest_path(V1,V2,P)& precedes(E1,E2,P) )=> ( vertex(V1)& vertex(V2)& V1 != V2& edge(E1)& edge(E2)& E1 != E2& path(V1,V2,P) ) ) )),
% 0.10/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.35 fof(f19,negated_conjecture,(
% 0.10/0.35 ~((! [V1,V2,E1,E2,P] :( ( shortest_path(V1,V2,P)& precedes(E1,E2,P) )=> ( vertex(V1)& vertex(V2)& V1 != V2& edge(E1)& edge(E2)& E1 != E2& path(V1,V2,P) ) ) ))),
% 0.10/0.35 inference(negated_conjecture,[status(cth)],[f18])).
% 0.10/0.35 fof(f37,plain,(
% 0.10/0.35 ![V1,V2,P]: (~path(V1,V2,P)|((vertex(V1)&vertex(V2))&(?[E]: ((edge(E)&V1=tail_of(E))&((V2=head_of(E)&P=path_cons(E,empty))<~>(?[TP]: (path(head_of(E),V2,TP)&P=path_cons(E,TP))))))))),
% 0.10/0.35 inference(pre_NNF_transformation,[status(esa)],[f5])).
% 0.10/0.35 fof(f38,plain,(
% 0.10/0.35 ![V2,P,E]: (pd0_1(E,P,V2)<=>(V2=head_of(E)&P=path_cons(E,empty)))),
% 0.10/0.35 introduced(predicate_definition,[f37])).
% 0.10/0.35 fof(f39,plain,(
% 0.10/0.35 ![V1,V2,P]: (~path(V1,V2,P)|((vertex(V1)&vertex(V2))&(?[E]: ((edge(E)&V1=tail_of(E))&(pd0_1(E,P,V2)<~>(?[TP]: (path(head_of(E),V2,TP)&P=path_cons(E,TP))))))))),
% 0.10/0.35 inference(formula_renaming,[status(thm)],[f37,f38])).
% 0.10/0.35 fof(f40,plain,(
% 0.10/0.35 ![V1,V2,P]: (~path(V1,V2,P)|((vertex(V1)&vertex(V2))&(?[E]: ((edge(E)&V1=tail_of(E))&((pd0_1(E,P,V2)|(?[TP]: (path(head_of(E),V2,TP)&P=path_cons(E,TP))))&(~pd0_1(E,P,V2)|(![TP]: (~path(head_of(E),V2,TP)|~P=path_cons(E,TP)))))))))),
% 0.10/0.35 inference(NNF_transformation,[status(esa)],[f39])).
% 0.10/0.35 fof(f41,plain,(
% 0.10/0.35 ![V1,V2,P]: (~path(V1,V2,P)|((vertex(V1)&vertex(V2))&((edge(sk0_1(P,V2,V1))&V1=tail_of(sk0_1(P,V2,V1)))&((pd0_1(sk0_1(P,V2,V1),P,V2)|(path(head_of(sk0_1(P,V2,V1)),V2,sk0_2(P,V2,V1))&P=path_cons(sk0_1(P,V2,V1),sk0_2(P,V2,V1))))&(~pd0_1(sk0_1(P,V2,V1),P,V2)|(![TP]: (~path(head_of(sk0_1(P,V2,V1)),V2,TP)|~P=path_cons(sk0_1(P,V2,V1),TP))))))))),
% 0.10/0.35 inference(skolemization,[status(esa)],[f40])).
% 0.10/0.35 fof(f42,plain,(
% 0.10/0.35 ![X0,X1,X2]: (~path(X0,X1,X2)|vertex(X0))),
% 0.10/0.35 inference(cnf_transformation,[status(esa)],[f41])).
% 0.10/0.35 fof(f43,plain,(
% 0.10/0.35 ![X0,X1,X2]: (~path(X0,X1,X2)|vertex(X1))),
% 0.10/0.35 inference(cnf_transformation,[status(esa)],[f41])).
% 0.10/0.35 fof(f49,plain,(
% 0.10/0.35 ![V1,V2,P,E]: ((~path(V1,V2,P)|~on_path(E,P))|((edge(E)&in_path(head_of(E),P))&in_path(tail_of(E),P)))),
% 0.10/0.35 inference(pre_NNF_transformation,[status(esa)],[f6])).
% 0.10/0.35 fof(f50,plain,(
% 0.10/0.35 ![P,E]: (((![V1,V2]: ~path(V1,V2,P))|~on_path(E,P))|((edge(E)&in_path(head_of(E),P))&in_path(tail_of(E),P)))),
% 0.10/0.35 inference(miniscoping,[status(esa)],[f49])).
% 0.10/0.35 fof(f51,plain,(
% 0.10/0.35 ![X0,X1,X2,X3]: (~path(X0,X1,X2)|~on_path(X3,X2)|edge(X3))),
% 0.10/0.35 inference(cnf_transformation,[status(esa)],[f50])).
% 0.10/0.35 fof(f71,plain,(
% 0.10/0.35 ![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.10/0.35 inference(pre_NNF_transformation,[status(esa)],[f10])).
% 0.10/0.38 fof(f72,plain,(
% 0.10/0.38 ![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))))&(~sequential(E1,E2)|(![E3]: (~sequential(E1,E3)|~precedes(E3,E2,P)))))))))),
% 0.10/0.38 inference(NNF_transformation,[status(esa)],[f71])).
% 0.10/0.38 fof(f73,plain,(
% 0.10/0.38 ![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))))&(~sequential(E1,E2)|(![E3]: (~sequential(E1,E3)|~precedes(E3,E2,P)))))))))),
% 0.10/0.38 inference(miniscoping,[status(esa)],[f72])).
% 0.10/0.38 fof(f74,plain,(
% 0.10/0.38 ![P]: ((![V1,V2]: ~path(V1,V2,P))|(![E1,E2]: (~precedes(E1,E2,P)|((on_path(E1,P)&on_path(E2,P))&((sequential(E1,E2)|(sequential(E1,sk0_4(E2,E1,P))&precedes(sk0_4(E2,E1,P),E2,P)))&(~sequential(E1,E2)|(![E3]: (~sequential(E1,E3)|~precedes(E3,E2,P)))))))))),
% 0.10/0.38 inference(skolemization,[status(esa)],[f73])).
% 0.10/0.38 fof(f75,plain,(
% 0.10/0.38 ![X0,X1,X2,X3,X4]: (~path(X0,X1,X2)|~precedes(X3,X4,X2)|on_path(X3,X2))),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f74])).
% 0.10/0.38 fof(f76,plain,(
% 0.10/0.38 ![X0,X1,X2,X3,X4]: (~path(X0,X1,X2)|~precedes(X3,X4,X2)|on_path(X4,X2))),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f74])).
% 0.10/0.38 fof(f80,plain,(
% 0.10/0.38 ![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.10/0.38 inference(pre_NNF_transformation,[status(esa)],[f11])).
% 0.10/0.38 fof(f81,plain,(
% 0.10/0.38 ![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.10/0.38 inference(NNF_transformation,[status(esa)],[f80])).
% 0.10/0.38 fof(f82,plain,(
% 0.10/0.38 (![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.10/0.38 inference(miniscoping,[status(esa)],[f81])).
% 0.10/0.38 fof(f83,plain,(
% 0.10/0.38 (![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.10/0.38 inference(skolemization,[status(esa)],[f82])).
% 0.10/0.38 fof(f84,plain,(
% 0.10/0.38 ![X0,X1,X2]: (~shortest_path(X0,X1,X2)|path(X0,X1,X2))),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f83])).
% 0.10/0.38 fof(f85,plain,(
% 0.10/0.38 ![X0,X1,X2]: (~shortest_path(X0,X1,X2)|~X0=X1)),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f83])).
% 0.10/0.38 fof(f89,plain,(
% 0.10/0.38 ![V1,V2,E1,E2,P]: ((~shortest_path(V1,V2,P)|~precedes(E1,E2,P))|((![E3]: (~tail_of(E3)=tail_of(E1)|~head_of(E3)=head_of(E2)))&~precedes(E2,E1,P)))),
% 0.10/0.38 inference(pre_NNF_transformation,[status(esa)],[f12])).
% 0.10/0.38 fof(f90,plain,(
% 0.10/0.38 ![E1,E2,P]: (((![V1,V2]: ~shortest_path(V1,V2,P))|~precedes(E1,E2,P))|((![E3]: (~tail_of(E3)=tail_of(E1)|~head_of(E3)=head_of(E2)))&~precedes(E2,E1,P)))),
% 0.10/0.38 inference(miniscoping,[status(esa)],[f89])).
% 0.10/0.38 fof(f91,plain,(
% 0.10/0.38 ![X0,X1,X2,X3,X4,X5]: (~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~tail_of(X5)=tail_of(X3)|~head_of(X5)=head_of(X4))),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f90])).
% 0.10/0.38 fof(f116,plain,(
% 0.10/0.38 (?[V1,V2,E1,E2,P]: ((shortest_path(V1,V2,P)&precedes(E1,E2,P))&((((((~vertex(V1)|~vertex(V2))|V1=V2)|~edge(E1))|~edge(E2))|E1=E2)|~path(V1,V2,P))))),
% 0.10/0.38 inference(pre_NNF_transformation,[status(esa)],[f19])).
% 0.10/0.38 fof(f117,plain,(
% 0.10/0.38 ((shortest_path(sk0_8,sk0_9,sk0_12)&precedes(sk0_10,sk0_11,sk0_12))&((((((~vertex(sk0_8)|~vertex(sk0_9))|sk0_8=sk0_9)|~edge(sk0_10))|~edge(sk0_11))|sk0_10=sk0_11)|~path(sk0_8,sk0_9,sk0_12)))),
% 0.10/0.38 inference(skolemization,[status(esa)],[f116])).
% 0.10/0.38 fof(f118,plain,(
% 0.10/0.38 shortest_path(sk0_8,sk0_9,sk0_12)),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f117])).
% 0.10/0.38 fof(f119,plain,(
% 0.10/0.38 precedes(sk0_10,sk0_11,sk0_12)),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f117])).
% 0.10/0.38 fof(f120,plain,(
% 0.10/0.38 ~vertex(sk0_8)|~vertex(sk0_9)|sk0_8=sk0_9|~edge(sk0_10)|~edge(sk0_11)|sk0_10=sk0_11|~path(sk0_8,sk0_9,sk0_12)),
% 0.10/0.38 inference(cnf_transformation,[status(esa)],[f117])).
% 0.10/0.38 fof(f150,plain,(
% 0.10/0.38 spl0_5 <=> vertex(sk0_8)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f152,plain,(
% 0.10/0.38 ~vertex(sk0_8)|spl0_5),
% 0.10/0.38 inference(component_clause,[status(thm)],[f150])).
% 0.10/0.38 fof(f153,plain,(
% 0.10/0.38 spl0_6 <=> vertex(sk0_9)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f155,plain,(
% 0.10/0.38 ~vertex(sk0_9)|spl0_6),
% 0.10/0.38 inference(component_clause,[status(thm)],[f153])).
% 0.10/0.38 fof(f156,plain,(
% 0.10/0.38 spl0_7 <=> sk0_8=sk0_9),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f157,plain,(
% 0.10/0.38 sk0_8=sk0_9|~spl0_7),
% 0.10/0.38 inference(component_clause,[status(thm)],[f156])).
% 0.10/0.38 fof(f159,plain,(
% 0.10/0.38 spl0_8 <=> edge(sk0_10)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f161,plain,(
% 0.10/0.38 ~edge(sk0_10)|spl0_8),
% 0.10/0.38 inference(component_clause,[status(thm)],[f159])).
% 0.10/0.38 fof(f162,plain,(
% 0.10/0.38 spl0_9 <=> edge(sk0_11)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f164,plain,(
% 0.10/0.38 ~edge(sk0_11)|spl0_9),
% 0.10/0.38 inference(component_clause,[status(thm)],[f162])).
% 0.10/0.38 fof(f165,plain,(
% 0.10/0.38 spl0_10 <=> sk0_10=sk0_11),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f166,plain,(
% 0.10/0.38 sk0_10=sk0_11|~spl0_10),
% 0.10/0.38 inference(component_clause,[status(thm)],[f165])).
% 0.10/0.38 fof(f168,plain,(
% 0.10/0.38 spl0_11 <=> path(sk0_8,sk0_9,sk0_12)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f170,plain,(
% 0.10/0.38 ~path(sk0_8,sk0_9,sk0_12)|spl0_11),
% 0.10/0.38 inference(component_clause,[status(thm)],[f168])).
% 0.10/0.38 fof(f171,plain,(
% 0.10/0.38 ~spl0_5|~spl0_6|spl0_7|~spl0_8|~spl0_9|spl0_10|~spl0_11),
% 0.10/0.38 inference(split_clause,[status(thm)],[f120,f150,f153,f156,f159,f162,f165,f168])).
% 0.10/0.38 fof(f175,plain,(
% 0.10/0.38 ![X0,X1]: (~shortest_path(X0,X0,X1))),
% 0.10/0.38 inference(destructive_equality_resolution,[status(esa)],[f85])).
% 0.10/0.38 fof(f178,plain,(
% 0.10/0.38 spl0_12 <=> ~path(X0,X1,sk0_12)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f179,plain,(
% 0.10/0.38 ![X0,X1]: (~path(X0,X1,sk0_12)|~spl0_12)),
% 0.10/0.38 inference(component_clause,[status(thm)],[f178])).
% 0.10/0.38 fof(f199,plain,(
% 0.10/0.38 path(sk0_8,sk0_9,sk0_12)),
% 0.10/0.38 inference(resolution,[status(thm)],[f84,f118])).
% 0.10/0.38 fof(f200,plain,(
% 0.10/0.38 vertex(sk0_9)),
% 0.10/0.38 inference(resolution,[status(thm)],[f199,f43])).
% 0.10/0.38 fof(f201,plain,(
% 0.10/0.38 vertex(sk0_8)),
% 0.10/0.38 inference(resolution,[status(thm)],[f199,f42])).
% 0.10/0.38 fof(f204,plain,(
% 0.10/0.38 ![X0,X1,X2,X3,X4]: (~shortest_path(X0,X1,X2)|~precedes(X3,X4,X2)|~head_of(X3)=head_of(X4))),
% 0.10/0.38 inference(equality_resolution,[status(esa)],[f91])).
% 0.10/0.38 fof(f205,plain,(
% 0.10/0.38 ![X0,X1,X2,X3]: (~shortest_path(X0,X1,X2)|~precedes(X3,X3,X2))),
% 0.10/0.38 inference(equality_resolution,[status(esa)],[f204])).
% 0.10/0.38 fof(f206,plain,(
% 0.10/0.38 ![X0]: (~precedes(X0,X0,sk0_12))),
% 0.10/0.38 inference(resolution,[status(thm)],[f205,f118])).
% 0.10/0.38 fof(f208,plain,(
% 0.10/0.38 ![X0]: (~on_path(X0,sk0_12)|edge(X0))),
% 0.10/0.38 inference(resolution,[status(thm)],[f51,f199])).
% 0.10/0.38 fof(f212,plain,(
% 0.10/0.38 spl0_17 <=> on_path(sk0_10,sk0_12)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f213,plain,(
% 0.10/0.38 on_path(sk0_10,sk0_12)|~spl0_17),
% 0.10/0.38 inference(component_clause,[status(thm)],[f212])).
% 0.10/0.38 fof(f215,plain,(
% 0.10/0.38 ![X0,X1]: (~path(X0,X1,sk0_12)|on_path(sk0_10,sk0_12))),
% 0.10/0.38 inference(resolution,[status(thm)],[f75,f119])).
% 0.10/0.38 fof(f216,plain,(
% 0.10/0.38 spl0_12|spl0_17),
% 0.10/0.38 inference(split_clause,[status(thm)],[f215,f178,f212])).
% 0.10/0.38 fof(f217,plain,(
% 0.10/0.38 spl0_18 <=> on_path(sk0_11,sk0_12)),
% 0.10/0.38 introduced(split_symbol_definition)).
% 0.10/0.38 fof(f218,plain,(
% 0.10/0.38 on_path(sk0_11,sk0_12)|~spl0_18),
% 0.10/0.38 inference(component_clause,[status(thm)],[f217])).
% 0.10/0.38 fof(f220,plain,(
% 0.10/0.38 ![X0,X1]: (~path(X0,X1,sk0_12)|on_path(sk0_11,sk0_12))),
% 0.10/0.38 inference(resolution,[status(thm)],[f76,f119])).
% 0.10/0.38 fof(f221,plain,(
% 0.10/0.38 spl0_12|spl0_18),
% 0.10/0.38 inference(split_clause,[status(thm)],[f220,f178,f217])).
% 0.10/0.38 fof(f243,plain,(
% 0.10/0.38 $false|~spl0_12),
% 0.10/0.38 inference(backward_subsumption_resolution,[status(thm)],[f199,f179])).
% 0.10/0.38 fof(f244,plain,(
% 0.10/0.38 ~spl0_12),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f243])).
% 0.10/0.38 fof(f245,plain,(
% 0.10/0.38 edge(sk0_10)|~spl0_17),
% 0.10/0.38 inference(resolution,[status(thm)],[f213,f208])).
% 0.10/0.38 fof(f246,plain,(
% 0.10/0.38 edge(sk0_11)|~spl0_18),
% 0.10/0.38 inference(resolution,[status(thm)],[f218,f208])).
% 0.10/0.38 fof(f249,plain,(
% 0.10/0.38 $false|spl0_11),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f199,f170])).
% 0.10/0.38 fof(f250,plain,(
% 0.10/0.38 spl0_11),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f249])).
% 0.10/0.38 fof(f251,plain,(
% 0.10/0.38 $false|~spl0_18|spl0_9),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f164,f246])).
% 0.10/0.38 fof(f252,plain,(
% 0.10/0.38 ~spl0_18|spl0_9),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f251])).
% 0.10/0.38 fof(f253,plain,(
% 0.10/0.38 $false|~spl0_17|spl0_8),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f161,f245])).
% 0.10/0.38 fof(f254,plain,(
% 0.10/0.38 ~spl0_17|spl0_8),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f253])).
% 0.10/0.38 fof(f255,plain,(
% 0.10/0.38 $false|spl0_6),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f155,f200])).
% 0.10/0.38 fof(f256,plain,(
% 0.10/0.38 spl0_6),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f255])).
% 0.10/0.38 fof(f257,plain,(
% 0.10/0.38 $false|spl0_5),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f152,f201])).
% 0.10/0.38 fof(f258,plain,(
% 0.10/0.38 spl0_5),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f257])).
% 0.10/0.38 fof(f260,plain,(
% 0.10/0.38 shortest_path(sk0_8,sk0_8,sk0_12)|~spl0_7),
% 0.10/0.38 inference(backward_demodulation,[status(thm)],[f157,f118])).
% 0.10/0.38 fof(f261,plain,(
% 0.10/0.38 $false|~spl0_7),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f260,f175])).
% 0.10/0.38 fof(f262,plain,(
% 0.10/0.38 ~spl0_7),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f261])).
% 0.10/0.38 fof(f268,plain,(
% 0.10/0.38 precedes(sk0_10,sk0_10,sk0_12)|~spl0_10),
% 0.10/0.38 inference(backward_demodulation,[status(thm)],[f166,f119])).
% 0.10/0.38 fof(f269,plain,(
% 0.10/0.38 $false|~spl0_10),
% 0.10/0.38 inference(forward_subsumption_resolution,[status(thm)],[f268,f206])).
% 0.10/0.38 fof(f270,plain,(
% 0.10/0.38 ~spl0_10),
% 0.10/0.38 inference(contradiction_clause,[status(thm)],[f269])).
% 0.10/0.38 fof(f271,plain,(
% 0.10/0.38 $false),
% 0.10/0.38 inference(sat_refutation,[status(thm)],[f171,f216,f221,f244,f250,f252,f254,f256,f258,f262,f270])).
% 0.10/0.38 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.38 % Elapsed time: 0.043985 seconds
% 0.10/0.38 % CPU time: 0.023637 seconds
% 0.10/0.38 % Memory used: 3.612 MB
%------------------------------------------------------------------------------