%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : MGT036+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 01:25:46 PM UTC 2026
% Result : Theorem 0.20s 0.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT036+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 % Computer : n009.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.48 % DateTime : Mon Sep 21 01:22:28 UTC 2026
% 0.20/0.48 % CPUTime :
% 0.20/0.49 % Drodi V4.1.1
% 0.20/0.50 % Refutation found
% 0.20/0.50 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.50 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.50 fof(f1,axiom,(
% 0.20/0.50 (! [E,S1,S2,T] :( ( environment(E)& subpopulations(S1,S2,E,T) )=> subpopulations(S2,S1,E,T) ) )),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f2,axiom,(
% 0.20/0.50 (! [E,T] :( ( environment(E)& subpopulations(first_movers,efficient_producers,E,T) )=> in_environment(E,T) ) )),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f3,axiom,(
% 0.20/0.50 (! [E,S1,S2,T] :( ( ( environment(E)& subpopulations(S1,S2,E,T) )=> greater_or_equal(growth_rate(S1,T),zero) )<=> ~ greater(zero,growth_rate(S1,T)) ) )),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f4,hypothesis,(
% 0.20/0.50 (! [E,S1,S2,T] :( ( environment(E)& subpopulations(S1,S2,E,T) )=> ( ( greater_or_equal(growth_rate(S2,T),zero)& greater(zero,growth_rate(S1,T)) )<=> outcompetes(S2,S1,T) ) ) )),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f5,hypothesis,(
% 0.20/0.50 greater(resilience(efficient_producers),resilience(first_movers)) ),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f6,hypothesis,(
% 0.20/0.50 (! [E,S1,S2,T] :( ( environment(E)& in_environment(E,T)& ~ greater(zero,growth_rate(S1,T))& greater(resilience(S2),resilience(S1)) )=> ~ greater(zero,growth_rate(S2,T)) ) )),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f7,conjecture,(
% 0.20/0.50 (! [E,T] :( ( environment(E)& subpopulations(first_movers,efficient_producers,E,T) )=> ~ outcompetes(first_movers,efficient_producers,T) ) )),
% 0.20/0.50 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.50 fof(f8,negated_conjecture,(
% 0.20/0.50 ~((! [E,T] :( ( environment(E)& subpopulations(first_movers,efficient_producers,E,T) )=> ~ outcompetes(first_movers,efficient_producers,T) ) ))),
% 0.20/0.50 inference(negated_conjecture,[status(cth)],[f7])).
% 0.20/0.50 fof(f9,plain,(
% 0.20/0.50 ![E,S1,S2,T]: ((~environment(E)|~subpopulations(S1,S2,E,T))|subpopulations(S2,S1,E,T))),
% 0.20/0.50 inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.20/0.50 fof(f10,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~environment(X0)|~subpopulations(X1,X2,X0,X3)|subpopulations(X2,X1,X0,X3))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f9])).
% 0.20/0.50 fof(f11,plain,(
% 0.20/0.50 ![E,T]: ((~environment(E)|~subpopulations(first_movers,efficient_producers,E,T))|in_environment(E,T))),
% 0.20/0.50 inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.20/0.50 fof(f12,plain,(
% 0.20/0.50 ![X0,X1]: (~environment(X0)|~subpopulations(first_movers,efficient_producers,X0,X1)|in_environment(X0,X1))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f11])).
% 0.20/0.50 fof(f13,plain,(
% 0.20/0.50 ![E,S1,S2,T]: (((~environment(E)|~subpopulations(S1,S2,E,T))|greater_or_equal(growth_rate(S1,T),zero))<=>~greater(zero,growth_rate(S1,T)))),
% 0.20/0.50 inference(pre_NNF_transformation,[status(thm)],[f3])).
% 0.20/0.50 fof(f14,plain,(
% 0.20/0.50 ![E,S1,S2,T]: ((((environment(E)&subpopulations(S1,S2,E,T))&~greater_or_equal(growth_rate(S1,T),zero))|~greater(zero,growth_rate(S1,T)))&(((~environment(E)|~subpopulations(S1,S2,E,T))|greater_or_equal(growth_rate(S1,T),zero))|greater(zero,growth_rate(S1,T))))),
% 0.20/0.50 inference(NNF_transformation,[status(thm)],[f13])).
% 0.20/0.50 fof(f15,plain,(
% 0.20/0.50 (![S1,T]: ((((![E]: environment(E))&(![E,S2]: subpopulations(S1,S2,E,T)))&~greater_or_equal(growth_rate(S1,T),zero))|~greater(zero,growth_rate(S1,T))))&(![S1,T]: (((![E]: (~environment(E)|(![S2]: ~subpopulations(S1,S2,E,T))))|greater_or_equal(growth_rate(S1,T),zero))|greater(zero,growth_rate(S1,T))))),
% 0.20/0.50 inference(miniscoping,[status(thm)],[f14])).
% 0.20/0.50 fof(f16,plain,(
% 0.20/0.50 ![X0,X1,X2]: (environment(X0)|~greater(zero,growth_rate(X1,X2)))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f15])).
% 0.20/0.50 fof(f17,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (subpopulations(X0,X1,X2,X3)|~greater(zero,growth_rate(X0,X3)))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f15])).
% 0.20/0.50 fof(f18,plain,(
% 0.20/0.50 ![X0,X1]: (~greater_or_equal(growth_rate(X0,X1),zero)|~greater(zero,growth_rate(X0,X1)))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f15])).
% 0.20/0.50 fof(f20,plain,(
% 0.20/0.50 ![E,S1,S2,T]: ((~environment(E)|~subpopulations(S1,S2,E,T))|((greater_or_equal(growth_rate(S2,T),zero)&greater(zero,growth_rate(S1,T)))<=>outcompetes(S2,S1,T)))),
% 0.20/0.50 inference(pre_NNF_transformation,[status(thm)],[f4])).
% 0.20/0.50 fof(f21,plain,(
% 0.20/0.50 ![E,S1,S2,T]: ((~environment(E)|~subpopulations(S1,S2,E,T))|(((~greater_or_equal(growth_rate(S2,T),zero)|~greater(zero,growth_rate(S1,T)))|outcompetes(S2,S1,T))&((greater_or_equal(growth_rate(S2,T),zero)&greater(zero,growth_rate(S1,T)))|~outcompetes(S2,S1,T))))),
% 0.20/0.50 inference(NNF_transformation,[status(thm)],[f20])).
% 0.20/0.50 fof(f22,plain,(
% 0.20/0.50 ![S1,S2,T]: ((![E]: (~environment(E)|~subpopulations(S1,S2,E,T)))|(((~greater_or_equal(growth_rate(S2,T),zero)|~greater(zero,growth_rate(S1,T)))|outcompetes(S2,S1,T))&((greater_or_equal(growth_rate(S2,T),zero)&greater(zero,growth_rate(S1,T)))|~outcompetes(S2,S1,T))))),
% 0.20/0.50 inference(miniscoping,[status(thm)],[f21])).
% 0.20/0.50 fof(f24,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~environment(X0)|~subpopulations(X1,X2,X0,X3)|greater_or_equal(growth_rate(X2,X3),zero)|~outcompetes(X2,X1,X3))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f22])).
% 0.20/0.50 fof(f25,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~environment(X0)|~subpopulations(X1,X2,X0,X3)|greater(zero,growth_rate(X1,X3))|~outcompetes(X2,X1,X3))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f22])).
% 0.20/0.50 fof(f26,plain,(
% 0.20/0.50 greater(resilience(efficient_producers),resilience(first_movers))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f5])).
% 0.20/0.50 fof(f27,plain,(
% 0.20/0.50 ![E,S1,S2,T]: ((((~environment(E)|~in_environment(E,T))|greater(zero,growth_rate(S1,T)))|~greater(resilience(S2),resilience(S1)))|~greater(zero,growth_rate(S2,T)))),
% 0.20/0.50 inference(pre_NNF_transformation,[status(thm)],[f6])).
% 0.20/0.50 fof(f28,plain,(
% 0.20/0.50 ![S2,T]: ((![S1]: (((![E]: (~environment(E)|~in_environment(E,T)))|greater(zero,growth_rate(S1,T)))|~greater(resilience(S2),resilience(S1))))|~greater(zero,growth_rate(S2,T)))),
% 0.20/0.50 inference(miniscoping,[status(thm)],[f27])).
% 0.20/0.50 fof(f29,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~environment(X0)|~in_environment(X0,X1)|greater(zero,growth_rate(X2,X1))|~greater(resilience(X3),resilience(X2))|~greater(zero,growth_rate(X3,X1)))),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f28])).
% 0.20/0.50 fof(f30,plain,(
% 0.20/0.50 (?[E,T]: ((environment(E)&subpopulations(first_movers,efficient_producers,E,T))&outcompetes(first_movers,efficient_producers,T)))),
% 0.20/0.50 inference(pre_NNF_transformation,[status(thm)],[f8])).
% 0.20/0.50 fof(f31,plain,(
% 0.20/0.50 ?[T]: ((?[E]: (environment(E)&subpopulations(first_movers,efficient_producers,E,T)))&outcompetes(first_movers,efficient_producers,T))),
% 0.20/0.50 inference(miniscoping,[status(thm)],[f30])).
% 0.20/0.50 fof(f32,plain,(
% 0.20/0.50 ((environment(sK1_skl)&subpopulations(first_movers,efficient_producers,sK1_skl,sK0_skl))&outcompetes(first_movers,efficient_producers,sK0_skl))),
% 0.20/0.50 inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(T,sK0_skl),skolemize(E,sK1_skl)],[f31])).
% 0.20/0.50 fof(f33,plain,(
% 0.20/0.50 environment(sK1_skl)),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f32])).
% 0.20/0.50 fof(f34,plain,(
% 0.20/0.50 subpopulations(first_movers,efficient_producers,sK1_skl,sK0_skl)),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f32])).
% 0.20/0.50 fof(f35,plain,(
% 0.20/0.50 outcompetes(first_movers,efficient_producers,sK0_skl)),
% 0.20/0.50 inference(cnf_transformation,[status(thm)],[f32])).
% 0.20/0.50 fof(f36,definition,(
% 0.20/0.50 ![X0]: (sQ0_spl <=> (environment(X0)))),
% 0.20/0.50 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.20/0.50 fof(f37,plain,(
% 0.20/0.50 ![X0]: (environment(X0)|~sQ0_spl)),
% 0.20/0.50 inference(component_clause,[status(thm)],[f36])).
% 0.20/0.50 fof(f39,definition,(
% 0.20/0.50 ![X1,X2]: (sQ1_spl <=> (~greater(zero,growth_rate(X1,X2))))),
% 0.20/0.50 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.20/0.50 fof(f40,plain,(
% 0.20/0.50 ![X0,X1]: (~greater(zero,growth_rate(X0,X1))|~sQ1_spl)),
% 0.20/0.50 inference(component_clause,[status(thm)],[f39])).
% 0.20/0.50 fof(f42,plain,(
% 0.20/0.50 sQ0_spl|sQ1_spl),
% 0.20/0.50 inference(split_clause,[status(thm)],[f16,f36,f39])).
% 0.20/0.50 fof(f44,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~in_environment(X0,X1)|greater(zero,growth_rate(X2,X1))|~greater(resilience(X3),resilience(X2))|~greater(zero,growth_rate(X3,X1))|~sQ0_spl)),
% 0.20/0.50 inference(backward_subsumption_resolution,[status(thm)],[f29,f37])).
% 0.20/0.50 fof(f45,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~subpopulations(X0,X1,X2,X3)|greater(zero,growth_rate(X0,X3))|~outcompetes(X1,X0,X3)|~sQ0_spl)),
% 0.20/0.50 inference(backward_subsumption_resolution,[status(thm)],[f25,f37])).
% 0.20/0.50 fof(f46,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~subpopulations(X0,X1,X2,X3)|greater_or_equal(growth_rate(X1,X3),zero)|~outcompetes(X1,X0,X3)|~sQ0_spl)),
% 0.20/0.50 inference(backward_subsumption_resolution,[status(thm)],[f24,f37])).
% 0.20/0.50 fof(f49,plain,(
% 0.20/0.50 ![X0,X1]: (~subpopulations(first_movers,efficient_producers,X0,X1)|in_environment(X0,X1)|~sQ0_spl)),
% 0.20/0.50 inference(backward_subsumption_resolution,[status(thm)],[f12,f37])).
% 0.20/0.50 fof(f50,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~subpopulations(X0,X1,X2,X3)|subpopulations(X1,X0,X2,X3)|~sQ0_spl)),
% 0.20/0.50 inference(backward_subsumption_resolution,[status(thm)],[f10,f37])).
% 0.20/0.50 fof(f52,plain,(
% 0.20/0.50 ![X0,X1]: (~subpopulations(efficient_producers,first_movers,X0,X1)|in_environment(X0,X1)|~sQ0_spl)),
% 0.20/0.50 inference(resolution,[status(thm)],[f50,f49])).
% 0.20/0.50 fof(f54,plain,(
% 0.20/0.50 ![X0]: (~subpopulations(efficient_producers,first_movers,X0,sK0_skl)|greater(zero,growth_rate(efficient_producers,sK0_skl))|~sQ0_spl)),
% 0.20/0.50 inference(resolution,[status(thm)],[f45,f35])).
% 0.20/0.50 fof(f55,definition,(
% 0.20/0.50 ![X0]: (sQ2_spl <=> (~subpopulations(efficient_producers,first_movers,X0,sK0_skl)))),
% 0.20/0.50 introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.20/0.50 fof(f56,plain,(
% 0.20/0.50 ![X0]: (~subpopulations(efficient_producers,first_movers,X0,sK0_skl)|~sQ2_spl)),
% 0.20/0.50 inference(component_clause,[status(thm)],[f55])).
% 0.20/0.50 fof(f58,definition,(
% 0.20/0.50 sQ3_spl <=> (greater(zero,growth_rate(efficient_producers,sK0_skl)))),
% 0.20/0.50 introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.20/0.50 fof(f59,plain,(
% 0.20/0.50 greater(zero,growth_rate(efficient_producers,sK0_skl))|~sQ3_spl),
% 0.20/0.50 inference(component_clause,[status(thm)],[f58])).
% 0.20/0.50 fof(f61,plain,(
% 0.20/0.50 sQ2_spl|sQ3_spl|~sQ0_spl),
% 0.20/0.50 inference(split_clause,[status(thm)],[f54,f55,f58,f36])).
% 0.20/0.50 fof(f76,plain,(
% 0.20/0.50 ![X0,X1,X2,X3]: (~environment(X0)|~subpopulations(X1,X2,X0,X3)|~outcompetes(X2,X1,X3)|~sQ1_spl)),
% 0.20/0.50 inference(backward_subsumption_resolution,[status(thm)],[f25,f40])).
% 0.20/0.50 fof(f79,plain,(
% 0.20/0.50 ![X0,X1,X2]: (~subpopulations(X0,X1,sK1_skl,X2)|subpopulations(X1,X0,sK1_skl,X2))),
% 0.20/0.50 inference(resolution,[status(thm)],[f33,f10])).
% 0.20/0.50 fof(f80,plain,(
% 0.20/0.50 ![X0,X1,X2]: (~subpopulations(X0,X1,sK1_skl,X2)|~outcompetes(X1,X0,X2)|~sQ1_spl)),
% 0.20/0.50 inference(resolution,[status(thm)],[f33,f76])).
% 0.20/0.50 fof(f82,plain,(
% 0.20/0.50 ![X0,X1,X2]: (~subpopulations(X0,X1,sK1_skl,X2)|~outcompetes(X0,X1,X2)|~sQ1_spl)),
% 0.20/0.50 inference(resolution,[status(thm)],[f79,f80])).
% 0.20/0.50 fof(f83,plain,(
% 0.20/0.50 ~subpopulations(first_movers,efficient_producers,sK1_skl,sK0_skl)|~sQ1_spl),
% 0.20/0.50 inference(resolution,[status(thm)],[f82,f35])).
% 0.20/0.50 fof(f84,plain,(
% 0.20/0.50 $false|~sQ1_spl),
% 0.20/0.50 inference(forward_subsumption_resolution,[status(thm)],[f83,f34])).
% 0.20/0.50 fof(f85,plain,(
% 0.20/0.50 ~sQ1_spl),
% 0.20/0.50 inference(contradiction_clause,[status(thm)],[f84])).
% 0.20/0.50 fof(f90,plain,(
% 0.20/0.50 subpopulations(efficient_producers,first_movers,sK1_skl,sK0_skl)|~sQ0_spl),
% 0.20/0.50 inference(resolution,[status(thm)],[f50,f34])).
% 0.20/0.50 fof(f91,plain,(
% 0.20/0.50 $false|~sQ2_spl|~sQ0_spl),
% 0.20/0.50 inference(forward_subsumption_resolution,[status(thm)],[f90,f56])).
% 0.20/0.50 fof(f92,plain,(
% 0.20/0.50 ~sQ2_spl|~sQ0_spl),
% 0.20/0.50 inference(contradiction_clause,[status(thm)],[f91])).
% 0.20/0.50 fof(f95,plain,(
% 0.20/0.50 ![X0]: (~subpopulations(efficient_producers,first_movers,X0,sK0_skl)|greater_or_equal(growth_rate(first_movers,sK0_skl),zero)|~sQ0_spl)),
% 0.20/0.50 inference(resolution,[status(thm)],[f46,f35])).
% 0.20/0.50 fof(f96,definition,(
% 0.20/0.50 sQ6_spl <=> (greater_or_equal(growth_rate(first_movers,sK0_skl),zero))),
% 0.20/0.50 introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition])).
% 0.20/0.50 fof(f97,plain,(
% 0.20/0.50 greater_or_equal(growth_rate(first_movers,sK0_skl),zero)|~sQ6_spl),
% 0.20/0.50 inference(component_clause,[status(thm)],[f96])).
% 0.20/0.50 fof(f99,plain,(
% 0.20/0.50 sQ2_spl|sQ6_spl|~sQ0_spl),
% 0.20/0.50 inference(split_clause,[status(thm)],[f95,f55,f96,f36])).
% 0.20/0.50 fof(f108,definition,(
% 0.20/0.50 sQ8_spl <=> (greater(zero,growth_rate(first_movers,sK0_skl)))),
% 0.20/0.50 introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition])).
% 0.20/0.50 fof(f109,plain,(
% 0.20/0.50 greater(zero,growth_rate(first_movers,sK0_skl))|~sQ8_spl),
% 0.20/0.50 inference(component_clause,[status(thm)],[f108])).
% 0.20/0.50 fof(f113,plain,(
% 0.20/0.50 ![X0,X1]: (subpopulations(efficient_producers,X0,X1,sK0_skl)|~sQ3_spl)),
% 0.20/0.51 inference(resolution,[status(thm)],[f17,f59])).
% 0.20/0.51 fof(f114,plain,(
% 0.20/0.51 ![X0]: (in_environment(X0,sK0_skl)|~sQ3_spl|~sQ0_spl)),
% 0.20/0.51 inference(resolution,[status(thm)],[f113,f52])).
% 0.20/0.51 fof(f123,plain,(
% 0.20/0.51 ![X0,X1]: (~in_environment(X0,X1)|greater(zero,growth_rate(first_movers,X1))|~greater(zero,growth_rate(efficient_producers,X1))|~sQ0_spl)),
% 0.20/0.51 inference(resolution,[status(thm)],[f44,f26])).
% 0.20/0.51 fof(f124,plain,(
% 0.20/0.51 ![X0]: (~in_environment(X0,sK0_skl)|greater(zero,growth_rate(first_movers,sK0_skl))|~sQ0_spl|~sQ3_spl)),
% 0.20/0.51 inference(resolution,[status(thm)],[f123,f59])).
% 0.20/0.51 fof(f125,definition,(
% 0.20/0.51 ![X0]: (sQ9_spl <=> (~in_environment(X0,sK0_skl)))),
% 0.20/0.51 introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition])).
% 0.20/0.51 fof(f126,plain,(
% 0.20/0.51 ![X0]: (~in_environment(X0,sK0_skl)|~sQ9_spl)),
% 0.20/0.51 inference(component_clause,[status(thm)],[f125])).
% 0.20/0.51 fof(f128,plain,(
% 0.20/0.51 sQ9_spl|sQ8_spl|~sQ0_spl|~sQ3_spl),
% 0.20/0.51 inference(split_clause,[status(thm)],[f124,f125,f108,f36,f58])).
% 0.20/0.51 fof(f129,plain,(
% 0.20/0.51 ~greater_or_equal(growth_rate(first_movers,sK0_skl),zero)|~sQ8_spl),
% 0.20/0.51 inference(resolution,[status(thm)],[f109,f18])).
% 0.20/0.51 fof(f132,plain,(
% 0.20/0.51 $false|~sQ6_spl|~sQ8_spl),
% 0.20/0.51 inference(forward_subsumption_resolution,[status(thm)],[f129,f97])).
% 0.20/0.51 fof(f133,plain,(
% 0.20/0.51 ~sQ6_spl|~sQ8_spl),
% 0.20/0.51 inference(contradiction_clause,[status(thm)],[f132])).
% 0.20/0.51 fof(f134,plain,(
% 0.20/0.51 $false|~sQ3_spl|~sQ0_spl|~sQ9_spl),
% 0.20/0.51 inference(forward_subsumption_resolution,[status(thm)],[f126,f114])).
% 0.20/0.51 fof(f135,plain,(
% 0.20/0.51 ~sQ3_spl|~sQ0_spl|~sQ9_spl),
% 0.20/0.51 inference(contradiction_clause,[status(thm)],[f134])).
% 0.20/0.51 fof(f136,plain,(
% 0.20/0.51 $false),
% 0.20/0.51 inference(sat_refutation,[status(thm)],[f42,f61,f85,f92,f99,f128,f133,f135])).
% 0.20/0.51 % SZS output end CNFRefutation for theBenchmark.p
% 0.22/0.57 % Elapsed time: 0.081078 seconds
% 0.22/0.57 % CPU time: 0.099830 seconds
% 0.22/0.57 % Total memory used: 3.588 MB
% 0.22/0.57 % Net memory used: 3.568 MB
%------------------------------------------------------------------------------