%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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:48 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.37 % Computer : n026.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 01:26:24 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.10/0.39 % Refutation found
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.39 fof(f1,axiom,(
% 0.10/0.39 (![A,B]: (( ~ number_of_routines(A,B,low)| ~ number_of_routines(A,B,high) ) ))),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f2,hypothesis,(
% 0.10/0.39 (![A,B]: (( ~ organisation_at_time(A,B)| ~ efficient_producer(A)| ~ founding_time(A,B)| has_elaborated_routines(A,B) ) ))),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f3,hypothesis,(
% 0.10/0.39 (![A,B]: (( ~ organisation_at_time(A,B)| ~ first_mover(A)| ~ founding_time(A,B)| number_of_routines(A,B,low) ) ))),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f4,hypothesis,(
% 0.10/0.39 organisation_at_time(sk1,sk2) ),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f5,hypothesis,(
% 0.10/0.39 founding_time(sk1,sk2) ),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f6,hypothesis,(
% 0.10/0.39 number_of_routines(sk1,sk2,high) ),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f7,hypothesis,(
% 0.10/0.39 ~ has_elaborated_routines(sk1,sk2) ),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f8,negated_conjecture,(
% 0.10/0.39 (![A,B]: (( ~ organisation_at_time(A,B)| first_mover(A)| efficient_producer(A) ) ))),
% 0.10/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f9,plain,(
% 0.10/0.39 ![X0,X1]: (~number_of_routines(X0,X1,low)|~number_of_routines(X0,X1,high))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f1])).
% 0.10/0.39 fof(f10,plain,(
% 0.10/0.39 ![X0,X1]: (~organisation_at_time(X0,X1)|~efficient_producer(X0)|~founding_time(X0,X1)|has_elaborated_routines(X0,X1))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f2])).
% 0.10/0.39 fof(f11,plain,(
% 0.10/0.39 ![X0,X1]: (~organisation_at_time(X0,X1)|~first_mover(X0)|~founding_time(X0,X1)|number_of_routines(X0,X1,low))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f3])).
% 0.10/0.39 fof(f12,plain,(
% 0.10/0.39 organisation_at_time(sk1,sk2)),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f4])).
% 0.10/0.39 fof(f13,plain,(
% 0.10/0.39 founding_time(sk1,sk2)),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.39 fof(f14,plain,(
% 0.10/0.39 number_of_routines(sk1,sk2,high)),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.39 fof(f15,plain,(
% 0.10/0.39 ~has_elaborated_routines(sk1,sk2)),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f7])).
% 0.10/0.39 fof(f16,plain,(
% 0.10/0.39 ![A]: (((![B]: ~organisation_at_time(A,B))|first_mover(A))|efficient_producer(A))),
% 0.10/0.39 inference(miniscoping,[status(thm)],[f8])).
% 0.10/0.39 fof(f17,plain,(
% 0.10/0.39 ![X0,X1]: (~organisation_at_time(X0,X1)|first_mover(X0)|efficient_producer(X0))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f16])).
% 0.10/0.39 fof(f18,plain,(
% 0.10/0.39 ~efficient_producer(sk1)|~founding_time(sk1,sk2)|has_elaborated_routines(sk1,sk2)),
% 0.10/0.39 inference(resolution,[status(thm)],[f10,f12])).
% 0.10/0.39 fof(f19,definition,(
% 0.10/0.39 sQ0_spl <=> (efficient_producer(sk1))),
% 0.10/0.39 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.10/0.39 fof(f22,definition,(
% 0.10/0.39 sQ1_spl <=> (founding_time(sk1,sk2))),
% 0.10/0.39 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 0.10/0.39 fof(f24,plain,(
% 0.10/0.39 ~founding_time(sk1,sk2)|sQ1_spl),
% 0.10/0.39 inference(component_clause,[status(thm)],[f22])).
% 0.10/0.39 fof(f25,definition,(
% 0.10/0.39 sQ2_spl <=> (has_elaborated_routines(sk1,sk2))),
% 0.10/0.39 introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition])).
% 0.10/0.39 fof(f26,plain,(
% 0.10/0.39 has_elaborated_routines(sk1,sk2)|~sQ2_spl),
% 0.10/0.39 inference(component_clause,[status(thm)],[f25])).
% 0.10/0.39 fof(f28,plain,(
% 0.10/0.39 ~sQ0_spl|~sQ1_spl|sQ2_spl),
% 0.10/0.39 inference(split_clause,[status(thm)],[f18,f19,f22,f25])).
% 0.10/0.39 fof(f29,plain,(
% 0.10/0.39 ~first_mover(sk1)|~founding_time(sk1,sk2)|number_of_routines(sk1,sk2,low)),
% 0.10/0.39 inference(resolution,[status(thm)],[f11,f12])).
% 0.10/0.39 fof(f30,definition,(
% 0.10/0.39 sQ3_spl <=> (first_mover(sk1))),
% 0.10/0.39 introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.10/0.39 fof(f33,definition,(
% 0.10/0.39 sQ4_spl <=> (number_of_routines(sk1,sk2,low))),
% 0.10/0.39 introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.10/0.39 fof(f34,plain,(
% 0.10/0.39 number_of_routines(sk1,sk2,low)|~sQ4_spl),
% 0.10/0.39 inference(component_clause,[status(thm)],[f33])).
% 0.10/0.39 fof(f36,plain,(
% 0.10/0.39 ~sQ3_spl|~sQ1_spl|sQ4_spl),
% 0.10/0.39 inference(split_clause,[status(thm)],[f29,f30,f22,f33])).
% 0.10/0.39 fof(f37,plain,(
% 0.10/0.39 $false|sQ1_spl),
% 0.10/0.39 inference(forward_subsumption_resolution,[status(thm)],[f13,f24])).
% 0.10/0.39 fof(f38,plain,(
% 0.10/0.39 sQ1_spl),
% 0.10/0.39 inference(contradiction_clause,[status(thm)],[f37])).
% 0.10/0.39 fof(f39,plain,(
% 0.10/0.39 ~number_of_routines(sk1,sk2,low)),
% 0.10/0.39 inference(resolution,[status(thm)],[f14,f9])).
% 0.10/0.39 fof(f40,plain,(
% 0.10/0.39 first_mover(sk1)|efficient_producer(sk1)),
% 0.10/0.39 inference(resolution,[status(thm)],[f17,f12])).
% 0.10/0.39 fof(f41,plain,(
% 0.10/0.39 sQ3_spl|sQ0_spl),
% 0.10/0.39 inference(split_clause,[status(thm)],[f40,f30,f19])).
% 0.10/0.39 fof(f42,plain,(
% 0.10/0.39 $false|~sQ2_spl),
% 0.10/0.39 inference(forward_subsumption_resolution,[status(thm)],[f26,f15])).
% 0.10/0.39 fof(f43,plain,(
% 0.10/0.39 ~sQ2_spl),
% 0.10/0.39 inference(contradiction_clause,[status(thm)],[f42])).
% 0.10/0.39 fof(f44,plain,(
% 0.10/0.39 $false|~sQ4_spl),
% 0.10/0.39 inference(forward_subsumption_resolution,[status(thm)],[f34,f39])).
% 0.10/0.39 fof(f45,plain,(
% 0.10/0.39 ~sQ4_spl),
% 0.10/0.39 inference(contradiction_clause,[status(thm)],[f44])).
% 0.10/0.39 fof(f46,plain,(
% 0.10/0.39 $false),
% 0.10/0.39 inference(sat_refutation,[status(thm)],[f28,f36,f38,f41,f43,f45])).
% 0.10/0.39 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.42 % Elapsed time: 0.040176 seconds
% 0.10/0.42 % CPU time: 0.101755 seconds
% 0.10/0.42 % Total memory used: 15.056 MB
% 0.10/0.42 % Net memory used: 14.604 MB
%------------------------------------------------------------------------------