TSTP Solution File: GRA010+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRA010+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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 : Tue Apr 30 20:18:35 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRA010+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.00/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n026.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Apr 29 22:41:34 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.30 % Drodi V3.6.0
% 0.15/0.32 % Refutation found
% 0.15/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.32 % SZS output start CNFRefutation for theBenchmark
% 0.15/0.32 fof(f16,axiom,(
% 0.15/0.32 (! [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.15/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.32 fof(f18,conjecture,(
% 0.15/0.32 ( complete=> (! [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.15/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.32 fof(f19,negated_conjecture,(
% 0.15/0.32 ~(( complete=> (! [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.15/0.32 inference(negated_conjecture,[status(cth)],[f18])).
% 0.15/0.32 fof(f108,plain,(
% 0.15/0.32 ![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.15/0.32 inference(pre_NNF_transformation,[status(esa)],[f16])).
% 0.15/0.32 fof(f109,plain,(
% 0.15/0.32 ![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.15/0.32 inference(miniscoping,[status(esa)],[f108])).
% 0.15/0.32 fof(f110,plain,(
% 0.15/0.32 ![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.15/0.32 inference(skolemization,[status(esa)],[f109])).
% 0.15/0.32 fof(f111,plain,(
% 0.15/0.32 ![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.15/0.32 inference(cnf_transformation,[status(esa)],[f110])).
% 0.15/0.32 fof(f112,plain,(
% 0.15/0.32 ![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.15/0.32 inference(cnf_transformation,[status(esa)],[f110])).
% 0.15/0.32 fof(f113,plain,(
% 0.15/0.32 ![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.15/0.32 inference(cnf_transformation,[status(esa)],[f110])).
% 0.15/0.32 fof(f114,plain,(
% 0.15/0.32 ![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.15/0.32 inference(cnf_transformation,[status(esa)],[f110])).
% 0.15/0.32 fof(f116,plain,(
% 0.15/0.32 (complete&(?[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.15/0.32 inference(pre_NNF_transformation,[status(esa)],[f19])).
% 0.15/0.32 fof(f117,plain,(
% 0.15/0.32 complete&(?[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.15/0.32 inference(miniscoping,[status(esa)],[f116])).
% 0.15/0.32 fof(f118,plain,(
% 0.15/0.32 complete&((path(sk0_9,sk0_10,sk0_8)&(![E1,E2]: (((~on_path(E1,sk0_8)|~on_path(E2,sk0_8))|~sequential(E1,E2))|triangle(E1,E2,sk0_11(E2,E1)))))&~number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8))),
% 0.15/0.32 inference(skolemization,[status(esa)],[f117])).
% 0.15/0.32 fof(f120,plain,(
% 0.15/0.32 path(sk0_9,sk0_10,sk0_8)),
% 0.15/0.32 inference(cnf_transformation,[status(esa)],[f118])).
% 0.15/0.32 fof(f121,plain,(
% 0.15/0.32 ![X0,X1]: (~on_path(X0,sk0_8)|~on_path(X1,sk0_8)|~sequential(X0,X1)|triangle(X0,X1,sk0_11(X1,X0)))),
% 0.15/0.32 inference(cnf_transformation,[status(esa)],[f118])).
% 0.15/0.32 fof(f122,plain,(
% 0.15/0.32 ~number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)),
% 0.15/0.32 inference(cnf_transformation,[status(esa)],[f118])).
% 0.15/0.32 fof(f244,plain,(
% 0.15/0.32 spl0_15 <=> ~path(X0,X1,sk0_8)),
% 0.15/0.32 introduced(split_symbol_definition)).
% 0.15/0.32 fof(f245,plain,(
% 0.15/0.32 ![X0,X1]: (~path(X0,X1,sk0_8)|~spl0_15)),
% 0.15/0.32 inference(component_clause,[status(thm)],[f244])).
% 0.15/0.32 fof(f247,plain,(
% 0.15/0.32 spl0_16 <=> number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f248,plain,(
% 0.15/0.33 number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)|~spl0_16),
% 0.15/0.33 inference(component_clause,[status(thm)],[f247])).
% 0.15/0.33 fof(f255,plain,(
% 0.15/0.33 spl0_18 <=> ~on_path(X2,sk0_8)|~sequential(X2,sk0_7(sk0_8))|triangle(X2,sk0_7(sk0_8),sk0_11(sk0_7(sk0_8),X2))),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f256,plain,(
% 0.15/0.33 ![X0]: (~on_path(X0,sk0_8)|~sequential(X0,sk0_7(sk0_8))|triangle(X0,sk0_7(sk0_8),sk0_11(sk0_7(sk0_8),X0))|~spl0_18)),
% 0.15/0.33 inference(component_clause,[status(thm)],[f255])).
% 0.15/0.33 fof(f258,plain,(
% 0.15/0.33 ![X0,X1,X2]: (~path(X0,X1,sk0_8)|number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)|~on_path(X2,sk0_8)|~sequential(X2,sk0_7(sk0_8))|triangle(X2,sk0_7(sk0_8),sk0_11(sk0_7(sk0_8),X2)))),
% 0.15/0.33 inference(resolution,[status(thm)],[f112,f121])).
% 0.15/0.33 fof(f259,plain,(
% 0.15/0.33 spl0_15|spl0_16|spl0_18),
% 0.15/0.33 inference(split_clause,[status(thm)],[f258,f244,f247,f255])).
% 0.15/0.33 fof(f260,plain,(
% 0.15/0.33 $false|~spl0_16),
% 0.15/0.33 inference(forward_subsumption_resolution,[status(thm)],[f248,f122])).
% 0.15/0.33 fof(f261,plain,(
% 0.15/0.33 ~spl0_16),
% 0.15/0.33 inference(contradiction_clause,[status(thm)],[f260])).
% 0.15/0.33 fof(f264,plain,(
% 0.15/0.33 $false|~spl0_15),
% 0.15/0.33 inference(forward_subsumption_resolution,[status(thm)],[f120,f245])).
% 0.15/0.33 fof(f265,plain,(
% 0.15/0.33 ~spl0_15),
% 0.15/0.33 inference(contradiction_clause,[status(thm)],[f264])).
% 0.15/0.33 fof(f325,plain,(
% 0.15/0.33 spl0_21 <=> sequential(sk0_6(sk0_8),sk0_7(sk0_8))),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f326,plain,(
% 0.15/0.33 sequential(sk0_6(sk0_8),sk0_7(sk0_8))|~spl0_21),
% 0.15/0.33 inference(component_clause,[status(thm)],[f325])).
% 0.15/0.33 fof(f343,plain,(
% 0.15/0.33 sequential(sk0_6(sk0_8),sk0_7(sk0_8))|number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)),
% 0.15/0.33 inference(resolution,[status(thm)],[f120,f113])).
% 0.15/0.33 fof(f344,plain,(
% 0.15/0.33 spl0_21|spl0_16),
% 0.15/0.33 inference(split_clause,[status(thm)],[f343,f325,f247])).
% 0.15/0.33 fof(f356,plain,(
% 0.15/0.33 spl0_22 <=> on_path(sk0_6(sk0_8),sk0_8)),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f358,plain,(
% 0.15/0.33 ~on_path(sk0_6(sk0_8),sk0_8)|spl0_22),
% 0.15/0.33 inference(component_clause,[status(thm)],[f356])).
% 0.15/0.33 fof(f359,plain,(
% 0.15/0.33 spl0_23 <=> triangle(sk0_6(sk0_8),sk0_7(sk0_8),sk0_11(sk0_7(sk0_8),sk0_6(sk0_8)))),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f360,plain,(
% 0.15/0.33 triangle(sk0_6(sk0_8),sk0_7(sk0_8),sk0_11(sk0_7(sk0_8),sk0_6(sk0_8)))|~spl0_23),
% 0.15/0.33 inference(component_clause,[status(thm)],[f359])).
% 0.15/0.33 fof(f362,plain,(
% 0.15/0.33 ~on_path(sk0_6(sk0_8),sk0_8)|triangle(sk0_6(sk0_8),sk0_7(sk0_8),sk0_11(sk0_7(sk0_8),sk0_6(sk0_8)))|~spl0_21|~spl0_18),
% 0.15/0.33 inference(resolution,[status(thm)],[f326,f256])).
% 0.15/0.33 fof(f363,plain,(
% 0.15/0.33 ~spl0_22|spl0_23|~spl0_21|~spl0_18),
% 0.15/0.33 inference(split_clause,[status(thm)],[f362,f356,f359,f325,f255])).
% 0.15/0.33 fof(f369,plain,(
% 0.15/0.33 ![X0,X1]: (~path(X0,X1,sk0_8)|number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)|spl0_22)),
% 0.15/0.33 inference(resolution,[status(thm)],[f358,f111])).
% 0.15/0.33 fof(f370,plain,(
% 0.15/0.33 spl0_15|spl0_16|spl0_22),
% 0.15/0.33 inference(split_clause,[status(thm)],[f369,f244,f247,f356])).
% 0.15/0.33 fof(f451,plain,(
% 0.15/0.33 ![X0,X1]: (~path(X0,X1,sk0_8)|number_of_in(sequential_pairs,sk0_8)=number_of_in(triangles,sk0_8)|~spl0_23)),
% 0.15/0.33 inference(resolution,[status(thm)],[f114,f360])).
% 0.15/0.33 fof(f452,plain,(
% 0.15/0.33 spl0_15|spl0_16|~spl0_23),
% 0.15/0.33 inference(split_clause,[status(thm)],[f451,f244,f247,f359])).
% 0.15/0.33 fof(f453,plain,(
% 0.15/0.33 $false),
% 0.15/0.33 inference(sat_refutation,[status(thm)],[f259,f261,f265,f344,f363,f370,f452])).
% 0.15/0.33 % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.34 % Elapsed time: 0.033903 seconds
% 0.15/0.34 % CPU time: 0.171383 seconds
% 0.15/0.34 % Total memory used: 31.903 MB
% 0.15/0.34 % Net memory used: 31.805 MB
%------------------------------------------------------------------------------