%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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:25 PM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 9 unt; 5 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 110 ( 48 ~; 40 |; 15 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 6 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,T] :
~ ( number_of_routines(X,T,high)
& number_of_routines(X,T,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,hypothesis,
! [X,T] :
( ( founding_time(X,T)
& efficient_producer(X)
& organisation_at_time(X,T) )
=> has_elaborated_routines(X,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,hypothesis,
! [X,T] :
( ( founding_time(X,T)
& first_mover(X)
& organisation_at_time(X,T) )
=> number_of_routines(X,T,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,hypothesis,
? [X,T] :
( ~ has_elaborated_routines(X,T)
& number_of_routines(X,T,high)
& founding_time(X,T)
& organisation_at_time(X,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
? [X,T] :
( ~ efficient_producer(X)
& ~ first_mover(X)
& organisation_at_time(X,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ? [X,T] :
( ~ efficient_producer(X)
& ~ first_mover(X)
& organisation_at_time(X,T) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X,T] :
( ~ number_of_routines(X,T,high)
| ~ number_of_routines(X,T,low) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f9,plain,
! [X,T] :
( has_elaborated_routines(X,T)
| ~ founding_time(X,T)
| ~ efficient_producer(X)
| ~ organisation_at_time(X,T) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f10,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f11,plain,
! [X,T] :
( number_of_routines(X,T,low)
| ~ founding_time(X,T)
| ~ first_mover(X)
| ~ organisation_at_time(X,T) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f12,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f13,plain,
( ~ has_elaborated_routines(sK0_skl,sK1_skl)
& number_of_routines(sK0_skl,sK1_skl,high)
& founding_time(sK0_skl,sK1_skl)
& organisation_at_time(sK0_skl,sK1_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(T,sK1_skl)],[f4]) ).
fof(f14,plain,
organisation_at_time(sK0_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f15,plain,
founding_time(sK0_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f16,plain,
number_of_routines(sK0_skl,sK1_skl,high),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f17,plain,
~ has_elaborated_routines(sK0_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f18,plain,
! [X,T] :
( efficient_producer(X)
| first_mover(X)
| ~ organisation_at_time(X,T) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f19,plain,
! [X] :
( efficient_producer(X)
| first_mover(X)
| ! [T] : ~ organisation_at_time(X,T) ),
inference(miniscoping,[status(thm)],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f21,plain,
( efficient_producer(sK0_skl)
| first_mover(sK0_skl) ),
inference(resolution,[status(thm)],[f14,f20]) ).
fof(f22,definition,
( sQ0_spl
<=> first_mover(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f25,definition,
( sQ1_spl
<=> efficient_producer(sK0_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f26,plain,
( ~ sQ1_spl
| efficient_producer(sK0_skl) ),
inference(component_clause,[status(thm)],[f25]) ).
fof(f28,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f21,f22,f25]) ).
fof(f29,plain,
( number_of_routines(sK0_skl,sK1_skl,low)
| ~ first_mover(sK0_skl)
| ~ organisation_at_time(sK0_skl,sK1_skl) ),
inference(resolution,[status(thm)],[f15,f12]) ).
fof(f30,definition,
( sQ2_spl
<=> organisation_at_time(sK0_skl,sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f32,plain,
( sQ2_spl
| ~ organisation_at_time(sK0_skl,sK1_skl) ),
inference(component_clause,[status(thm)],[f30]) ).
fof(f33,definition,
( sQ3_spl
<=> number_of_routines(sK0_skl,sK1_skl,low) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f34,plain,
( ~ sQ3_spl
| number_of_routines(sK0_skl,sK1_skl,low) ),
inference(component_clause,[status(thm)],[f33]) ).
fof(f36,plain,
( sQ3_spl
| ~ sQ0_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f29,f30,f22,f33]) ).
fof(f37,plain,
! [X0] :
( ~ sQ1_spl
| has_elaborated_routines(sK0_skl,X0)
| ~ founding_time(sK0_skl,X0)
| ~ organisation_at_time(sK0_skl,X0) ),
inference(resolution,[status(thm)],[f26,f10]) ).
fof(f38,plain,
( ~ sQ1_spl
| ~ founding_time(sK0_skl,sK1_skl)
| ~ organisation_at_time(sK0_skl,sK1_skl) ),
inference(resolution,[status(thm)],[f17,f37]) ).
fof(f39,definition,
( sQ4_spl
<=> founding_time(sK0_skl,sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f41,plain,
( sQ4_spl
| ~ founding_time(sK0_skl,sK1_skl) ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( ~ sQ1_spl
| ~ sQ4_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f38,f30,f39,f25]) ).
fof(f43,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f32,f14]) ).
fof(f44,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f43]) ).
fof(f45,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f41,f15]) ).
fof(f46,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f45]) ).
fof(f47,plain,
~ number_of_routines(sK0_skl,sK1_skl,low),
inference(resolution,[status(thm)],[f8,f16]) ).
fof(f48,plain,
( ~ sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f47,f34]) ).
fof(f49,plain,
~ sQ3_spl,
inference(contradiction_clause,[status(thm)],[f48]) ).
fof(f50,plain,
$false,
inference(sat_refutation,[status(thm)],[f28,f36,f42,f44,f46,f49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 01:25:17 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.36 % Drodi V4.1.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40 % Elapsed time: 0.048011 seconds
% 0.13/0.40 % CPU time: 0.133755 seconds
% 0.13/0.40 % Total memory used: 16.618 MB
% 0.13/0.40 % Net memory used: 16.089 MB
%------------------------------------------------------------------------------