%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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 : Unsatisfiable 0.12s 0.59s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 41 ( 13 unt; 5 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 41 ~; 40 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] :
( ~ number_of_routines(A,B,high)
| ~ number_of_routines(A,B,low) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,hypothesis,
! [A,B] :
( has_elaborated_routines(A,B)
| ~ founding_time(A,B)
| ~ efficient_producer(A)
| ~ organisation_at_time(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,hypothesis,
! [A,B] :
( number_of_routines(A,B,low)
| ~ founding_time(A,B)
| ~ first_mover(A)
| ~ organisation_at_time(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,hypothesis,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,hypothesis,
founding_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,hypothesis,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,hypothesis,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
! [A,B] :
( efficient_producer(A)
| first_mover(A)
| ~ organisation_at_time(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
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)],[f2]) ).
fof(f11,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)],[f3]) ).
fof(f12,plain,
organisation_at_time(sk1,sk2),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f13,plain,
founding_time(sk1,sk2),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f14,plain,
number_of_routines(sk1,sk2,high),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f15,plain,
~ has_elaborated_routines(sk1,sk2),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f16,plain,
! [A] :
( efficient_producer(A)
| first_mover(A)
| ! [B] : ~ organisation_at_time(A,B) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f17,plain,
! [X0,X1] :
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f18,plain,
( efficient_producer(sk1)
| first_mover(sk1) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f19,definition,
( sQ0_spl
<=> first_mover(sk1) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f22,definition,
( sQ1_spl
<=> efficient_producer(sk1) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f23,plain,
( ~ sQ1_spl
| efficient_producer(sk1) ),
inference(component_clause,[status(thm)],[f22]) ).
fof(f25,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f18,f19,f22]) ).
fof(f26,plain,
( number_of_routines(sk1,sk2,low)
| ~ first_mover(sk1)
| ~ organisation_at_time(sk1,sk2) ),
inference(resolution,[status(thm)],[f13,f11]) ).
fof(f27,definition,
( sQ2_spl
<=> organisation_at_time(sk1,sk2) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f29,plain,
( sQ2_spl
| ~ organisation_at_time(sk1,sk2) ),
inference(component_clause,[status(thm)],[f27]) ).
fof(f30,definition,
( sQ3_spl
<=> number_of_routines(sk1,sk2,low) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f31,plain,
( ~ sQ3_spl
| number_of_routines(sk1,sk2,low) ),
inference(component_clause,[status(thm)],[f30]) ).
fof(f33,plain,
( sQ3_spl
| ~ sQ0_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f26,f27,f19,f30]) ).
fof(f34,plain,
! [X0] :
( ~ sQ1_spl
| has_elaborated_routines(sk1,X0)
| ~ founding_time(sk1,X0)
| ~ organisation_at_time(sk1,X0) ),
inference(resolution,[status(thm)],[f23,f10]) ).
fof(f35,plain,
( ~ sQ1_spl
| ~ founding_time(sk1,sk2)
| ~ organisation_at_time(sk1,sk2) ),
inference(resolution,[status(thm)],[f15,f34]) ).
fof(f36,definition,
( sQ4_spl
<=> founding_time(sk1,sk2) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f38,plain,
( sQ4_spl
| ~ founding_time(sk1,sk2) ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,plain,
( ~ sQ1_spl
| ~ sQ4_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f35,f27,f36,f22]) ).
fof(f40,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f29,f12]) ).
fof(f41,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f40]) ).
fof(f42,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f38,f13]) ).
fof(f43,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f42]) ).
fof(f44,plain,
~ number_of_routines(sk1,sk2,low),
inference(resolution,[status(thm)],[f9,f14]) ).
fof(f45,plain,
( ~ sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f44,f31]) ).
fof(f46,plain,
~ sQ3_spl,
inference(contradiction_clause,[status(thm)],[f45]) ).
fof(f47,plain,
$false,
inference(sat_refutation,[status(thm)],[f25,f33,f39,f41,f43,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.56 % Computer : n018.cluster.edu
% 0.12/0.56 % Model : x86_64 x86_64
% 0.12/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.56 % Memory : 8046.5625MB
% 0.12/0.56 % OS : Linux 6.8.0-71-generic
% 0.12/0.56 % CPULimit : 300
% 0.12/0.56 % WCLimit : 300
% 0.12/0.56 % DateTime : Mon Sep 21 01:24:44 UTC 2026
% 0.12/0.57 % CPUTime :
% 0.12/0.57 % Drodi V4.1.1
% 0.12/0.59 % Refutation found
% 0.12/0.59 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.61 % Elapsed time: 0.042036 seconds
% 0.12/0.61 % CPU time: 0.113796 seconds
% 0.12/0.61 % Total memory used: 16.633 MB
% 0.12/0.61 % Net memory used: 16.112 MB
%------------------------------------------------------------------------------