↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n008.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:11 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   67 (  23 unt;   7 def)
%            Number of atoms       :  202 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  267 ( 132   ~; 128   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   8 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :  101 ( 101   !;   0   ?)

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

fof(f2,axiom,
    ! [A,B,C] :
      ( reorganization_free(A,B,B)
      | ~ reorganization_free(A,B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [A,B,C] :
      ( reorganization_free(A,C,C)
      | ~ reorganization_free(A,B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f6,hypothesis,
    ! [A,B,C,D,E] :
      ( greater(E,D)
      | ~ greater(C,B)
      | ~ reproducibility(A,E,C)
      | ~ reproducibility(A,D,B)
      | ~ reorganization_free(A,B,C)
      | ~ organization(A,C)
      | ~ organization(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,negated_conjecture,
    organization(sk2,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,negated_conjecture,
    organization(sk2,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    reorganization_free(sk2,sk5,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    inertia(sk2,sk3,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,negated_conjecture,
    inertia(sk2,sk4,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    greater(sk6,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ greater(sk4,sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f15,plain,
    ! [A,B] :
      ( reorganization_free(A,B,B)
      | ! [C] : ~ reorganization_free(A,B,C) ),
    inference(miniscoping,[status(thm)],[f2]) ).

fof(f16,plain,
    ! [X0,X1,X2] :
      ( reorganization_free(X0,X1,X1)
      | ~ reorganization_free(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f17,plain,
    ! [A,C] :
      ( reorganization_free(A,C,C)
      | ! [B] : ~ reorganization_free(A,B,C) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( reorganization_free(X0,X2,X2)
      | ~ reorganization_free(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

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

fof(f20,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( greater(X7,X6)
      | ~ greater(X5,X4)
      | ~ inertia(X2,X7,X3)
      | ~ inertia(X0,X6,X1)
      | ~ reproducibility(X2,X5,X3)
      | ~ reproducibility(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(f23,plain,
    ! [D,E] :
      ( greater(E,D)
      | ! [B,C] :
          ( ~ greater(C,B)
          | ! [A] :
              ( ~ reproducibility(A,E,C)
              | ~ reproducibility(A,D,B)
              | ~ reorganization_free(A,B,C)
              | ~ organization(A,C)
              | ~ organization(A,B) ) ) ),
    inference(miniscoping,[status(thm)],[f6]) ).

fof(f24,plain,
    ! [X0,X1,X2,X3,X4] :
      ( greater(X4,X3)
      | ~ greater(X2,X1)
      | ~ reproducibility(X0,X4,X2)
      | ~ reproducibility(X0,X3,X1)
      | ~ reorganization_free(X0,X1,X2)
      | ~ organization(X0,X2)
      | ~ organization(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f23]) ).

fof(f25,plain,
    organization(sk2,sk5),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f26,plain,
    organization(sk2,sk6),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f27,plain,
    reorganization_free(sk2,sk5,sk6),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f28,plain,
    inertia(sk2,sk3,sk5),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f29,plain,
    inertia(sk2,sk4,sk6),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f30,plain,
    greater(sk6,sk5),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f31,plain,
    ~ greater(sk4,sk3),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f32,plain,
    reproducibility(sk2,sk1(sk6,sk2),sk6),
    inference(resolution,[status(thm)],[f14,f26]) ).

fof(f33,plain,
    reproducibility(sk2,sk1(sk5,sk2),sk5),
    inference(resolution,[status(thm)],[f14,f25]) ).

fof(f34,plain,
    reorganization_free(sk2,sk5,sk5),
    inference(resolution,[status(thm)],[f16,f27]) ).

fof(f37,plain,
    reorganization_free(sk2,sk6,sk6),
    inference(resolution,[status(thm)],[f18,f27]) ).

fof(f38,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( greater(X5,X4)
      | ~ greater(X3,X2)
      | ~ inertia(X0,X5,X1)
      | ~ inertia(sk2,X4,sk5)
      | ~ reproducibility(X0,X3,X1)
      | ~ reproducibility(sk2,X2,sk5)
      | ~ reorganization_free(X0,X1,X1)
      | ~ organization(X0,X1)
      | ~ organization(sk2,sk5) ),
    inference(resolution,[status(thm)],[f20,f34]) ).

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

fof(f41,plain,
    ( sQ0_spl
    | ~ organization(sk2,sk5) ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,definition,
    ! [X0,X1,X2,X3,X4,X5] :
      ( sQ1_spl
    <=> ( greater(X5,X4)
        | ~ greater(X3,X2)
        | ~ inertia(X0,X5,X1)
        | ~ inertia(sk2,X4,sk5)
        | ~ reproducibility(X0,X3,X1)
        | ~ reproducibility(sk2,X2,sk5)
        | ~ reorganization_free(X0,X1,X1)
        | ~ organization(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f43,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( ~ sQ1_spl
      | greater(X5,X4)
      | ~ greater(X3,X2)
      | ~ inertia(X0,X5,X1)
      | ~ inertia(sk2,X4,sk5)
      | ~ reproducibility(X0,X3,X1)
      | ~ reproducibility(sk2,X2,sk5)
      | ~ reorganization_free(X0,X1,X1)
      | ~ organization(X0,X1) ),
    inference(component_clause,[status(thm)],[f42]) ).

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

fof(f46,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f41,f25]) ).

fof(f47,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f46]) ).

fof(f51,definition,
    ( sQ2_spl
  <=> organization(sk2,sk6) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f53,plain,
    ( sQ2_spl
    | ~ organization(sk2,sk6) ),
    inference(component_clause,[status(thm)],[f51]) ).

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

fof(f59,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f58]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( greater(X1,X0)
      | ~ greater(sk6,sk5)
      | ~ reproducibility(sk2,X1,sk6)
      | ~ reproducibility(sk2,X0,sk5)
      | ~ organization(sk2,sk6)
      | ~ organization(sk2,sk5) ),
    inference(resolution,[status(thm)],[f24,f27]) ).

fof(f87,definition,
    ! [X0,X1] :
      ( sQ10_spl
    <=> ( greater(X1,X0)
        | ~ reproducibility(sk2,X1,sk6)
        | ~ reproducibility(sk2,X0,sk5) ) ),
    introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( ~ sQ10_spl
      | greater(X1,X0)
      | ~ reproducibility(sk2,X1,sk6)
      | ~ reproducibility(sk2,X0,sk5) ),
    inference(component_clause,[status(thm)],[f87]) ).

fof(f90,definition,
    ( sQ11_spl
  <=> greater(sk6,sk5) ),
    introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).

fof(f92,plain,
    ( sQ11_spl
    | ~ greater(sk6,sk5) ),
    inference(component_clause,[status(thm)],[f90]) ).

fof(f93,plain,
    ( ~ sQ11_spl
    | sQ10_spl
    | ~ sQ2_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f72,f39,f51,f87,f90]) ).

fof(f98,plain,
    ! [X0,X1,X2,X3] :
      ( ~ sQ1_spl
      | greater(X3,X2)
      | ~ greater(X1,X0)
      | ~ inertia(sk2,X3,sk6)
      | ~ inertia(sk2,X2,sk5)
      | ~ reproducibility(sk2,X1,sk6)
      | ~ reproducibility(sk2,X0,sk5)
      | ~ organization(sk2,sk6) ),
    inference(resolution,[status(thm)],[f43,f37]) ).

fof(f100,definition,
    ! [X0,X1] :
      ( sQ12_spl
    <=> ( ~ greater(X1,X0)
        | ~ reproducibility(sk2,X1,sk6)
        | ~ reproducibility(sk2,X0,sk5) ) ),
    introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( ~ sQ12_spl
      | ~ greater(X1,X0)
      | ~ reproducibility(sk2,X1,sk6)
      | ~ reproducibility(sk2,X0,sk5) ),
    inference(component_clause,[status(thm)],[f100]) ).

fof(f103,definition,
    ! [X2,X3] :
      ( sQ13_spl
    <=> ( greater(X3,X2)
        | ~ inertia(sk2,X3,sk6)
        | ~ inertia(sk2,X2,sk5) ) ),
    introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ~ sQ13_spl
      | greater(X1,X0)
      | ~ inertia(sk2,X1,sk6)
      | ~ inertia(sk2,X0,sk5) ),
    inference(component_clause,[status(thm)],[f103]) ).

fof(f106,plain,
    ( ~ sQ1_spl
    | sQ13_spl
    | sQ12_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f98,f51,f100,f103,f42]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( ~ sQ12_spl
      | ~ sQ10_spl
      | ~ reproducibility(sk2,X1,sk6)
      | ~ reproducibility(sk2,X0,sk5) ),
    inference(forward_subsumption_resolution,[status(thm)],[f101,f88]) ).

fof(f116,plain,
    ! [X0] :
      ( ~ sQ12_spl
      | ~ sQ10_spl
      | ~ reproducibility(sk2,X0,sk6) ),
    inference(resolution,[status(thm)],[f114,f33]) ).

fof(f117,plain,
    ( ~ sQ12_spl
    | ~ sQ10_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f32,f116]) ).

fof(f118,plain,
    ( ~ sQ12_spl
    | ~ sQ10_spl ),
    inference(contradiction_clause,[status(thm)],[f117]) ).

fof(f119,plain,
    ( sQ11_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f92,f30]) ).

fof(f120,plain,
    sQ11_spl,
    inference(contradiction_clause,[status(thm)],[f119]) ).

fof(f169,plain,
    ! [X0] :
      ( ~ sQ13_spl
      | greater(X0,sk3)
      | ~ inertia(sk2,X0,sk6) ),
    inference(resolution,[status(thm)],[f104,f28]) ).

fof(f170,plain,
    ( ~ sQ13_spl
    | greater(sk4,sk3) ),
    inference(resolution,[status(thm)],[f169,f29]) ).

fof(f171,plain,
    ( ~ sQ13_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f170,f31]) ).

fof(f172,plain,
    ~ sQ13_spl,
    inference(contradiction_clause,[status(thm)],[f171]) ).

fof(f173,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f45,f47,f59,f93,f106,f118,f120,f172]) ).

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