%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : MGT041-2 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n023.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:46 EDT 2024

% Result   : Unsatisfiable 0.15s 0.31s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   39 (  13 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   78 (  37   ~;  36   |;   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   :   18 (  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A,B] :
      ( ~ number_of_routines(A,B,low)
      | ~ number_of_routines(A,B,high) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,hypothesis,
    ! [A,B] :
      ( ~ organisation_at_time(A,B)
      | ~ efficient_producer(A)
      | ~ founding_time(A,B)
      | has_elaborated_routines(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,hypothesis,
    ! [A,B] :
      ( ~ organisation_at_time(A,B)
      | ~ first_mover(A)
      | ~ founding_time(A,B)
      | number_of_routines(A,B,low) ),
    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] :
      ( ~ organisation_at_time(A,B)
      | first_mover(A)
      | efficient_producer(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,plain,
    ! [X0,X1] :
      ( ~ number_of_routines(X0,X1,low)
      | ~ number_of_routines(X0,X1,high) ),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ organisation_at_time(X0,X1)
      | ~ efficient_producer(X0)
      | ~ founding_time(X0,X1)
      | has_elaborated_routines(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ organisation_at_time(X0,X1)
      | ~ first_mover(X0)
      | ~ founding_time(X0,X1)
      | number_of_routines(X0,X1,low) ),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f12,plain,
    organisation_at_time(sk1,sk2),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f13,plain,
    founding_time(sk1,sk2),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f14,plain,
    number_of_routines(sk1,sk2,high),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f15,plain,
    ~ has_elaborated_routines(sk1,sk2),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f16,plain,
    ! [A] :
      ( ! [B] : ~ organisation_at_time(A,B)
      | first_mover(A)
      | efficient_producer(A) ),
    inference(miniscoping,[status(esa)],[f8]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ organisation_at_time(X0,X1)
      | first_mover(X0)
      | efficient_producer(X0) ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f18,plain,
    ( spl0_0
  <=> first_mover(sk1) ),
    introduced(split_symbol_definition) ).

fof(f21,plain,
    ( spl0_1
  <=> efficient_producer(sk1) ),
    introduced(split_symbol_definition) ).

fof(f24,plain,
    ( first_mover(sk1)
    | efficient_producer(sk1) ),
    inference(resolution,[status(thm)],[f12,f17]) ).

fof(f25,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f24,f18,f21]) ).

fof(f26,plain,
    ( spl0_2
  <=> organisation_at_time(sk1,sk2) ),
    introduced(split_symbol_definition) ).

fof(f28,plain,
    ( ~ organisation_at_time(sk1,sk2)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f26]) ).

fof(f29,plain,
    ( spl0_3
  <=> number_of_routines(sk1,sk2,low) ),
    introduced(split_symbol_definition) ).

fof(f30,plain,
    ( number_of_routines(sk1,sk2,low)
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f29]) ).

fof(f32,plain,
    ( ~ organisation_at_time(sk1,sk2)
    | ~ first_mover(sk1)
    | number_of_routines(sk1,sk2,low) ),
    inference(resolution,[status(thm)],[f13,f11]) ).

fof(f33,plain,
    ( ~ spl0_2
    | ~ spl0_0
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f32,f26,f18,f29]) ).

fof(f34,plain,
    ( spl0_4
  <=> has_elaborated_routines(sk1,sk2) ),
    introduced(split_symbol_definition) ).

fof(f35,plain,
    ( has_elaborated_routines(sk1,sk2)
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f34]) ).

fof(f37,plain,
    ( ~ organisation_at_time(sk1,sk2)
    | ~ efficient_producer(sk1)
    | has_elaborated_routines(sk1,sk2) ),
    inference(resolution,[status(thm)],[f13,f10]) ).

fof(f38,plain,
    ( ~ spl0_2
    | ~ spl0_1
    | spl0_4 ),
    inference(split_clause,[status(thm)],[f37,f26,f21,f34]) ).

fof(f39,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f28,f12]) ).

fof(f40,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f39]) ).

fof(f41,plain,
    ~ number_of_routines(sk1,sk2,low),
    inference(resolution,[status(thm)],[f14,f9]) ).

fof(f42,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f35,f15]) ).

fof(f43,plain,
    ~ spl0_4,
    inference(contradiction_clause,[status(thm)],[f42]) ).

fof(f44,plain,
    ( $false
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f30,f41]) ).

fof(f45,plain,
    ~ spl0_3,
    inference(contradiction_clause,[status(thm)],[f44]) ).

fof(f46,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f25,f33,f38,f40,f43,f45]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : MGT041-2 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30  % Computer : n023.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Mon Apr 29 23:52:10 EDT 2024
% 0.09/0.30  % CPUTime  : 
% 0.09/0.31  % Drodi V3.6.0
% 0.15/0.31  % Refutation found
% 0.15/0.31  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.31  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.32  % Elapsed time: 0.011965 seconds
% 0.15/0.32  % CPU time: 0.022085 seconds
% 0.15/0.32  % Total memory used: 1.924 MB
% 0.15/0.32  % Net memory used: 1.844 MB
%------------------------------------------------------------------------------