TSTP Solution File: SWV026+1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n020.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:29 EDT 2023

% Result   : Theorem 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   29
% Syntax   : Number of formulae    :  160 (  40 unt;   0 def)
%            Number of atoms       :  720 ( 152 equ)
%            Maximal formula atoms :   70 (   4 avg)
%            Number of connectives :  838 ( 278   ~; 282   |; 224   &)
%                                         (  24 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   48 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   32 (  30 usr;  25 prp; 0-2 aty)
%            Number of functors    :   33 (  33 usr;  29 con; 0-3 aty)
%            Number of variables   :   89 (;  78   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ( init = init
      & s_best7_init = init
      & s_sworst7_init = init
      & s_worst7_init = init
      & leq(n0,s_best7)
      & leq(n0,s_sworst7)
      & leq(n0,s_worst7)
      & leq(n0,pv9)
      & leq(n0,pv19)
      & leq(n0,pv20)
      & leq(n0,pv1376)
      & leq(s_best7,n3)
      & leq(s_sworst7,n3)
      & leq(s_worst7,n3)
      & leq(pv9,minus(n410,n1))
      & leq(pv19,minus(n410,n1))
      & leq(pv20,minus(n330,n1))
      & leq(pv1376,n3)
      & ! [A] :
          ( ( leq(n0,A)
            & leq(A,n2) )
         => ! [B] :
              ( ( leq(n0,B)
                & leq(B,n3) )
             => a_select3(simplex7_init,B,A) = init ) )
      & ! [C] :
          ( ( leq(n0,C)
            & leq(C,n3) )
         => a_select2(s_values7_init,C) = init )
      & ! [D] :
          ( ( leq(n0,D)
            & leq(D,n2) )
         => a_select2(s_center7_init,D) = init )
      & ! [E] :
          ( ( leq(n0,E)
            & leq(E,minus(n3,n1)) )
         => a_select2(s_try7_init,E) = init )
      & ( gt(loopcounter,n1)
       => ( pvar1400_init = init
          & pvar1401_init = init
          & pvar1402_init = init ) ) )
   => ( init = init
      & s_best7_init = init
      & s_sworst7_init = init
      & s_worst7_init = init
      & leq(n0,s_best7)
      & leq(n0,s_sworst7)
      & leq(n0,s_worst7)
      & leq(n0,pv19)
      & leq(n0,pv20)
      & leq(n0,pv1376)
      & leq(s_best7,n3)
      & leq(s_sworst7,n3)
      & leq(s_worst7,n3)
      & leq(pv19,minus(n410,n1))
      & leq(pv20,minus(n330,n1))
      & leq(pv1376,n3)
      & ! [F] :
          ( ( leq(n0,F)
            & leq(F,n2) )
         => ! [G] :
              ( ( leq(n0,G)
                & leq(G,n3) )
             => a_select3(simplex7_init,G,F) = init ) )
      & ! [H] :
          ( ( leq(n0,H)
            & leq(H,n3) )
         => a_select2(s_values7_init,H) = init )
      & ! [I] :
          ( ( leq(n0,I)
            & leq(I,n2) )
         => a_select2(s_center7_init,I) = init )
      & ! [J] :
          ( ( leq(n0,J)
            & leq(J,minus(n3,n1)) )
         => a_select2(s_try7_init,J) = init )
      & ( gt(loopcounter,n1)
       => ( pvar1400_init = init
          & pvar1401_init = init
          & pvar1402_init = init ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ( ( init = init
        & s_best7_init = init
        & s_sworst7_init = init
        & s_worst7_init = init
        & leq(n0,s_best7)
        & leq(n0,s_sworst7)
        & leq(n0,s_worst7)
        & leq(n0,pv9)
        & leq(n0,pv19)
        & leq(n0,pv20)
        & leq(n0,pv1376)
        & leq(s_best7,n3)
        & leq(s_sworst7,n3)
        & leq(s_worst7,n3)
        & leq(pv9,minus(n410,n1))
        & leq(pv19,minus(n410,n1))
        & leq(pv20,minus(n330,n1))
        & leq(pv1376,n3)
        & ! [A] :
            ( ( leq(n0,A)
              & leq(A,n2) )
           => ! [B] :
                ( ( leq(n0,B)
                  & leq(B,n3) )
               => a_select3(simplex7_init,B,A) = init ) )
        & ! [C] :
            ( ( leq(n0,C)
              & leq(C,n3) )
           => a_select2(s_values7_init,C) = init )
        & ! [D] :
            ( ( leq(n0,D)
              & leq(D,n2) )
           => a_select2(s_center7_init,D) = init )
        & ! [E] :
            ( ( leq(n0,E)
              & leq(E,minus(n3,n1)) )
           => a_select2(s_try7_init,E) = init )
        & ( gt(loopcounter,n1)
         => ( pvar1400_init = init
            & pvar1401_init = init
            & pvar1402_init = init ) ) )
     => ( init = init
        & s_best7_init = init
        & s_sworst7_init = init
        & s_worst7_init = init
        & leq(n0,s_best7)
        & leq(n0,s_sworst7)
        & leq(n0,s_worst7)
        & leq(n0,pv19)
        & leq(n0,pv20)
        & leq(n0,pv1376)
        & leq(s_best7,n3)
        & leq(s_sworst7,n3)
        & leq(s_worst7,n3)
        & leq(pv19,minus(n410,n1))
        & leq(pv20,minus(n330,n1))
        & leq(pv1376,n3)
        & ! [F] :
            ( ( leq(n0,F)
              & leq(F,n2) )
           => ! [G] :
                ( ( leq(n0,G)
                  & leq(G,n3) )
               => a_select3(simplex7_init,G,F) = init ) )
        & ! [H] :
            ( ( leq(n0,H)
              & leq(H,n3) )
           => a_select2(s_values7_init,H) = init )
        & ! [I] :
            ( ( leq(n0,I)
              & leq(I,n2) )
           => a_select2(s_center7_init,I) = init )
        & ! [J] :
            ( ( leq(n0,J)
              & leq(J,minus(n3,n1)) )
           => a_select2(s_try7_init,J) = init )
        & ( gt(loopcounter,n1)
         => ( pvar1400_init = init
            & pvar1401_init = init
            & pvar1402_init = init ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f259,plain,
    ( init = init
    & s_best7_init = init
    & s_sworst7_init = init
    & s_worst7_init = init
    & leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n0,pv9)
    & leq(n0,pv19)
    & leq(n0,pv20)
    & leq(n0,pv1376)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv9,minus(n410,n1))
    & leq(pv19,minus(n410,n1))
    & leq(pv20,minus(n330,n1))
    & leq(pv1376,n3)
    & ! [A] :
        ( ~ leq(n0,A)
        | ~ leq(A,n2)
        | ! [B] :
            ( ~ leq(n0,B)
            | ~ leq(B,n3)
            | a_select3(simplex7_init,B,A) = init ) )
    & ! [C] :
        ( ~ leq(n0,C)
        | ~ leq(C,n3)
        | a_select2(s_values7_init,C) = init )
    & ! [D] :
        ( ~ leq(n0,D)
        | ~ leq(D,n2)
        | a_select2(s_center7_init,D) = init )
    & ! [E] :
        ( ~ leq(n0,E)
        | ~ leq(E,minus(n3,n1))
        | a_select2(s_try7_init,E) = init )
    & ( ~ gt(loopcounter,n1)
      | ( pvar1400_init = init
        & pvar1401_init = init
        & pvar1402_init = init ) )
    & ( init != init
      | s_best7_init != init
      | s_sworst7_init != init
      | s_worst7_init != init
      | ~ leq(n0,s_best7)
      | ~ leq(n0,s_sworst7)
      | ~ leq(n0,s_worst7)
      | ~ leq(n0,pv19)
      | ~ leq(n0,pv20)
      | ~ leq(n0,pv1376)
      | ~ leq(s_best7,n3)
      | ~ leq(s_sworst7,n3)
      | ~ leq(s_worst7,n3)
      | ~ leq(pv19,minus(n410,n1))
      | ~ leq(pv20,minus(n330,n1))
      | ~ leq(pv1376,n3)
      | ? [F] :
          ( leq(n0,F)
          & leq(F,n2)
          & ? [G] :
              ( leq(n0,G)
              & leq(G,n3)
              & a_select3(simplex7_init,G,F) != init ) )
      | ? [H] :
          ( leq(n0,H)
          & leq(H,n3)
          & a_select2(s_values7_init,H) != init )
      | ? [I] :
          ( leq(n0,I)
          & leq(I,n2)
          & a_select2(s_center7_init,I) != init )
      | ? [J] :
          ( leq(n0,J)
          & leq(J,minus(n3,n1))
          & a_select2(s_try7_init,J) != init )
      | ( gt(loopcounter,n1)
        & ( pvar1400_init != init
          | pvar1401_init != init
          | pvar1402_init != init ) ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f260,plain,
    ! [F] :
      ( pd0_3(F)
     => ( leq(n0,F)
        & leq(F,n2)
        & ? [G] :
            ( leq(n0,G)
            & leq(G,n3)
            & a_select3(simplex7_init,G,F) != init ) ) ),
    introduced(predicate_definition,[f259]) ).

fof(f261,plain,
    ! [H] :
      ( pd0_4(H)
     => ( leq(n0,H)
        & leq(H,n3)
        & a_select2(s_values7_init,H) != init ) ),
    introduced(predicate_definition,[f259]) ).

fof(f262,plain,
    ! [I] :
      ( pd0_5(I)
     => ( leq(n0,I)
        & leq(I,n2)
        & a_select2(s_center7_init,I) != init ) ),
    introduced(predicate_definition,[f259]) ).

fof(f263,plain,
    ! [J] :
      ( pd0_6(J)
     => ( leq(n0,J)
        & leq(J,minus(n3,n1))
        & a_select2(s_try7_init,J) != init ) ),
    introduced(predicate_definition,[f259]) ).

fof(f264,plain,
    ( init = init
    & s_best7_init = init
    & s_sworst7_init = init
    & s_worst7_init = init
    & leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n0,pv9)
    & leq(n0,pv19)
    & leq(n0,pv20)
    & leq(n0,pv1376)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv9,minus(n410,n1))
    & leq(pv19,minus(n410,n1))
    & leq(pv20,minus(n330,n1))
    & leq(pv1376,n3)
    & ! [A] :
        ( ~ leq(n0,A)
        | ~ leq(A,n2)
        | ! [B] :
            ( ~ leq(n0,B)
            | ~ leq(B,n3)
            | a_select3(simplex7_init,B,A) = init ) )
    & ! [C] :
        ( ~ leq(n0,C)
        | ~ leq(C,n3)
        | a_select2(s_values7_init,C) = init )
    & ! [D] :
        ( ~ leq(n0,D)
        | ~ leq(D,n2)
        | a_select2(s_center7_init,D) = init )
    & ! [E] :
        ( ~ leq(n0,E)
        | ~ leq(E,minus(n3,n1))
        | a_select2(s_try7_init,E) = init )
    & ( ~ gt(loopcounter,n1)
      | ( pvar1400_init = init
        & pvar1401_init = init
        & pvar1402_init = init ) )
    & ( init != init
      | s_best7_init != init
      | s_sworst7_init != init
      | s_worst7_init != init
      | ~ leq(n0,s_best7)
      | ~ leq(n0,s_sworst7)
      | ~ leq(n0,s_worst7)
      | ~ leq(n0,pv19)
      | ~ leq(n0,pv20)
      | ~ leq(n0,pv1376)
      | ~ leq(s_best7,n3)
      | ~ leq(s_sworst7,n3)
      | ~ leq(s_worst7,n3)
      | ~ leq(pv19,minus(n410,n1))
      | ~ leq(pv20,minus(n330,n1))
      | ~ leq(pv1376,n3)
      | ? [F] : pd0_3(F)
      | ? [H] : pd0_4(H)
      | ? [I] : pd0_5(I)
      | ? [J] : pd0_6(J)
      | ( gt(loopcounter,n1)
        & ( pvar1400_init != init
          | pvar1401_init != init
          | pvar1402_init != init ) ) ) ),
    inference(formula_renaming,[status(thm)],[f259,f263,f262,f261,f260]) ).

fof(f265,plain,
    ( init = init
    & s_best7_init = init
    & s_sworst7_init = init
    & s_worst7_init = init
    & leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n0,pv9)
    & leq(n0,pv19)
    & leq(n0,pv20)
    & leq(n0,pv1376)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv9,minus(n410,n1))
    & leq(pv19,minus(n410,n1))
    & leq(pv20,minus(n330,n1))
    & leq(pv1376,n3)
    & ! [A] :
        ( ~ leq(n0,A)
        | ~ leq(A,n2)
        | ! [B] :
            ( ~ leq(n0,B)
            | ~ leq(B,n3)
            | a_select3(simplex7_init,B,A) = init ) )
    & ! [C] :
        ( ~ leq(n0,C)
        | ~ leq(C,n3)
        | a_select2(s_values7_init,C) = init )
    & ! [D] :
        ( ~ leq(n0,D)
        | ~ leq(D,n2)
        | a_select2(s_center7_init,D) = init )
    & ! [E] :
        ( ~ leq(n0,E)
        | ~ leq(E,minus(n3,n1))
        | a_select2(s_try7_init,E) = init )
    & ( ~ gt(loopcounter,n1)
      | ( pvar1400_init = init
        & pvar1401_init = init
        & pvar1402_init = init ) )
    & ( init != init
      | s_best7_init != init
      | s_sworst7_init != init
      | s_worst7_init != init
      | ~ leq(n0,s_best7)
      | ~ leq(n0,s_sworst7)
      | ~ leq(n0,s_worst7)
      | ~ leq(n0,pv19)
      | ~ leq(n0,pv20)
      | ~ leq(n0,pv1376)
      | ~ leq(s_best7,n3)
      | ~ leq(s_sworst7,n3)
      | ~ leq(s_worst7,n3)
      | ~ leq(pv19,minus(n410,n1))
      | ~ leq(pv20,minus(n330,n1))
      | ~ leq(pv1376,n3)
      | pd0_3(sk0_23)
      | pd0_4(sk0_24)
      | pd0_5(sk0_25)
      | pd0_6(sk0_26)
      | ( gt(loopcounter,n1)
        & ( pvar1400_init != init
          | pvar1401_init != init
          | pvar1402_init != init ) ) ) ),
    inference(skolemization,[status(esa)],[f264]) ).

fof(f267,plain,
    s_best7_init = init,
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f268,plain,
    s_sworst7_init = init,
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f269,plain,
    s_worst7_init = init,
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f270,plain,
    leq(n0,s_best7),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f271,plain,
    leq(n0,s_sworst7),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f272,plain,
    leq(n0,s_worst7),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f274,plain,
    leq(n0,pv19),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f275,plain,
    leq(n0,pv20),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f276,plain,
    leq(n0,pv1376),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f277,plain,
    leq(s_best7,n3),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f278,plain,
    leq(s_sworst7,n3),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f279,plain,
    leq(s_worst7,n3),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f281,plain,
    leq(pv19,minus(n410,n1)),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f282,plain,
    leq(pv20,minus(n330,n1)),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f283,plain,
    leq(pv1376,n3),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f284,plain,
    ! [X0,X1] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,n2)
      | ~ leq(n0,X1)
      | ~ leq(X1,n3)
      | a_select3(simplex7_init,X1,X0) = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f285,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,n3)
      | a_select2(s_values7_init,X0) = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f286,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,n2)
      | a_select2(s_center7_init,X0) = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f287,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,minus(n3,n1))
      | a_select2(s_try7_init,X0) = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f288,plain,
    ( ~ gt(loopcounter,n1)
    | pvar1400_init = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f289,plain,
    ( ~ gt(loopcounter,n1)
    | pvar1401_init = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f290,plain,
    ( ~ gt(loopcounter,n1)
    | pvar1402_init = init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f291,plain,
    ( init != init
    | s_best7_init != init
    | s_sworst7_init != init
    | s_worst7_init != init
    | ~ leq(n0,s_best7)
    | ~ leq(n0,s_sworst7)
    | ~ leq(n0,s_worst7)
    | ~ leq(n0,pv19)
    | ~ leq(n0,pv20)
    | ~ leq(n0,pv1376)
    | ~ leq(s_best7,n3)
    | ~ leq(s_sworst7,n3)
    | ~ leq(s_worst7,n3)
    | ~ leq(pv19,minus(n410,n1))
    | ~ leq(pv20,minus(n330,n1))
    | ~ leq(pv1376,n3)
    | pd0_3(sk0_23)
    | pd0_4(sk0_24)
    | pd0_5(sk0_25)
    | pd0_6(sk0_26)
    | gt(loopcounter,n1) ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f292,plain,
    ( init != init
    | s_best7_init != init
    | s_sworst7_init != init
    | s_worst7_init != init
    | ~ leq(n0,s_best7)
    | ~ leq(n0,s_sworst7)
    | ~ leq(n0,s_worst7)
    | ~ leq(n0,pv19)
    | ~ leq(n0,pv20)
    | ~ leq(n0,pv1376)
    | ~ leq(s_best7,n3)
    | ~ leq(s_sworst7,n3)
    | ~ leq(s_worst7,n3)
    | ~ leq(pv19,minus(n410,n1))
    | ~ leq(pv20,minus(n330,n1))
    | ~ leq(pv1376,n3)
    | pd0_3(sk0_23)
    | pd0_4(sk0_24)
    | pd0_5(sk0_25)
    | pd0_6(sk0_26)
    | pvar1400_init != init
    | pvar1401_init != init
    | pvar1402_init != init ),
    inference(cnf_transformation,[status(esa)],[f265]) ).

fof(f367,plain,
    ! [F] :
      ( ~ pd0_3(F)
      | ( leq(n0,F)
        & leq(F,n2)
        & ? [G] :
            ( leq(n0,G)
            & leq(G,n3)
            & a_select3(simplex7_init,G,F) != init ) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f260]) ).

fof(f368,plain,
    ! [F] :
      ( ~ pd0_3(F)
      | ( leq(n0,F)
        & leq(F,n2)
        & leq(n0,sk0_31(F))
        & leq(sk0_31(F),n3)
        & a_select3(simplex7_init,sk0_31(F),F) != init ) ),
    inference(skolemization,[status(esa)],[f367]) ).

fof(f369,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | leq(n0,X0) ),
    inference(cnf_transformation,[status(esa)],[f368]) ).

fof(f370,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | leq(X0,n2) ),
    inference(cnf_transformation,[status(esa)],[f368]) ).

fof(f371,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | leq(n0,sk0_31(X0)) ),
    inference(cnf_transformation,[status(esa)],[f368]) ).

fof(f372,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | leq(sk0_31(X0),n3) ),
    inference(cnf_transformation,[status(esa)],[f368]) ).

fof(f373,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | a_select3(simplex7_init,sk0_31(X0),X0) != init ),
    inference(cnf_transformation,[status(esa)],[f368]) ).

fof(f374,plain,
    ! [H] :
      ( ~ pd0_4(H)
      | ( leq(n0,H)
        & leq(H,n3)
        & a_select2(s_values7_init,H) != init ) ),
    inference(pre_NNF_transformation,[status(esa)],[f261]) ).

fof(f375,plain,
    ! [X0] :
      ( ~ pd0_4(X0)
      | leq(n0,X0) ),
    inference(cnf_transformation,[status(esa)],[f374]) ).

fof(f376,plain,
    ! [X0] :
      ( ~ pd0_4(X0)
      | leq(X0,n3) ),
    inference(cnf_transformation,[status(esa)],[f374]) ).

fof(f377,plain,
    ! [X0] :
      ( ~ pd0_4(X0)
      | a_select2(s_values7_init,X0) != init ),
    inference(cnf_transformation,[status(esa)],[f374]) ).

fof(f378,plain,
    ! [I] :
      ( ~ pd0_5(I)
      | ( leq(n0,I)
        & leq(I,n2)
        & a_select2(s_center7_init,I) != init ) ),
    inference(pre_NNF_transformation,[status(esa)],[f262]) ).

fof(f379,plain,
    ! [X0] :
      ( ~ pd0_5(X0)
      | leq(n0,X0) ),
    inference(cnf_transformation,[status(esa)],[f378]) ).

fof(f380,plain,
    ! [X0] :
      ( ~ pd0_5(X0)
      | leq(X0,n2) ),
    inference(cnf_transformation,[status(esa)],[f378]) ).

fof(f381,plain,
    ! [X0] :
      ( ~ pd0_5(X0)
      | a_select2(s_center7_init,X0) != init ),
    inference(cnf_transformation,[status(esa)],[f378]) ).

fof(f382,plain,
    ! [J] :
      ( ~ pd0_6(J)
      | ( leq(n0,J)
        & leq(J,minus(n3,n1))
        & a_select2(s_try7_init,J) != init ) ),
    inference(pre_NNF_transformation,[status(esa)],[f263]) ).

fof(f383,plain,
    ! [X0] :
      ( ~ pd0_6(X0)
      | leq(n0,X0) ),
    inference(cnf_transformation,[status(esa)],[f382]) ).

fof(f384,plain,
    ! [X0] :
      ( ~ pd0_6(X0)
      | leq(X0,minus(n3,n1)) ),
    inference(cnf_transformation,[status(esa)],[f382]) ).

fof(f385,plain,
    ! [X0] :
      ( ~ pd0_6(X0)
      | a_select2(s_try7_init,X0) != init ),
    inference(cnf_transformation,[status(esa)],[f382]) ).

fof(f392,plain,
    ( spl0_0
  <=> gt(loopcounter,n1) ),
    introduced(split_symbol_definition) ).

fof(f395,plain,
    ( spl0_1
  <=> pvar1400_init = init ),
    introduced(split_symbol_definition) ).

fof(f398,plain,
    ( ~ spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f288,f392,f395]) ).

fof(f399,plain,
    ( spl0_2
  <=> pvar1401_init = init ),
    introduced(split_symbol_definition) ).

fof(f402,plain,
    ( ~ spl0_0
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f289,f392,f399]) ).

fof(f403,plain,
    ( spl0_3
  <=> pvar1402_init = init ),
    introduced(split_symbol_definition) ).

fof(f406,plain,
    ( ~ spl0_0
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f290,f392,f403]) ).

fof(f407,plain,
    ( spl0_4
  <=> init = init ),
    introduced(split_symbol_definition) ).

fof(f409,plain,
    ( init != init
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f407]) ).

fof(f410,plain,
    ( spl0_5
  <=> s_best7_init = init ),
    introduced(split_symbol_definition) ).

fof(f412,plain,
    ( s_best7_init != init
    | spl0_5 ),
    inference(component_clause,[status(thm)],[f410]) ).

fof(f413,plain,
    ( spl0_6
  <=> s_sworst7_init = init ),
    introduced(split_symbol_definition) ).

fof(f415,plain,
    ( s_sworst7_init != init
    | spl0_6 ),
    inference(component_clause,[status(thm)],[f413]) ).

fof(f416,plain,
    ( spl0_7
  <=> s_worst7_init = init ),
    introduced(split_symbol_definition) ).

fof(f418,plain,
    ( s_worst7_init != init
    | spl0_7 ),
    inference(component_clause,[status(thm)],[f416]) ).

fof(f419,plain,
    ( spl0_8
  <=> leq(n0,s_best7) ),
    introduced(split_symbol_definition) ).

fof(f421,plain,
    ( ~ leq(n0,s_best7)
    | spl0_8 ),
    inference(component_clause,[status(thm)],[f419]) ).

fof(f422,plain,
    ( spl0_9
  <=> leq(n0,s_sworst7) ),
    introduced(split_symbol_definition) ).

fof(f424,plain,
    ( ~ leq(n0,s_sworst7)
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f422]) ).

fof(f425,plain,
    ( spl0_10
  <=> leq(n0,s_worst7) ),
    introduced(split_symbol_definition) ).

fof(f427,plain,
    ( ~ leq(n0,s_worst7)
    | spl0_10 ),
    inference(component_clause,[status(thm)],[f425]) ).

fof(f428,plain,
    ( spl0_11
  <=> leq(n0,pv19) ),
    introduced(split_symbol_definition) ).

fof(f430,plain,
    ( ~ leq(n0,pv19)
    | spl0_11 ),
    inference(component_clause,[status(thm)],[f428]) ).

fof(f431,plain,
    ( spl0_12
  <=> leq(n0,pv20) ),
    introduced(split_symbol_definition) ).

fof(f433,plain,
    ( ~ leq(n0,pv20)
    | spl0_12 ),
    inference(component_clause,[status(thm)],[f431]) ).

fof(f434,plain,
    ( spl0_13
  <=> leq(n0,pv1376) ),
    introduced(split_symbol_definition) ).

fof(f436,plain,
    ( ~ leq(n0,pv1376)
    | spl0_13 ),
    inference(component_clause,[status(thm)],[f434]) ).

fof(f437,plain,
    ( spl0_14
  <=> leq(s_best7,n3) ),
    introduced(split_symbol_definition) ).

fof(f439,plain,
    ( ~ leq(s_best7,n3)
    | spl0_14 ),
    inference(component_clause,[status(thm)],[f437]) ).

fof(f440,plain,
    ( spl0_15
  <=> leq(s_sworst7,n3) ),
    introduced(split_symbol_definition) ).

fof(f442,plain,
    ( ~ leq(s_sworst7,n3)
    | spl0_15 ),
    inference(component_clause,[status(thm)],[f440]) ).

fof(f443,plain,
    ( spl0_16
  <=> leq(s_worst7,n3) ),
    introduced(split_symbol_definition) ).

fof(f445,plain,
    ( ~ leq(s_worst7,n3)
    | spl0_16 ),
    inference(component_clause,[status(thm)],[f443]) ).

fof(f446,plain,
    ( spl0_17
  <=> leq(pv19,minus(n410,n1)) ),
    introduced(split_symbol_definition) ).

fof(f448,plain,
    ( ~ leq(pv19,minus(n410,n1))
    | spl0_17 ),
    inference(component_clause,[status(thm)],[f446]) ).

fof(f449,plain,
    ( spl0_18
  <=> leq(pv20,minus(n330,n1)) ),
    introduced(split_symbol_definition) ).

fof(f451,plain,
    ( ~ leq(pv20,minus(n330,n1))
    | spl0_18 ),
    inference(component_clause,[status(thm)],[f449]) ).

fof(f452,plain,
    ( spl0_19
  <=> leq(pv1376,n3) ),
    introduced(split_symbol_definition) ).

fof(f454,plain,
    ( ~ leq(pv1376,n3)
    | spl0_19 ),
    inference(component_clause,[status(thm)],[f452]) ).

fof(f455,plain,
    ( spl0_20
  <=> pd0_3(sk0_23) ),
    introduced(split_symbol_definition) ).

fof(f456,plain,
    ( pd0_3(sk0_23)
    | ~ spl0_20 ),
    inference(component_clause,[status(thm)],[f455]) ).

fof(f458,plain,
    ( spl0_21
  <=> pd0_4(sk0_24) ),
    introduced(split_symbol_definition) ).

fof(f459,plain,
    ( pd0_4(sk0_24)
    | ~ spl0_21 ),
    inference(component_clause,[status(thm)],[f458]) ).

fof(f461,plain,
    ( spl0_22
  <=> pd0_5(sk0_25) ),
    introduced(split_symbol_definition) ).

fof(f462,plain,
    ( pd0_5(sk0_25)
    | ~ spl0_22 ),
    inference(component_clause,[status(thm)],[f461]) ).

fof(f464,plain,
    ( spl0_23
  <=> pd0_6(sk0_26) ),
    introduced(split_symbol_definition) ).

fof(f465,plain,
    ( pd0_6(sk0_26)
    | ~ spl0_23 ),
    inference(component_clause,[status(thm)],[f464]) ).

fof(f467,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11
    | ~ spl0_12
    | ~ spl0_13
    | ~ spl0_14
    | ~ spl0_15
    | ~ spl0_16
    | ~ spl0_17
    | ~ spl0_18
    | ~ spl0_19
    | spl0_20
    | spl0_21
    | spl0_22
    | spl0_23
    | spl0_0 ),
    inference(split_clause,[status(thm)],[f291,f407,f410,f413,f416,f419,f422,f425,f428,f431,f434,f437,f440,f443,f446,f449,f452,f455,f458,f461,f464,f392]) ).

fof(f468,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10
    | ~ spl0_11
    | ~ spl0_12
    | ~ spl0_13
    | ~ spl0_14
    | ~ spl0_15
    | ~ spl0_16
    | ~ spl0_17
    | ~ spl0_18
    | ~ spl0_19
    | spl0_20
    | spl0_21
    | spl0_22
    | spl0_23
    | ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f292,f407,f410,f413,f416,f419,f422,f425,f428,f431,f434,f437,f440,f443,f446,f449,f452,f455,f458,f461,f464,f395,f399,f403]) ).

fof(f471,plain,
    ( $false
    | spl0_19 ),
    inference(forward_subsumption_resolution,[status(thm)],[f454,f283]) ).

fof(f472,plain,
    spl0_19,
    inference(contradiction_clause,[status(thm)],[f471]) ).

fof(f473,plain,
    ( $false
    | spl0_18 ),
    inference(forward_subsumption_resolution,[status(thm)],[f451,f282]) ).

fof(f474,plain,
    spl0_18,
    inference(contradiction_clause,[status(thm)],[f473]) ).

fof(f475,plain,
    ( $false
    | spl0_17 ),
    inference(forward_subsumption_resolution,[status(thm)],[f448,f281]) ).

fof(f476,plain,
    spl0_17,
    inference(contradiction_clause,[status(thm)],[f475]) ).

fof(f477,plain,
    ( $false
    | spl0_16 ),
    inference(forward_subsumption_resolution,[status(thm)],[f445,f279]) ).

fof(f478,plain,
    spl0_16,
    inference(contradiction_clause,[status(thm)],[f477]) ).

fof(f479,plain,
    ( $false
    | spl0_15 ),
    inference(forward_subsumption_resolution,[status(thm)],[f442,f278]) ).

fof(f480,plain,
    spl0_15,
    inference(contradiction_clause,[status(thm)],[f479]) ).

fof(f481,plain,
    ( $false
    | spl0_14 ),
    inference(forward_subsumption_resolution,[status(thm)],[f439,f277]) ).

fof(f482,plain,
    spl0_14,
    inference(contradiction_clause,[status(thm)],[f481]) ).

fof(f483,plain,
    ( $false
    | spl0_13 ),
    inference(forward_subsumption_resolution,[status(thm)],[f436,f276]) ).

fof(f484,plain,
    spl0_13,
    inference(contradiction_clause,[status(thm)],[f483]) ).

fof(f485,plain,
    ( $false
    | spl0_12 ),
    inference(forward_subsumption_resolution,[status(thm)],[f433,f275]) ).

fof(f486,plain,
    spl0_12,
    inference(contradiction_clause,[status(thm)],[f485]) ).

fof(f487,plain,
    ( $false
    | spl0_11 ),
    inference(forward_subsumption_resolution,[status(thm)],[f430,f274]) ).

fof(f488,plain,
    spl0_11,
    inference(contradiction_clause,[status(thm)],[f487]) ).

fof(f489,plain,
    ( $false
    | spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f427,f272]) ).

fof(f490,plain,
    spl0_10,
    inference(contradiction_clause,[status(thm)],[f489]) ).

fof(f491,plain,
    ( $false
    | spl0_9 ),
    inference(forward_subsumption_resolution,[status(thm)],[f424,f271]) ).

fof(f492,plain,
    spl0_9,
    inference(contradiction_clause,[status(thm)],[f491]) ).

fof(f493,plain,
    ( $false
    | spl0_8 ),
    inference(forward_subsumption_resolution,[status(thm)],[f421,f270]) ).

fof(f494,plain,
    spl0_8,
    inference(contradiction_clause,[status(thm)],[f493]) ).

fof(f495,plain,
    ( init != init
    | spl0_7 ),
    inference(forward_demodulation,[status(thm)],[f269,f418]) ).

fof(f496,plain,
    ( $false
    | spl0_7 ),
    inference(trivial_equality_resolution,[status(esa)],[f495]) ).

fof(f497,plain,
    spl0_7,
    inference(contradiction_clause,[status(thm)],[f496]) ).

fof(f498,plain,
    ( init != init
    | spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f268,f415]) ).

fof(f499,plain,
    ( $false
    | spl0_6 ),
    inference(trivial_equality_resolution,[status(esa)],[f498]) ).

fof(f500,plain,
    spl0_6,
    inference(contradiction_clause,[status(thm)],[f499]) ).

fof(f501,plain,
    ( init != init
    | spl0_5 ),
    inference(forward_demodulation,[status(thm)],[f267,f412]) ).

fof(f502,plain,
    ( $false
    | spl0_5 ),
    inference(trivial_equality_resolution,[status(esa)],[f501]) ).

fof(f503,plain,
    spl0_5,
    inference(contradiction_clause,[status(thm)],[f502]) ).

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

fof(f505,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f504]) ).

fof(f506,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,n3)
      | ~ pd0_4(X0) ),
    inference(resolution,[status(thm)],[f285,f377]) ).

fof(f507,plain,
    ! [X0] :
      ( ~ leq(X0,n3)
      | ~ pd0_4(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f506,f375]) ).

fof(f508,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | ~ leq(X0,n2)
      | ~ pd0_5(X0) ),
    inference(resolution,[status(thm)],[f286,f381]) ).

fof(f509,plain,
    ! [X0] :
      ( ~ leq(X0,n2)
      | ~ pd0_5(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f508,f379]) ).

fof(f510,plain,
    ! [X0] : ~ pd0_4(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f507,f376]) ).

fof(f511,plain,
    ! [X0] : ~ pd0_5(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f509,f380]) ).

fof(f512,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | ~ leq(n0,X0)
      | ~ leq(X0,n2)
      | ~ leq(n0,sk0_31(X0))
      | ~ leq(sk0_31(X0),n3) ),
    inference(resolution,[status(thm)],[f373,f284]) ).

fof(f513,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | ~ leq(X0,n2)
      | ~ leq(n0,sk0_31(X0))
      | ~ leq(sk0_31(X0),n3) ),
    inference(forward_subsumption_resolution,[status(thm)],[f512,f369]) ).

fof(f530,plain,
    ! [X0] :
      ( ~ leq(n0,X0)
      | a_select2(s_try7_init,X0) = init
      | ~ pd0_6(X0) ),
    inference(resolution,[status(thm)],[f287,f384]) ).

fof(f531,plain,
    ! [X0] :
      ( a_select2(s_try7_init,X0) = init
      | ~ pd0_6(X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f530,f383]) ).

fof(f540,plain,
    ! [X0] : ~ pd0_6(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f531,f385]) ).

fof(f541,plain,
    ( $false
    | ~ spl0_23 ),
    inference(backward_subsumption_resolution,[status(thm)],[f465,f540]) ).

fof(f542,plain,
    ~ spl0_23,
    inference(contradiction_clause,[status(thm)],[f541]) ).

fof(f543,plain,
    ( $false
    | ~ spl0_22 ),
    inference(forward_subsumption_resolution,[status(thm)],[f462,f511]) ).

fof(f544,plain,
    ~ spl0_22,
    inference(contradiction_clause,[status(thm)],[f543]) ).

fof(f545,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | ~ leq(n0,sk0_31(X0))
      | ~ leq(sk0_31(X0),n3) ),
    inference(forward_subsumption_resolution,[status(thm)],[f513,f370]) ).

fof(f546,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | ~ leq(n0,sk0_31(X0))
      | ~ pd0_3(X0) ),
    inference(resolution,[status(thm)],[f545,f372]) ).

fof(f547,plain,
    ! [X0] :
      ( ~ pd0_3(X0)
      | ~ leq(n0,sk0_31(X0)) ),
    inference(duplicate_literals_removal,[status(esa)],[f546]) ).

fof(f548,plain,
    ! [X0] : ~ pd0_3(X0),
    inference(forward_subsumption_resolution,[status(thm)],[f547,f371]) ).

fof(f549,plain,
    ( $false
    | ~ spl0_20 ),
    inference(backward_subsumption_resolution,[status(thm)],[f456,f548]) ).

fof(f550,plain,
    ~ spl0_20,
    inference(contradiction_clause,[status(thm)],[f549]) ).

fof(f551,plain,
    ( $false
    | ~ spl0_21 ),
    inference(forward_subsumption_resolution,[status(thm)],[f459,f510]) ).

fof(f552,plain,
    ~ spl0_21,
    inference(contradiction_clause,[status(thm)],[f551]) ).

fof(f553,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f398,f402,f406,f467,f468,f472,f474,f476,f478,f480,f482,f484,f486,f488,f490,f492,f494,f497,f500,f503,f505,f542,f544,f550,f552]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWV026+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n020.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 : Tue May 30 11:38:43 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.5.1
% 0.13/0.39  % Refutation found
% 0.13/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40  % Elapsed time: 0.048641 seconds
% 0.13/0.40  % CPU time: 0.172533 seconds
% 0.13/0.40  % Memory used: 21.142 MB
%------------------------------------------------------------------------------