TSTP Solution File: NUM843+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : NUM843+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n002.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:35:54 EDT 2024

% Result   : Theorem 0.21s 0.45s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  10 unt;   0 def)
%            Number of atoms       :   85 (  17 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   80 (  32   ~;  34   |;   8   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   41 (  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    greater(vd390,vd391),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ greater(vd390,vd391),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,axiom,
    ~ leq(vd390,vd391),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f21,axiom,
    ! [Vd254,Vd255] :
      ( geq(Vd254,Vd255)
     => leq(Vd255,Vd254) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f22,axiom,
    ! [Vd249,Vd250] :
      ( leq(Vd250,Vd249)
    <=> ( less(Vd250,Vd249)
        | Vd250 = Vd249 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f23,axiom,
    ! [Vd244,Vd245] :
      ( geq(Vd245,Vd244)
    <=> ( greater(Vd245,Vd244)
        | Vd245 = Vd244 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f24,axiom,
    ! [Vd226,Vd227] :
      ( less(Vd226,Vd227)
     => greater(Vd227,Vd226) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f26,axiom,
    ! [Vd203,Vd204] :
      ( Vd203 = Vd204
      | greater(Vd203,Vd204)
      | less(Vd203,Vd204) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f48,plain,
    ~ greater(vd390,vd391),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f49,plain,
    ~ leq(vd390,vd391),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f92,plain,
    ! [Vd254,Vd255] :
      ( ~ geq(Vd254,Vd255)
      | leq(Vd255,Vd254) ),
    inference(pre_NNF_transformation,[status(esa)],[f21]) ).

fof(f93,plain,
    ! [X0,X1] :
      ( ~ geq(X0,X1)
      | leq(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f92]) ).

fof(f94,plain,
    ! [Vd249,Vd250] :
      ( ( ~ leq(Vd250,Vd249)
        | less(Vd250,Vd249)
        | Vd250 = Vd249 )
      & ( leq(Vd250,Vd249)
        | ( ~ less(Vd250,Vd249)
          & Vd250 != Vd249 ) ) ),
    inference(NNF_transformation,[status(esa)],[f22]) ).

fof(f95,plain,
    ( ! [Vd249,Vd250] :
        ( ~ leq(Vd250,Vd249)
        | less(Vd250,Vd249)
        | Vd250 = Vd249 )
    & ! [Vd249,Vd250] :
        ( leq(Vd250,Vd249)
        | ( ~ less(Vd250,Vd249)
          & Vd250 != Vd249 ) ) ),
    inference(miniscoping,[status(esa)],[f94]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[status(esa)],[f95]) ).

fof(f99,plain,
    ! [Vd244,Vd245] :
      ( ( ~ geq(Vd245,Vd244)
        | greater(Vd245,Vd244)
        | Vd245 = Vd244 )
      & ( geq(Vd245,Vd244)
        | ( ~ greater(Vd245,Vd244)
          & Vd245 != Vd244 ) ) ),
    inference(NNF_transformation,[status(esa)],[f23]) ).

fof(f100,plain,
    ( ! [Vd244,Vd245] :
        ( ~ geq(Vd245,Vd244)
        | greater(Vd245,Vd244)
        | Vd245 = Vd244 )
    & ! [Vd244,Vd245] :
        ( geq(Vd245,Vd244)
        | ( ~ greater(Vd245,Vd244)
          & Vd245 != Vd244 ) ) ),
    inference(miniscoping,[status(esa)],[f99]) ).

fof(f102,plain,
    ! [X0,X1] :
      ( geq(X0,X1)
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f100]) ).

fof(f104,plain,
    ! [Vd226,Vd227] :
      ( ~ less(Vd226,Vd227)
      | greater(Vd227,Vd226) ),
    inference(pre_NNF_transformation,[status(esa)],[f24]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | greater(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f104]) ).

fof(f108,plain,
    ! [X0,X1] :
      ( X0 = X1
      | greater(X0,X1)
      | less(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f26]) ).

fof(f148,plain,
    ! [X0] : leq(X0,X0),
    inference(destructive_equality_resolution,[status(esa)],[f98]) ).

fof(f190,plain,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | leq(X1,X0) ),
    inference(resolution,[status(thm)],[f102,f93]) ).

fof(f198,plain,
    ~ greater(vd391,vd390),
    inference(resolution,[status(thm)],[f190,f49]) ).

fof(f205,plain,
    ! [X0,X1] :
      ( X0 = X1
      | greater(X0,X1)
      | greater(X1,X0) ),
    inference(resolution,[status(thm)],[f108,f105]) ).

fof(f265,plain,
    ( spl0_8
  <=> vd390 = vd391 ),
    introduced(split_symbol_definition) ).

fof(f266,plain,
    ( vd390 = vd391
    | ~ spl0_8 ),
    inference(component_clause,[status(thm)],[f265]) ).

fof(f278,plain,
    ( spl0_10
  <=> greater(vd391,vd390) ),
    introduced(split_symbol_definition) ).

fof(f279,plain,
    ( greater(vd391,vd390)
    | ~ spl0_10 ),
    inference(component_clause,[status(thm)],[f278]) ).

fof(f281,plain,
    ( vd391 = vd390
    | greater(vd391,vd390) ),
    inference(resolution,[status(thm)],[f205,f48]) ).

fof(f282,plain,
    ( spl0_8
    | spl0_10 ),
    inference(split_clause,[status(thm)],[f281,f265,f278]) ).

fof(f289,plain,
    ( ~ leq(vd390,vd390)
    | ~ spl0_8 ),
    inference(backward_demodulation,[status(thm)],[f266,f49]) ).

fof(f290,plain,
    ( $false
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[status(thm)],[f289,f148]) ).

fof(f291,plain,
    ~ spl0_8,
    inference(contradiction_clause,[status(thm)],[f290]) ).

fof(f292,plain,
    ( $false
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f198,f279]) ).

fof(f293,plain,
    ~ spl0_10,
    inference(contradiction_clause,[status(thm)],[f292]) ).

fof(f294,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f282,f291,f293]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM843+1 : TPTP v8.1.2. Released v4.1.0.
% 0.04/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 21:12:39 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  % Drodi V3.6.0
% 0.21/0.45  % Refutation found
% 0.21/0.45  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.45  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.47  % Elapsed time: 0.116608 seconds
% 0.21/0.47  % CPU time: 0.750135 seconds
% 0.21/0.47  % Total memory used: 65.538 MB
% 0.21/0.47  % Net memory used: 65.282 MB
%------------------------------------------------------------------------------