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

% Computer : n029.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:51 EDT 2024

% Result   : Theorem 0.22s 0.42s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   54 (  22 unt;   0 def)
%            Number of atoms       :  128 (  45 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  118 (  44   ~;  38   |;  23   &)
%                                         (   6 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   9 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  11 con; 0-3 aty)
%            Number of variables   :    6 (   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [Body] : sum(n0,tptp_minus_1,Body) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f28,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f39,axiom,
    ! [X] : minus(X,n1) = pred(X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f40,axiom,
    ! [X] : pred(succ(X)) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f51,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
      & leq(n0,pv35)
      & leq(pv35,minus(n5,n1)) )
   => ( ( n0 != pv78
       => ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          & leq(n0,pv35)
          & leq(pv35,minus(n5,n1)) ) )
      & ( n0 = pv78
       => true ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
        & leq(n0,pv35)
        & leq(pv35,minus(n5,n1)) )
     => ( ( n0 != pv78
         => ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
            & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
            & leq(n0,pv35)
            & leq(pv35,minus(n5,n1)) ) )
        & ( n0 = pv78
         => true ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f204,plain,
    ! [X0] : sum(n0,tptp_minus_1,X0) = n0,
    inference(cnf_transformation,[status(esa)],[f26]) ).

fof(f206,plain,
    succ(tptp_minus_1) = n0,
    inference(cnf_transformation,[status(esa)],[f28]) ).

fof(f217,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[status(esa)],[f39]) ).

fof(f218,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[status(esa)],[f40]) ).

fof(f249,plain,
    true,
    inference(cnf_transformation,[status(esa)],[f51]) ).

fof(f251,plain,
    ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & leq(n0,pv35)
    & leq(pv35,minus(n5,n1))
    & ( ( n0 != pv78
        & ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | ~ leq(n0,pv35)
          | ~ leq(pv35,minus(n5,n1)) ) )
      | ( n0 = pv78
        & ~ true ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f252,plain,
    ( pd0_3
   => ( n0 != pv78
      & ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
        | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
        | ~ leq(n0,pv35)
        | ~ leq(pv35,minus(n5,n1)) ) ) ),
    introduced(predicate_definition,[f251]) ).

fof(f253,plain,
    ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & leq(n0,pv35)
    & leq(pv35,minus(n5,n1))
    & ( pd0_3
      | ( n0 = pv78
        & ~ true ) ) ),
    inference(formula_renaming,[status(thm)],[f251,f252]) ).

fof(f254,plain,
    pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
    inference(cnf_transformation,[status(esa)],[f253]) ).

fof(f255,plain,
    leq(n0,pv35),
    inference(cnf_transformation,[status(esa)],[f253]) ).

fof(f256,plain,
    leq(pv35,minus(n5,n1)),
    inference(cnf_transformation,[status(esa)],[f253]) ).

fof(f258,plain,
    ( pd0_3
    | ~ true ),
    inference(cnf_transformation,[status(esa)],[f253]) ).

fof(f325,plain,
    ( ~ pd0_3
    | ( n0 != pv78
      & ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
        | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
        | ~ leq(n0,pv35)
        | ~ leq(pv35,minus(n5,n1)) ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f252]) ).

fof(f327,plain,
    ( ~ pd0_3
    | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | ~ leq(n0,pv35)
    | ~ leq(pv35,minus(n5,n1)) ),
    inference(cnf_transformation,[status(esa)],[f325]) ).

fof(f334,plain,
    ( spl0_0
  <=> pd0_3 ),
    introduced(split_symbol_definition) ).

fof(f341,plain,
    ( spl0_2
  <=> true ),
    introduced(split_symbol_definition) ).

fof(f343,plain,
    ( ~ true
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f341]) ).

fof(f344,plain,
    ( spl0_0
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f258,f334,f341]) ).

fof(f346,plain,
    ( spl0_3
  <=> n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
    introduced(split_symbol_definition) ).

fof(f348,plain,
    ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f346]) ).

fof(f349,plain,
    ( spl0_4
  <=> pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
    introduced(split_symbol_definition) ).

fof(f351,plain,
    ( pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f349]) ).

fof(f352,plain,
    ( spl0_5
  <=> leq(n0,pv35) ),
    introduced(split_symbol_definition) ).

fof(f354,plain,
    ( ~ leq(n0,pv35)
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f352]) ).

fof(f355,plain,
    ( spl0_6
  <=> leq(pv35,minus(n5,n1)) ),
    introduced(split_symbol_definition) ).

fof(f357,plain,
    ( ~ leq(pv35,minus(n5,n1))
    | spl0_6 ),
    inference(component_clause,[status(thm)],[f355]) ).

fof(f358,plain,
    ( ~ spl0_0
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(split_clause,[status(thm)],[f327,f334,f346,f349,f352,f355]) ).

fof(f377,plain,
    pv78 = sum(n0,pred(n135300),a_select3(q,pv79,pv35)),
    inference(forward_demodulation,[status(thm)],[f217,f254]) ).

fof(f378,plain,
    leq(pv35,pred(n5)),
    inference(forward_demodulation,[status(thm)],[f217,f256]) ).

fof(f389,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f343,f249]) ).

fof(f390,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f389]) ).

fof(f391,plain,
    ( ~ leq(pv35,pred(n5))
    | spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f217,f357]) ).

fof(f392,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[status(thm)],[f391,f378]) ).

fof(f393,plain,
    spl0_6,
    inference(contradiction_clause,[status(thm)],[f392]) ).

fof(f394,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[status(thm)],[f354,f255]) ).

fof(f395,plain,
    spl0_5,
    inference(contradiction_clause,[status(thm)],[f394]) ).

fof(f397,plain,
    ( n0 != sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f217,f348]) ).

fof(f401,plain,
    pred(n0) = tptp_minus_1,
    inference(paramodulation,[status(thm)],[f206,f218]) ).

fof(f402,plain,
    ( n0 != sum(n0,tptp_minus_1,times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | spl0_3 ),
    inference(backward_demodulation,[status(thm)],[f401,f397]) ).

fof(f403,plain,
    ( n0 != n0
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f204,f402]) ).

fof(f404,plain,
    ( $false
    | spl0_3 ),
    inference(trivial_equality_resolution,[status(esa)],[f403]) ).

fof(f405,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f404]) ).

fof(f406,plain,
    ( pv78 != sum(n0,pred(n135300),a_select3(q,pv79,pv35))
    | spl0_4 ),
    inference(forward_demodulation,[status(thm)],[f217,f351]) ).

fof(f407,plain,
    ( pv78 != pv78
    | spl0_4 ),
    inference(forward_demodulation,[status(thm)],[f377,f406]) ).

fof(f408,plain,
    ( $false
    | spl0_4 ),
    inference(trivial_equality_resolution,[status(esa)],[f407]) ).

fof(f409,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f408]) ).

fof(f410,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f344,f358,f390,f393,f395,f405,f409]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV048+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.15/0.36  % Computer : n029.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Tue Apr 30 01:14:50 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 0.15/0.37  % Drodi V3.6.0
% 0.22/0.42  % Refutation found
% 0.22/0.42  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.22/0.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/0.44  % Elapsed time: 0.077091 seconds
% 0.22/0.44  % CPU time: 0.448018 seconds
% 0.22/0.44  % Total memory used: 67.889 MB
% 0.22/0.44  % Net memory used: 67.660 MB
%------------------------------------------------------------------------------