↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : MGT008-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n006.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:13 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.39s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   78 (  32 unt;   9 def)
%            Number of atoms       :  253 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  344 ( 169   ~; 166   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   17 (  16 usr;  10 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :  118 ( 118   !;   0   ?)

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

fof(f2,hypothesis,
    ! [A,B,C,D,E,F,G,H,I] :
      ( greater(I,H)
      | ~ greater(G,F)
      | ~ inertia(C,I,D)
      | ~ inertia(A,H,B)
      | ~ size(C,G,D)
      | ~ size(A,F,B)
      | ~ class(C,E,D)
      | ~ class(A,E,B)
      | ~ organization(C,D)
      | ~ organization(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,hypothesis,
    ! [A,B,C,D,E,F,G,H] :
      ( greater(H,G)
      | ~ greater(F,E)
      | ~ survival_chance(C,H,D)
      | ~ survival_chance(A,G,B)
      | ~ inertia(C,F,D)
      | ~ inertia(A,E,B)
      | ~ reorganization_free(C,D,D)
      | ~ reorganization_free(A,B,B)
      | ~ organization(C,D)
      | ~ organization(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    organization(sk2,sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    organization(sk3,sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    reorganization_free(sk2,sk9,sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,negated_conjecture,
    reorganization_free(sk3,sk10,sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,negated_conjecture,
    class(sk2,sk4,sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    class(sk3,sk4,sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    survival_chance(sk2,sk5,sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f11,negated_conjecture,
    survival_chance(sk3,sk6,sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    size(sk2,sk7,sk9),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    size(sk3,sk8,sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f14,negated_conjecture,
    greater(sk8,sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f15,negated_conjecture,
    ~ greater(sk6,sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f16,plain,
    ! [X0,X1] :
      ( inertia(X0,sk1(X1,X0),X1)
      | ~ organization(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f17,plain,
    ! [H,I] :
      ( greater(I,H)
      | ! [F,G] :
          ( ~ greater(G,F)
          | ! [C,D] :
              ( ~ inertia(C,I,D)
              | ! [A,B] :
                  ( ~ inertia(A,H,B)
                  | ~ size(C,G,D)
                  | ~ size(A,F,B)
                  | ! [E] :
                      ( ~ class(C,E,D)
                      | ~ class(A,E,B)
                      | ~ organization(C,D)
                      | ~ organization(A,B) ) ) ) ) ),
    inference(miniscoping,[status(thm)],[f2]) ).

fof(f18,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
      ( greater(X8,X7)
      | ~ greater(X6,X5)
      | ~ inertia(X2,X8,X3)
      | ~ inertia(X0,X7,X1)
      | ~ size(X2,X6,X3)
      | ~ size(X0,X5,X1)
      | ~ class(X2,X4,X3)
      | ~ class(X0,X4,X1)
      | ~ organization(X2,X3)
      | ~ organization(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f19,plain,
    ! [G,H] :
      ( greater(H,G)
      | ! [E,F] :
          ( ~ greater(F,E)
          | ! [C,D] :
              ( ~ survival_chance(C,H,D)
              | ! [A,B] :
                  ( ~ survival_chance(A,G,B)
                  | ~ inertia(C,F,D)
                  | ~ inertia(A,E,B)
                  | ~ reorganization_free(C,D,D)
                  | ~ reorganization_free(A,B,B)
                  | ~ organization(C,D)
                  | ~ organization(A,B) ) ) ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f20,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( greater(X7,X6)
      | ~ greater(X5,X4)
      | ~ survival_chance(X2,X7,X3)
      | ~ survival_chance(X0,X6,X1)
      | ~ inertia(X2,X5,X3)
      | ~ inertia(X0,X4,X1)
      | ~ reorganization_free(X2,X3,X3)
      | ~ reorganization_free(X0,X1,X1)
      | ~ organization(X2,X3)
      | ~ organization(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f19]) ).

fof(f21,plain,
    organization(sk2,sk9),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f22,plain,
    organization(sk3,sk10),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f23,plain,
    reorganization_free(sk2,sk9,sk9),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f24,plain,
    reorganization_free(sk3,sk10,sk10),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f25,plain,
    class(sk2,sk4,sk9),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f26,plain,
    class(sk3,sk4,sk10),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f27,plain,
    survival_chance(sk2,sk5,sk9),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f28,plain,
    survival_chance(sk3,sk6,sk10),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f29,plain,
    size(sk2,sk7,sk9),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f30,plain,
    size(sk3,sk8,sk10),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f31,plain,
    greater(sk8,sk7),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f32,plain,
    ~ greater(sk6,sk5),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f33,plain,
    inertia(sk3,sk1(sk10,sk3),sk10),
    inference(resolution,[status(thm)],[f16,f22]) ).

fof(f34,plain,
    inertia(sk2,sk1(sk9,sk2),sk9),
    inference(resolution,[status(thm)],[f16,f21]) ).

fof(f35,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( greater(X5,X4)
      | ~ greater(X3,X2)
      | ~ inertia(X0,X5,X1)
      | ~ inertia(sk2,X4,sk9)
      | ~ size(X0,X3,X1)
      | ~ size(sk2,X2,sk9)
      | ~ class(X0,sk4,X1)
      | ~ organization(X0,X1)
      | ~ organization(sk2,sk9) ),
    inference(resolution,[status(thm)],[f25,f18]) ).

fof(f36,definition,
    ( sQ0_spl
  <=> organization(sk2,sk9) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f38,plain,
    ( sQ0_spl
    | ~ organization(sk2,sk9) ),
    inference(component_clause,[status(thm)],[f36]) ).

fof(f39,definition,
    ! [X0,X1,X2,X3,X4,X5] :
      ( sQ1_spl
    <=> ( greater(X5,X4)
        | ~ greater(X3,X2)
        | ~ inertia(X0,X5,X1)
        | ~ inertia(sk2,X4,sk9)
        | ~ size(X0,X3,X1)
        | ~ size(sk2,X2,sk9)
        | ~ class(X0,sk4,X1)
        | ~ organization(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f40,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ sQ1_spl
      | greater(X5,X4)
      | ~ greater(X3,X2)
      | ~ inertia(X0,X5,X1)
      | ~ inertia(sk2,X4,sk9)
      | ~ size(X0,X3,X1)
      | ~ size(sk2,X2,sk9)
      | ~ class(X0,sk4,X1)
      | ~ organization(X0,X1) ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,plain,
    ( sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f35,f36,f39]) ).

fof(f43,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f38,f21]) ).

fof(f44,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f43]) ).

fof(f46,definition,
    ( sQ2_spl
  <=> organization(sk3,sk10) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f48,plain,
    ( sQ2_spl
    | ~ organization(sk3,sk10) ),
    inference(component_clause,[status(thm)],[f46]) ).

fof(f53,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f48,f22]) ).

fof(f54,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f53]) ).

fof(f56,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( greater(X5,X4)
      | ~ greater(X3,X2)
      | ~ survival_chance(X0,X5,X1)
      | ~ survival_chance(sk2,X4,sk9)
      | ~ inertia(X0,X3,X1)
      | ~ inertia(sk2,X2,sk9)
      | ~ reorganization_free(X0,X1,X1)
      | ~ organization(X0,X1)
      | ~ organization(sk2,sk9) ),
    inference(resolution,[status(thm)],[f20,f23]) ).

fof(f61,definition,
    ! [X0,X1,X2,X3,X4,X5] :
      ( sQ5_spl
    <=> ( greater(X5,X4)
        | ~ greater(X3,X2)
        | ~ survival_chance(X0,X5,X1)
        | ~ survival_chance(sk2,X4,sk9)
        | ~ inertia(X0,X3,X1)
        | ~ inertia(sk2,X2,sk9)
        | ~ reorganization_free(X0,X1,X1)
        | ~ organization(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f62,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ sQ5_spl
      | greater(X5,X4)
      | ~ greater(X3,X2)
      | ~ survival_chance(X0,X5,X1)
      | ~ survival_chance(sk2,X4,sk9)
      | ~ inertia(X0,X3,X1)
      | ~ inertia(sk2,X2,sk9)
      | ~ reorganization_free(X0,X1,X1)
      | ~ organization(X0,X1) ),
    inference(component_clause,[status(thm)],[f61]) ).

fof(f64,plain,
    ( sQ5_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f56,f36,f61]) ).

fof(f65,plain,
    ! [X0,X1,X2,X3] :
      ( ~ sQ5_spl
      | greater(X3,X2)
      | ~ greater(X1,X0)
      | ~ survival_chance(sk3,X3,sk10)
      | ~ survival_chance(sk2,X2,sk9)
      | ~ inertia(sk3,X1,sk10)
      | ~ inertia(sk2,X0,sk9)
      | ~ organization(sk3,sk10) ),
    inference(resolution,[status(thm)],[f62,f24]) ).

fof(f67,definition,
    ! [X0,X1] :
      ( sQ6_spl
    <=> ( ~ greater(X1,X0)
        | ~ inertia(sk3,X1,sk10)
        | ~ inertia(sk2,X0,sk9) ) ),
    introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ~ sQ6_spl
      | ~ greater(X1,X0)
      | ~ inertia(sk3,X1,sk10)
      | ~ inertia(sk2,X0,sk9) ),
    inference(component_clause,[status(thm)],[f67]) ).

fof(f70,definition,
    ! [X2,X3] :
      ( sQ7_spl
    <=> ( greater(X3,X2)
        | ~ survival_chance(sk3,X3,sk10)
        | ~ survival_chance(sk2,X2,sk9) ) ),
    introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ~ sQ7_spl
      | greater(X1,X0)
      | ~ survival_chance(sk3,X1,sk10)
      | ~ survival_chance(sk2,X0,sk9) ),
    inference(component_clause,[status(thm)],[f70]) ).

fof(f73,plain,
    ( ~ sQ5_spl
    | sQ7_spl
    | sQ6_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f65,f46,f67,f70,f61]) ).

fof(f82,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ~ sQ1_spl
      | greater(X4,X3)
      | ~ greater(X2,sk7)
      | ~ inertia(X0,X4,X1)
      | ~ inertia(sk2,X3,sk9)
      | ~ size(X0,X2,X1)
      | ~ class(X0,sk4,X1)
      | ~ organization(X0,X1) ),
    inference(resolution,[status(thm)],[f40,f29]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ~ sQ1_spl
      | greater(X1,X0)
      | ~ greater(sk8,sk7)
      | ~ inertia(sk3,X1,sk10)
      | ~ inertia(sk2,X0,sk9)
      | ~ class(sk3,sk4,sk10)
      | ~ organization(sk3,sk10) ),
    inference(resolution,[status(thm)],[f82,f30]) ).

fof(f87,definition,
    ( sQ10_spl
  <=> class(sk3,sk4,sk10) ),
    introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).

fof(f89,plain,
    ( sQ10_spl
    | ~ class(sk3,sk4,sk10) ),
    inference(component_clause,[status(thm)],[f87]) ).

fof(f90,definition,
    ! [X0,X1] :
      ( sQ11_spl
    <=> ( greater(X1,X0)
        | ~ inertia(sk3,X1,sk10)
        | ~ inertia(sk2,X0,sk9) ) ),
    introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ sQ11_spl
      | greater(X1,X0)
      | ~ inertia(sk3,X1,sk10)
      | ~ inertia(sk2,X0,sk9) ),
    inference(component_clause,[status(thm)],[f90]) ).

fof(f93,definition,
    ( sQ12_spl
  <=> greater(sk8,sk7) ),
    introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).

fof(f95,plain,
    ( sQ12_spl
    | ~ greater(sk8,sk7) ),
    inference(component_clause,[status(thm)],[f93]) ).

fof(f96,plain,
    ( ~ sQ1_spl
    | ~ sQ12_spl
    | sQ11_spl
    | ~ sQ10_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f85,f46,f87,f90,f93,f39]) ).

fof(f110,plain,
    ( sQ12_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f95,f31]) ).

fof(f111,plain,
    sQ12_spl,
    inference(contradiction_clause,[status(thm)],[f110]) ).

fof(f112,plain,
    ( sQ10_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f89,f26]) ).

fof(f113,plain,
    sQ10_spl,
    inference(contradiction_clause,[status(thm)],[f112]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( ~ sQ11_spl
      | ~ sQ6_spl
      | ~ inertia(sk3,X1,sk10)
      | ~ inertia(sk2,X0,sk9) ),
    inference(forward_subsumption_resolution,[status(thm)],[f91,f68]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ sQ11_spl
      | ~ sQ6_spl
      | ~ inertia(sk3,X0,sk10) ),
    inference(resolution,[status(thm)],[f114,f34]) ).

fof(f136,plain,
    ( ~ sQ11_spl
    | ~ sQ6_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f33,f134]) ).

fof(f137,plain,
    ( ~ sQ11_spl
    | ~ sQ6_spl ),
    inference(contradiction_clause,[status(thm)],[f136]) ).

fof(f151,plain,
    ! [X0] :
      ( ~ sQ7_spl
      | greater(X0,sk5)
      | ~ survival_chance(sk3,X0,sk10) ),
    inference(resolution,[status(thm)],[f71,f27]) ).

fof(f152,plain,
    ( ~ sQ7_spl
    | greater(sk6,sk5) ),
    inference(resolution,[status(thm)],[f151,f28]) ).

fof(f153,plain,
    ( ~ sQ7_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f152,f32]) ).

fof(f154,plain,
    ~ sQ7_spl,
    inference(contradiction_clause,[status(thm)],[f153]) ).

fof(f155,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f42,f44,f54,f64,f73,f96,f111,f113,f137,f154]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT008-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n006.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 01:20:43 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % Drodi V4.1.1
% 0.11/0.39  % Refutation found
% 0.11/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.41  % Elapsed time: 0.055918 seconds
% 0.11/0.41  % CPU time: 0.162473 seconds
% 0.11/0.41  % Total memory used: 56.313 MB
% 0.11/0.41  % Net memory used: 55.889 MB
%------------------------------------------------------------------------------