↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n019.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:33 PM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   63 (  16 unt;   7 def)
%            Number of atoms       :  174 (  36 equ)
%            Maximal formula atoms :   21 (   2 avg)
%            Number of connectives :  199 (  88   ~;  59   |;  42   &)
%                                         (   9 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   8 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   63 (  57   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> ( X = Y
        | less(X,Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X,Y] :
      ( ( leq(Y,X)
        & leq(X,Y) )
     => X = Y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,axiom,
    ! [X,A,B] :
      ( in_lopen(X,A,B)
    <=> ( leq(X,B)
        & less(A,X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f36,axiom,
    less(v0,v32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f37,axiom,
    less(v0,v400),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f38,axiom,
    less(v0,v600),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f41,axiom,
    less(v16,v32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f56,axiom,
    ( v800 != v1200
    & v600 != v1200
    & v600 != v800
    & v400 != v1200
    & v400 != v800
    & v400 != v600
    & v32 != v1200
    & v32 != v800
    & v32 != v600
    & v32 != v400
    & v16 != v1200
    & v16 != v800
    & v16 != v600
    & v16 != v400
    & v16 != v32
    & v0 != v1200
    & v0 != v800
    & v0 != v600
    & v0 != v400
    & v0 != v32
    & v0 != v16 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f57,conjecture,
    ? [X,Y,Z] :
      ( ~ ( in_lopen(Z,v0,v16)
          & in_lopen(Y,v0,v800)
          & in_lopen(X,v0,v1200) )
      & in_lopen(Z,v0,v32)
      & in_lopen(Y,v0,v400)
      & in_lopen(X,v0,v600) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f58,negated_conjecture,
    ~ ? [X,Y,Z] :
        ( ~ ( in_lopen(Z,v0,v16)
            & in_lopen(Y,v0,v800)
            & in_lopen(X,v0,v1200) )
        & in_lopen(Z,v0,v32)
        & in_lopen(Y,v0,v400)
        & in_lopen(X,v0,v600) ),
    inference(negated_conjecture,[status(cth)],[f57]) ).

fof(f64,plain,
    ! [X,Y] :
      ( ( ( X != Y
          & ~ less(X,Y) )
        | leq(X,Y) )
      & ( X = Y
        | less(X,Y)
        | ~ leq(X,Y) ) ),
    inference(NNF_transformation,[status(thm)],[f4]) ).

fof(f65,plain,
    ( ! [X,Y] :
        ( ( X != Y
          & ~ less(X,Y) )
        | leq(X,Y) )
    & ! [X,Y] :
        ( X = Y
        | less(X,Y)
        | ~ leq(X,Y) ) ),
    inference(miniscoping,[status(thm)],[f64]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | leq(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f65]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( X0 != X1
      | leq(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f65]) ).

fof(f69,plain,
    ! [X,Y] :
      ( X = Y
      | ~ leq(Y,X)
      | ~ leq(X,Y) ),
    inference(pre_NNF_transformation,[status(thm)],[f5]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ leq(X1,X0)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f69]) ).

fof(f87,plain,
    ! [X,A,B] :
      ( ( ~ leq(X,B)
        | ~ less(A,X)
        | in_lopen(X,A,B) )
      & ( ( leq(X,B)
          & less(A,X) )
        | ~ in_lopen(X,A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f11]) ).

fof(f88,plain,
    ( ! [X,A,B] :
        ( ~ leq(X,B)
        | ~ less(A,X)
        | in_lopen(X,A,B) )
    & ! [X,A,B] :
        ( ( leq(X,B)
          & less(A,X) )
        | ~ in_lopen(X,A,B) ) ),
    inference(miniscoping,[status(thm)],[f87]) ).

fof(f90,plain,
    ! [X0,X1,X2] :
      ( leq(X0,X2)
      | ~ in_lopen(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f88]) ).

fof(f91,plain,
    ! [X0,X1,X2] :
      ( ~ leq(X0,X2)
      | ~ less(X1,X0)
      | in_lopen(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f88]) ).

fof(f148,plain,
    less(v0,v32),
    inference(cnf_transformation,[status(thm)],[f36]) ).

fof(f149,plain,
    less(v0,v400),
    inference(cnf_transformation,[status(thm)],[f37]) ).

fof(f150,plain,
    less(v0,v600),
    inference(cnf_transformation,[status(thm)],[f38]) ).

fof(f153,plain,
    less(v16,v32),
    inference(cnf_transformation,[status(thm)],[f41]) ).

fof(f174,plain,
    v16 != v32,
    inference(cnf_transformation,[status(thm)],[f56]) ).

fof(f189,plain,
    ! [X,Y,Z] :
      ( ( in_lopen(Z,v0,v16)
        & in_lopen(Y,v0,v800)
        & in_lopen(X,v0,v1200) )
      | ~ in_lopen(Z,v0,v32)
      | ~ in_lopen(Y,v0,v400)
      | ~ in_lopen(X,v0,v600) ),
    inference(pre_NNF_transformation,[status(thm)],[f58]) ).

fof(f192,plain,
    ! [X0,X1,X2] :
      ( in_lopen(X2,v0,v16)
      | ~ in_lopen(X2,v0,v32)
      | ~ in_lopen(X1,v0,v400)
      | ~ in_lopen(X0,v0,v600) ),
    inference(cnf_transformation,[status(thm)],[f189]) ).

fof(f196,definition,
    ! [X1] :
      ( sQ1_spl
    <=> ~ in_lopen(X1,v0,v400) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f197,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | ~ in_lopen(X0,v0,v400) ),
    inference(component_clause,[status(thm)],[f196]) ).

fof(f203,definition,
    ! [X0] :
      ( sQ3_spl
    <=> ~ in_lopen(X0,v0,v600) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f204,plain,
    ! [X0] :
      ( ~ sQ3_spl
      | ~ in_lopen(X0,v0,v600) ),
    inference(component_clause,[status(thm)],[f203]) ).

fof(f210,definition,
    ! [X2] :
      ( sQ5_spl
    <=> ( in_lopen(X2,v0,v16)
        | ~ in_lopen(X2,v0,v32) ) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f211,plain,
    ! [X0] :
      ( ~ sQ5_spl
      | in_lopen(X0,v0,v16)
      | ~ in_lopen(X0,v0,v32) ),
    inference(component_clause,[status(thm)],[f210]) ).

fof(f213,plain,
    ( sQ5_spl
    | sQ1_spl
    | sQ3_spl ),
    inference(split_clause,[status(thm)],[f192,f203,f196,f210]) ).

fof(f214,plain,
    ! [X0] : leq(X0,X0),
    inference(destructive_equality_resolution,[status(thm)],[f68]) ).

fof(f228,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | in_lopen(X0,X1,X0) ),
    inference(resolution,[status(thm)],[f214,f91]) ).

fof(f233,plain,
    ! [X0,X1,X2] :
      ( ~ in_lopen(X1,X2,X0)
      | X0 = X1
      | ~ leq(X0,X1) ),
    inference(resolution,[status(thm)],[f70,f90]) ).

fof(f259,plain,
    ( ~ sQ3_spl
    | ~ less(v0,v600) ),
    inference(resolution,[status(thm)],[f228,f204]) ).

fof(f260,plain,
    ( ~ sQ1_spl
    | ~ less(v0,v400) ),
    inference(resolution,[status(thm)],[f228,f197]) ).

fof(f263,plain,
    ( ~ sQ3_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f259,f150]) ).

fof(f264,plain,
    ~ sQ3_spl,
    inference(contradiction_clause,[status(thm)],[f263]) ).

fof(f265,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f260,f149]) ).

fof(f266,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f265]) ).

fof(f286,plain,
    ( ~ sQ5_spl
    | ~ less(v0,v32)
    | in_lopen(v32,v0,v16) ),
    inference(resolution,[status(thm)],[f211,f228]) ).

fof(f287,definition,
    ( sQ14_spl
  <=> in_lopen(v32,v0,v16) ),
    introduced(definition,[new_symbols(definition,[sQ14_spl])],[split_symbol_definition]) ).

fof(f288,plain,
    ( ~ sQ14_spl
    | in_lopen(v32,v0,v16) ),
    inference(component_clause,[status(thm)],[f287]) ).

fof(f290,definition,
    ( sQ15_spl
  <=> less(v0,v32) ),
    introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).

fof(f292,plain,
    ( sQ15_spl
    | ~ less(v0,v32) ),
    inference(component_clause,[status(thm)],[f290]) ).

fof(f293,plain,
    ( ~ sQ5_spl
    | ~ sQ15_spl
    | sQ14_spl ),
    inference(split_clause,[status(thm)],[f286,f287,f290,f210]) ).

fof(f339,plain,
    ( sQ15_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f292,f148]) ).

fof(f340,plain,
    sQ15_spl,
    inference(contradiction_clause,[status(thm)],[f339]) ).

fof(f355,plain,
    ! [X0,X1,X2] :
      ( ~ less(X0,X1)
      | ~ in_lopen(X1,X2,X0)
      | X0 = X1 ),
    inference(resolution,[status(thm)],[f233,f67]) ).

fof(f358,plain,
    ( ~ sQ14_spl
    | ~ less(v16,v32)
    | v16 = v32 ),
    inference(resolution,[status(thm)],[f355,f288]) ).

fof(f365,definition,
    ( sQ22_spl
  <=> v16 = v32 ),
    introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition]) ).

fof(f366,plain,
    ( ~ sQ22_spl
    | v16 = v32 ),
    inference(component_clause,[status(thm)],[f365]) ).

fof(f368,definition,
    ( sQ23_spl
  <=> less(v16,v32) ),
    introduced(definition,[new_symbols(definition,[sQ23_spl])],[split_symbol_definition]) ).

fof(f370,plain,
    ( sQ23_spl
    | ~ less(v16,v32) ),
    inference(component_clause,[status(thm)],[f368]) ).

fof(f371,plain,
    ( ~ sQ14_spl
    | ~ sQ23_spl
    | sQ22_spl ),
    inference(split_clause,[status(thm)],[f358,f365,f368,f287]) ).

fof(f391,plain,
    ( ~ sQ22_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f366,f174]) ).

fof(f392,plain,
    ~ sQ22_spl,
    inference(contradiction_clause,[status(thm)],[f391]) ).

fof(f395,plain,
    ( sQ23_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f370,f153]) ).

fof(f396,plain,
    sQ23_spl,
    inference(contradiction_clause,[status(thm)],[f395]) ).

fof(f397,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f213,f264,f266,f293,f340,f371,f392,f396]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n019.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 01:24:50 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.43  % Elapsed time: 0.055956 seconds
% 0.09/0.43  % CPU time: 0.163359 seconds
% 0.09/0.43  % Total memory used: 60.196 MB
% 0.09/0.43  % Net memory used: 60.085 MB
%------------------------------------------------------------------------------