%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWV075+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n015.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 : Wed May 31 12:40:36 EDT 2023

% Result   : Theorem 0.17s 0.56s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   9 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   56 (  17   ~;  17   |;  16   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (;   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( leq(n0,pv31)
      & leq(n0,pv37)
      & leq(pv31,minus(n5,n1))
      & leq(pv37,minus(n135300,n1)) )
   => ( leq(n0,pv31)
      & leq(n0,pv37)
      & leq(pv31,minus(n5,n1))
      & leq(pv37,minus(n135300,n1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( leq(n0,pv31)
        & leq(n0,pv37)
        & leq(pv31,minus(n5,n1))
        & leq(pv37,minus(n135300,n1)) )
     => ( leq(n0,pv31)
        & leq(n0,pv37)
        & leq(pv31,minus(n5,n1))
        & leq(pv37,minus(n135300,n1)) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f251,plain,
    ( leq(n0,pv31)
    & leq(n0,pv37)
    & leq(pv31,minus(n5,n1))
    & leq(pv37,minus(n135300,n1))
    & ( ~ leq(n0,pv31)
      | ~ leq(n0,pv37)
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(pv37,minus(n135300,n1)) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f252,plain,
    leq(n0,pv31),
    inference(cnf_transformation,[status(esa)],[f251]) ).

fof(f253,plain,
    leq(n0,pv37),
    inference(cnf_transformation,[status(esa)],[f251]) ).

fof(f254,plain,
    leq(pv31,minus(n5,n1)),
    inference(cnf_transformation,[status(esa)],[f251]) ).

fof(f255,plain,
    leq(pv37,minus(n135300,n1)),
    inference(cnf_transformation,[status(esa)],[f251]) ).

fof(f256,plain,
    ( ~ leq(n0,pv31)
    | ~ leq(n0,pv37)
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(pv37,minus(n135300,n1)) ),
    inference(cnf_transformation,[status(esa)],[f251]) ).

fof(f329,plain,
    ( spl0_0
  <=> leq(n0,pv31) ),
    introduced(split_symbol_definition) ).

fof(f331,plain,
    ( ~ leq(n0,pv31)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f329]) ).

fof(f332,plain,
    ( spl0_1
  <=> leq(n0,pv37) ),
    introduced(split_symbol_definition) ).

fof(f334,plain,
    ( ~ leq(n0,pv37)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f332]) ).

fof(f335,plain,
    ( spl0_2
  <=> leq(pv31,minus(n5,n1)) ),
    introduced(split_symbol_definition) ).

fof(f337,plain,
    ( ~ leq(pv31,minus(n5,n1))
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f335]) ).

fof(f338,plain,
    ( spl0_3
  <=> leq(pv37,minus(n135300,n1)) ),
    introduced(split_symbol_definition) ).

fof(f340,plain,
    ( ~ leq(pv37,minus(n135300,n1))
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f338]) ).

fof(f341,plain,
    ( ~ spl0_0
    | ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f256,f329,f332,f335,f338]) ).

fof(f372,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f340,f255]) ).

fof(f373,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f372]) ).

fof(f374,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f337,f254]) ).

fof(f375,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f374]) ).

fof(f376,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f331,f252]) ).

fof(f377,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f376]) ).

fof(f378,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f334,f253]) ).

fof(f379,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f378]) ).

fof(f380,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f341,f373,f375,f377,f379]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWV075+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32  % Computer : n015.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Tue May 30 12:00:19 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 0.11/0.33  % Drodi V3.5.1
% 0.17/0.56  % Refutation found
% 0.17/0.56  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.56  % Elapsed time: 0.018565 seconds
% 0.17/0.56  % CPU time: 0.018084 seconds
% 0.17/0.56  % Memory used: 4.007 MB
%------------------------------------------------------------------------------