TSTP Solution File: MGT016-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : MGT016-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:28:37 EDT 2024
% Result : Unsatisfiable 0.10s 0.33s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : MGT016-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Apr 29 23:43:48 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.32 % Drodi V3.6.0
% 0.10/0.33 % Refutation found
% 0.10/0.33 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.33 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.33 fof(f1,axiom,(
% 0.10/0.33 (![A,B]: (( ~ organization(A,B)| inertia(A,sk1(B,A),B) ) ))),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f2,hypothesis,(
% 0.10/0.33 (![A,B,C,D,E,F,G,H,I]: (( ~ organization(A,B)| ~ organization(C,D)| ~ class(A,E,B)| ~ class(C,E,D)| ~ complexity(A,F,B)| ~ complexity(C,G,D)| ~ inertia(A,H,B)| ~ inertia(C,I,D)| ~ greater(G,F)| greater(I,H) ) ))),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f3,hypothesis,(
% 0.10/0.33 (![A,B,C,D,E,F,G,H,I]: (( ~ organization(A,B)| ~ organization(C,B)| organization(C,D)| ~ class(A,E,B)| ~ class(C,E,B)| ~ reorganization(A,B,F)| ~ reorganization(C,B,D)| ~ reorganization_type(A,G,B)| ~ reorganization_type(C,G,B)| ~ inertia(A,H,B)| ~ inertia(C,I,B)| ~ greater(I,H)| greater(F,D) ) ))),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f4,negated_conjecture,(
% 0.10/0.33 organization(sk2,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f5,negated_conjecture,(
% 0.10/0.33 organization(sk3,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f6,negated_conjecture,(
% 0.10/0.33 ~ organization(sk3,sk10) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f7,negated_conjecture,(
% 0.10/0.33 class(sk2,sk5,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f8,negated_conjecture,(
% 0.10/0.33 class(sk3,sk5,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f9,negated_conjecture,(
% 0.10/0.33 reorganization(sk2,sk8,sk9) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f10,negated_conjecture,(
% 0.10/0.33 reorganization(sk3,sk8,sk10) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f11,negated_conjecture,(
% 0.10/0.33 reorganization_type(sk2,sk4,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f12,negated_conjecture,(
% 0.10/0.33 reorganization_type(sk3,sk4,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f13,negated_conjecture,(
% 0.10/0.33 complexity(sk2,sk6,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f14,negated_conjecture,(
% 0.10/0.33 complexity(sk3,sk7,sk8) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f15,negated_conjecture,(
% 0.10/0.33 greater(sk7,sk6) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f16,negated_conjecture,(
% 0.10/0.33 ~ greater(sk9,sk10) ),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f17,plain,(
% 0.10/0.33 ![X0,X1]: (~organization(X0,X1)|inertia(X0,sk1(X1,X0),X1))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f1])).
% 0.10/0.33 fof(f18,plain,(
% 0.10/0.33 ![H,I]: ((![F,G]: ((![C,D]: ((![A,B]: ((((![E]: (((~organization(A,B)|~organization(C,D))|~class(A,E,B))|~class(C,E,D)))|~complexity(A,F,B))|~complexity(C,G,D))|~inertia(A,H,B)))|~inertia(C,I,D)))|~greater(G,F)))|greater(I,H))),
% 0.10/0.33 inference(miniscoping,[status(esa)],[f2])).
% 0.10/0.33 fof(f19,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4,X5,X6,X7,X8]: (~organization(X0,X1)|~organization(X2,X3)|~class(X0,X4,X1)|~class(X2,X4,X3)|~complexity(X0,X5,X1)|~complexity(X2,X6,X3)|~inertia(X0,X7,X1)|~inertia(X2,X8,X3)|~greater(X6,X5)|greater(X8,X7))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f18])).
% 0.10/0.33 fof(f20,plain,(
% 0.10/0.33 ![D,F]: ((![H,I]: ((![B,C]: ((![A]: ((![G]: (((((![E]: ((((~organization(A,B)|~organization(C,B))|organization(C,D))|~class(A,E,B))|~class(C,E,B)))|~reorganization(A,B,F))|~reorganization(C,B,D))|~reorganization_type(A,G,B))|~reorganization_type(C,G,B)))|~inertia(A,H,B)))|~inertia(C,I,B)))|~greater(I,H)))|greater(F,D))),
% 0.10/0.33 inference(miniscoping,[status(esa)],[f3])).
% 0.10/0.33 fof(f21,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4,X5,X6,X7,X8]: (~organization(X0,X1)|~organization(X2,X1)|organization(X2,X3)|~class(X0,X4,X1)|~class(X2,X4,X1)|~reorganization(X0,X1,X5)|~reorganization(X2,X1,X3)|~reorganization_type(X0,X6,X1)|~reorganization_type(X2,X6,X1)|~inertia(X0,X7,X1)|~inertia(X2,X8,X1)|~greater(X8,X7)|greater(X5,X3))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f20])).
% 0.10/0.33 fof(f22,plain,(
% 0.10/0.33 organization(sk2,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.33 fof(f23,plain,(
% 0.10/0.33 organization(sk3,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f5])).
% 0.10/0.33 fof(f24,plain,(
% 0.10/0.33 ~organization(sk3,sk10)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f6])).
% 0.10/0.33 fof(f25,plain,(
% 0.10/0.33 class(sk2,sk5,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f7])).
% 0.10/0.33 fof(f26,plain,(
% 0.10/0.33 class(sk3,sk5,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f8])).
% 0.10/0.33 fof(f27,plain,(
% 0.10/0.33 reorganization(sk2,sk8,sk9)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f9])).
% 0.10/0.33 fof(f28,plain,(
% 0.10/0.33 reorganization(sk3,sk8,sk10)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f10])).
% 0.10/0.33 fof(f29,plain,(
% 0.10/0.33 reorganization_type(sk2,sk4,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.33 fof(f30,plain,(
% 0.10/0.33 reorganization_type(sk3,sk4,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f12])).
% 0.10/0.33 fof(f31,plain,(
% 0.10/0.33 complexity(sk2,sk6,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f13])).
% 0.10/0.33 fof(f32,plain,(
% 0.10/0.33 complexity(sk3,sk7,sk8)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f14])).
% 0.10/0.33 fof(f33,plain,(
% 0.10/0.33 greater(sk7,sk6)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f15])).
% 0.10/0.33 fof(f34,plain,(
% 0.10/0.33 ~greater(sk9,sk10)),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f16])).
% 0.10/0.33 fof(f35,plain,(
% 0.10/0.33 spl0_0 <=> organization(sk3,sk8)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f37,plain,(
% 0.10/0.33 ~organization(sk3,sk8)|spl0_0),
% 0.10/0.33 inference(component_clause,[status(thm)],[f35])).
% 0.10/0.33 fof(f43,plain,(
% 0.10/0.33 spl0_2 <=> organization(sk2,sk8)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f45,plain,(
% 0.10/0.33 ~organization(sk2,sk8)|spl0_2),
% 0.10/0.33 inference(component_clause,[status(thm)],[f43])).
% 0.10/0.33 fof(f46,plain,(
% 0.10/0.33 spl0_3 <=> ~organization(X0,X1)|~class(X0,sk5,X1)|~complexity(sk2,X2,sk8)|~complexity(X0,X3,X1)|~inertia(sk2,X4,sk8)|~inertia(X0,X5,X1)|~greater(X3,X2)|greater(X5,X4)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f47,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4,X5]: (~organization(X0,X1)|~class(X0,sk5,X1)|~complexity(sk2,X2,sk8)|~complexity(X0,X3,X1)|~inertia(sk2,X4,sk8)|~inertia(X0,X5,X1)|~greater(X3,X2)|greater(X5,X4)|~spl0_3)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f46])).
% 0.10/0.33 fof(f49,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4,X5]: (~organization(sk2,sk8)|~organization(X0,X1)|~class(X0,sk5,X1)|~complexity(sk2,X2,sk8)|~complexity(X0,X3,X1)|~inertia(sk2,X4,sk8)|~inertia(X0,X5,X1)|~greater(X3,X2)|greater(X5,X4))),
% 0.10/0.33 inference(resolution,[status(thm)],[f19,f25])).
% 0.10/0.33 fof(f50,plain,(
% 0.10/0.33 ~spl0_2|spl0_3),
% 0.10/0.33 inference(split_clause,[status(thm)],[f49,f43,f46])).
% 0.10/0.33 fof(f51,plain,(
% 0.10/0.33 $false|spl0_2),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f45,f22])).
% 0.10/0.33 fof(f52,plain,(
% 0.10/0.33 spl0_2),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f51])).
% 0.10/0.33 fof(f53,plain,(
% 0.10/0.33 $false|spl0_0),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f37,f23])).
% 0.10/0.33 fof(f54,plain,(
% 0.10/0.33 spl0_0),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f53])).
% 0.10/0.33 fof(f60,plain,(
% 0.10/0.33 spl0_5 <=> ~organization(X0,sk8)|organization(X0,X1)|~class(X0,sk5,sk8)|~reorganization(sk2,sk8,X2)|~reorganization(X0,sk8,X1)|~reorganization_type(sk2,X3,sk8)|~reorganization_type(X0,X3,sk8)|~inertia(sk2,X4,sk8)|~inertia(X0,X5,sk8)|~greater(X5,X4)|greater(X2,X1)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f61,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4,X5]: (~organization(X0,sk8)|organization(X0,X1)|~class(X0,sk5,sk8)|~reorganization(sk2,sk8,X2)|~reorganization(X0,sk8,X1)|~reorganization_type(sk2,X3,sk8)|~reorganization_type(X0,X3,sk8)|~inertia(sk2,X4,sk8)|~inertia(X0,X5,sk8)|~greater(X5,X4)|greater(X2,X1)|~spl0_5)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f60])).
% 0.10/0.33 fof(f63,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4,X5]: (~organization(sk2,sk8)|~organization(X0,sk8)|organization(X0,X1)|~class(X0,sk5,sk8)|~reorganization(sk2,sk8,X2)|~reorganization(X0,sk8,X1)|~reorganization_type(sk2,X3,sk8)|~reorganization_type(X0,X3,sk8)|~inertia(sk2,X4,sk8)|~inertia(X0,X5,sk8)|~greater(X5,X4)|greater(X2,X1))),
% 0.10/0.33 inference(resolution,[status(thm)],[f21,f25])).
% 0.10/0.33 fof(f64,plain,(
% 0.10/0.33 ~spl0_2|spl0_5),
% 0.10/0.33 inference(split_clause,[status(thm)],[f63,f43,f60])).
% 0.10/0.33 fof(f65,plain,(
% 0.10/0.33 inertia(sk3,sk1(sk8,sk3),sk8)),
% 0.10/0.33 inference(resolution,[status(thm)],[f17,f23])).
% 0.10/0.33 fof(f66,plain,(
% 0.10/0.33 inertia(sk2,sk1(sk8,sk2),sk8)),
% 0.10/0.33 inference(resolution,[status(thm)],[f17,f22])).
% 0.10/0.33 fof(f67,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4]: (~organization(X0,sk8)|organization(X0,X1)|~class(X0,sk5,sk8)|~reorganization(X0,sk8,X1)|~reorganization_type(sk2,X2,sk8)|~reorganization_type(X0,X2,sk8)|~inertia(sk2,X3,sk8)|~inertia(X0,X4,sk8)|~greater(X4,X3)|greater(sk9,X1)|~spl0_5)),
% 0.10/0.33 inference(resolution,[status(thm)],[f61,f27])).
% 0.10/0.33 fof(f69,plain,(
% 0.10/0.33 ![X0,X1,X2,X3,X4]: (~organization(X0,X1)|~class(X0,sk5,X1)|~complexity(X0,X2,X1)|~inertia(sk2,X3,sk8)|~inertia(X0,X4,X1)|~greater(X2,sk6)|greater(X4,X3)|~spl0_3)),
% 0.10/0.33 inference(resolution,[status(thm)],[f47,f31])).
% 0.10/0.33 fof(f70,plain,(
% 0.10/0.33 spl0_6 <=> class(sk3,sk5,sk8)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f72,plain,(
% 0.10/0.33 ~class(sk3,sk5,sk8)|spl0_6),
% 0.10/0.33 inference(component_clause,[status(thm)],[f70])).
% 0.10/0.33 fof(f73,plain,(
% 0.10/0.33 spl0_7 <=> ~inertia(sk2,X0,sk8)|~inertia(sk3,X1,sk8)|greater(X1,X0)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f74,plain,(
% 0.10/0.33 ![X0,X1]: (~inertia(sk2,X0,sk8)|~inertia(sk3,X1,sk8)|greater(X1,X0)|~spl0_7)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f73])).
% 0.10/0.33 fof(f76,plain,(
% 0.10/0.33 spl0_8 <=> greater(sk7,sk6)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f78,plain,(
% 0.10/0.33 ~greater(sk7,sk6)|spl0_8),
% 0.10/0.33 inference(component_clause,[status(thm)],[f76])).
% 0.10/0.33 fof(f79,plain,(
% 0.10/0.33 ![X0,X1]: (~organization(sk3,sk8)|~class(sk3,sk5,sk8)|~inertia(sk2,X0,sk8)|~inertia(sk3,X1,sk8)|~greater(sk7,sk6)|greater(X1,X0)|~spl0_3)),
% 0.10/0.33 inference(resolution,[status(thm)],[f69,f32])).
% 0.10/0.33 fof(f80,plain,(
% 0.10/0.33 ~spl0_0|~spl0_6|spl0_7|~spl0_8|~spl0_3),
% 0.10/0.33 inference(split_clause,[status(thm)],[f79,f35,f70,f73,f76,f46])).
% 0.10/0.33 fof(f94,plain,(
% 0.10/0.33 $false|spl0_8),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f78,f33])).
% 0.10/0.33 fof(f95,plain,(
% 0.10/0.33 spl0_8),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f94])).
% 0.10/0.33 fof(f96,plain,(
% 0.10/0.33 $false|spl0_6),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f72,f26])).
% 0.10/0.33 fof(f97,plain,(
% 0.10/0.33 spl0_6),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f96])).
% 0.10/0.33 fof(f117,plain,(
% 0.10/0.33 spl0_16 <=> organization(sk3,sk10)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f118,plain,(
% 0.10/0.33 organization(sk3,sk10)|~spl0_16),
% 0.10/0.33 inference(component_clause,[status(thm)],[f117])).
% 0.10/0.33 fof(f120,plain,(
% 0.10/0.33 spl0_17 <=> ~reorganization_type(sk2,X0,sk8)|~reorganization_type(sk3,X0,sk8)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f121,plain,(
% 0.10/0.33 ![X0]: (~reorganization_type(sk2,X0,sk8)|~reorganization_type(sk3,X0,sk8)|~spl0_17)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f120])).
% 0.10/0.33 fof(f123,plain,(
% 0.10/0.33 spl0_18 <=> ~inertia(sk2,X1,sk8)|~inertia(sk3,X2,sk8)|~greater(X2,X1)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f124,plain,(
% 0.10/0.33 ![X0,X1]: (~inertia(sk2,X0,sk8)|~inertia(sk3,X1,sk8)|~greater(X1,X0)|~spl0_18)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f123])).
% 0.10/0.33 fof(f126,plain,(
% 0.10/0.33 spl0_19 <=> greater(sk9,sk10)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f127,plain,(
% 0.10/0.33 greater(sk9,sk10)|~spl0_19),
% 0.10/0.33 inference(component_clause,[status(thm)],[f126])).
% 0.10/0.33 fof(f129,plain,(
% 0.10/0.33 ![X0,X1,X2]: (~organization(sk3,sk8)|organization(sk3,sk10)|~class(sk3,sk5,sk8)|~reorganization_type(sk2,X0,sk8)|~reorganization_type(sk3,X0,sk8)|~inertia(sk2,X1,sk8)|~inertia(sk3,X2,sk8)|~greater(X2,X1)|greater(sk9,sk10)|~spl0_5)),
% 0.10/0.33 inference(resolution,[status(thm)],[f67,f28])).
% 0.10/0.33 fof(f130,plain,(
% 0.10/0.33 ~spl0_0|spl0_16|~spl0_6|spl0_17|spl0_18|spl0_19|~spl0_5),
% 0.10/0.33 inference(split_clause,[status(thm)],[f129,f35,f117,f70,f120,f123,f126,f60])).
% 0.10/0.33 fof(f146,plain,(
% 0.10/0.33 $false|~spl0_19),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f127,f34])).
% 0.10/0.33 fof(f147,plain,(
% 0.10/0.33 ~spl0_19),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f146])).
% 0.10/0.33 fof(f150,plain,(
% 0.10/0.33 ![X0,X1]: (~inertia(sk2,X0,sk8)|~inertia(sk3,X1,sk8)|~spl0_7|~spl0_18)),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f124,f74])).
% 0.10/0.33 fof(f171,plain,(
% 0.10/0.33 $false|~spl0_16),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f118,f24])).
% 0.10/0.33 fof(f172,plain,(
% 0.10/0.33 ~spl0_16),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f171])).
% 0.10/0.33 fof(f178,plain,(
% 0.10/0.33 ~reorganization_type(sk2,sk4,sk8)|~spl0_17),
% 0.10/0.33 inference(resolution,[status(thm)],[f121,f30])).
% 0.10/0.33 fof(f179,plain,(
% 0.10/0.33 $false|~spl0_17),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f178,f29])).
% 0.10/0.33 fof(f180,plain,(
% 0.10/0.33 ~spl0_17),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f179])).
% 0.10/0.33 fof(f181,plain,(
% 0.10/0.33 spl0_29 <=> ~inertia(sk2,X0,sk8)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f182,plain,(
% 0.10/0.33 ![X0]: (~inertia(sk2,X0,sk8)|~spl0_29)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f181])).
% 0.10/0.33 fof(f184,plain,(
% 0.10/0.33 spl0_30 <=> ~inertia(sk3,X1,sk8)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f185,plain,(
% 0.10/0.33 ![X0]: (~inertia(sk3,X0,sk8)|~spl0_30)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f184])).
% 0.10/0.33 fof(f187,plain,(
% 0.10/0.33 spl0_29|spl0_30|~spl0_7|~spl0_18),
% 0.10/0.33 inference(split_clause,[status(thm)],[f150,f181,f184,f73,f123])).
% 0.10/0.33 fof(f188,plain,(
% 0.10/0.33 $false|~spl0_29),
% 0.10/0.33 inference(backward_subsumption_resolution,[status(thm)],[f66,f182])).
% 0.10/0.33 fof(f189,plain,(
% 0.10/0.33 ~spl0_29),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f188])).
% 0.10/0.33 fof(f190,plain,(
% 0.10/0.33 $false|~spl0_30),
% 0.10/0.33 inference(backward_subsumption_resolution,[status(thm)],[f65,f185])).
% 0.10/0.33 fof(f191,plain,(
% 0.10/0.33 ~spl0_30),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f190])).
% 0.10/0.33 fof(f192,plain,(
% 0.10/0.33 $false),
% 0.10/0.33 inference(sat_refutation,[status(thm)],[f50,f52,f54,f64,f80,f95,f97,f130,f147,f172,f180,f187,f189,f191])).
% 0.10/0.33 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.34 % Elapsed time: 0.016911 seconds
% 0.10/0.34 % CPU time: 0.048925 seconds
% 0.10/0.34 % Total memory used: 2.999 MB
% 0.10/0.34 % Net memory used: 2.970 MB
%------------------------------------------------------------------------------