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

% Computer : n004.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:45:54 EDT 2024

% Result   : Theorem 0.10s 0.36s
% Output   : CNFRefutation 0.10s
% 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,pv21)
      & leq(n0,pv23)
      & leq(pv21,minus(n5,n1))
      & leq(pv23,minus(n135300,n1)) )
   => ( leq(n0,pv21)
      & leq(n0,pv23)
      & leq(pv21,minus(n5,n1))
      & leq(pv23,minus(n135300,n1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f340,plain,
    ( ~ leq(pv23,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(f349,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f340,f255]) ).

fof(f350,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f349]) ).

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

fof(f352,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f351]) ).

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

fof(f354,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f353]) ).

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

fof(f356,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f355]) ).

fof(f357,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f341,f350,f352,f354,f356]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWV071+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.34  % Computer : n004.cluster.edu
% 0.10/0.34  % Model    : x86_64 x86_64
% 0.10/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34  % Memory   : 8042.1875MB
% 0.10/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34  % CPULimit : 300
% 0.10/0.34  % WCLimit  : 300
% 0.10/0.34  % DateTime : Tue Apr 30 00:31:48 EDT 2024
% 0.10/0.34  % CPUTime  : 
% 0.10/0.35  % Drodi V3.6.0
% 0.10/0.36  % Refutation found
% 0.10/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.37  % Elapsed time: 0.026665 seconds
% 0.10/0.37  % CPU time: 0.021758 seconds
% 0.10/0.37  % Total memory used: 8.121 MB
% 0.10/0.37  % Net memory used: 8.112 MB
%------------------------------------------------------------------------------