TSTP Solution File: SWC402+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC402+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %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 : Wed Aug 31 18:40:59 EDT 2022

% Result   : Theorem 0.19s 0.55s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   52 (  14 unt;   0 def)
%            Number of atoms       :  589 ( 149 equ)
%            Maximal formula atoms :   58 (  11 avg)
%            Number of connectives :  869 ( 332   ~; 292   |; 218   &)
%                                         (   3 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   31 (   9 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :  255 ( 172   !;  83   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f744,plain,
    $false,
    inference(avatar_sat_refutation,[],[f403,f743]) ).

fof(f743,plain,
    ~ spl19_7,
    inference(avatar_contradiction_clause,[],[f742]) ).

fof(f742,plain,
    ( $false
    | ~ spl19_7 ),
    inference(subsumption_resolution,[],[f741,f245]) ).

fof(f245,plain,
    ssItem(sK16),
    inference(cnf_transformation,[],[f175]) ).

fof(f175,plain,
    ( ssList(sK12)
    & ssList(sK14)
    & ~ memberP(sK13,sK16)
    & ssItem(sK16)
    & memberP(sK12,sK16)
    & ssList(sK15)
    & sK13 = sK15
    & sK12 = sK14
    & ( nil = sK15
      | nil != sK14 )
    & ssList(sK17)
    & ssList(sK18)
    & app(app(sK17,sK14),sK18) = sK15
    & totalorderedP(sK14)
    & ! [X7] :
        ( ~ ssItem(X7)
        | ! [X8] :
            ( ! [X9] :
                ( ~ ssItem(X9)
                | ! [X10] :
                    ( ~ ssList(X10)
                    | ~ leq(X7,X9)
                    | sK14 != app(cons(X9,nil),X10) ) )
            | ~ ssList(X8)
            | sK17 != app(X8,cons(X7,nil)) ) )
    & ! [X11] :
        ( ~ ssItem(X11)
        | ! [X12] :
            ( ! [X13] :
                ( ~ ssItem(X13)
                | ! [X14] :
                    ( app(X14,cons(X13,nil)) != sK14
                    | ~ ssList(X14)
                    | ~ leq(X13,X11) ) )
            | ~ ssList(X12)
            | app(cons(X11,nil),X12) != sK18 ) )
    & ssList(sK13) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15,sK16,sK17,sK18])],[f167,f174,f173,f172,f171,f170,f169,f168]) ).

fof(f168,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ? [X4] :
                        ( ~ memberP(X1,X4)
                        & ssItem(X4)
                        & memberP(X0,X4) )
                    & ssList(X3)
                    & X1 = X3
                    & X0 = X2
                    & ( nil = X3
                      | nil != X2 )
                    & ? [X5] :
                        ( ssList(X5)
                        & ? [X6] :
                            ( ssList(X6)
                            & app(app(X5,X2),X6) = X3
                            & totalorderedP(X2)
                            & ! [X7] :
                                ( ~ ssItem(X7)
                                | ! [X8] :
                                    ( ! [X9] :
                                        ( ~ ssItem(X9)
                                        | ! [X10] :
                                            ( ~ ssList(X10)
                                            | ~ leq(X7,X9)
                                            | app(cons(X9,nil),X10) != X2 ) )
                                    | ~ ssList(X8)
                                    | app(X8,cons(X7,nil)) != X5 ) )
                            & ! [X11] :
                                ( ~ ssItem(X11)
                                | ! [X12] :
                                    ( ! [X13] :
                                        ( ~ ssItem(X13)
                                        | ! [X14] :
                                            ( app(X14,cons(X13,nil)) != X2
                                            | ~ ssList(X14)
                                            | ~ leq(X13,X11) ) )
                                    | ~ ssList(X12)
                                    | app(cons(X11,nil),X12) != X6 ) ) ) ) ) )
            & ssList(X1) ) )
   => ( ssList(sK12)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ? [X4] :
                      ( ~ memberP(X1,X4)
                      & ssItem(X4)
                      & memberP(sK12,X4) )
                  & ssList(X3)
                  & X1 = X3
                  & sK12 = X2
                  & ( nil = X3
                    | nil != X2 )
                  & ? [X5] :
                      ( ssList(X5)
                      & ? [X6] :
                          ( ssList(X6)
                          & app(app(X5,X2),X6) = X3
                          & totalorderedP(X2)
                          & ! [X7] :
                              ( ~ ssItem(X7)
                              | ! [X8] :
                                  ( ! [X9] :
                                      ( ~ ssItem(X9)
                                      | ! [X10] :
                                          ( ~ ssList(X10)
                                          | ~ leq(X7,X9)
                                          | app(cons(X9,nil),X10) != X2 ) )
                                  | ~ ssList(X8)
                                  | app(X8,cons(X7,nil)) != X5 ) )
                          & ! [X11] :
                              ( ~ ssItem(X11)
                              | ! [X12] :
                                  ( ! [X13] :
                                      ( ~ ssItem(X13)
                                      | ! [X14] :
                                          ( app(X14,cons(X13,nil)) != X2
                                          | ~ ssList(X14)
                                          | ~ leq(X13,X11) ) )
                                  | ~ ssList(X12)
                                  | app(cons(X11,nil),X12) != X6 ) ) ) ) ) )
          & ssList(X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f169,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ? [X4] :
                    ( ~ memberP(X1,X4)
                    & ssItem(X4)
                    & memberP(sK12,X4) )
                & ssList(X3)
                & X1 = X3
                & sK12 = X2
                & ( nil = X3
                  | nil != X2 )
                & ? [X5] :
                    ( ssList(X5)
                    & ? [X6] :
                        ( ssList(X6)
                        & app(app(X5,X2),X6) = X3
                        & totalorderedP(X2)
                        & ! [X7] :
                            ( ~ ssItem(X7)
                            | ! [X8] :
                                ( ! [X9] :
                                    ( ~ ssItem(X9)
                                    | ! [X10] :
                                        ( ~ ssList(X10)
                                        | ~ leq(X7,X9)
                                        | app(cons(X9,nil),X10) != X2 ) )
                                | ~ ssList(X8)
                                | app(X8,cons(X7,nil)) != X5 ) )
                        & ! [X11] :
                            ( ~ ssItem(X11)
                            | ! [X12] :
                                ( ! [X13] :
                                    ( ~ ssItem(X13)
                                    | ! [X14] :
                                        ( app(X14,cons(X13,nil)) != X2
                                        | ~ ssList(X14)
                                        | ~ leq(X13,X11) ) )
                                | ~ ssList(X12)
                                | app(cons(X11,nil),X12) != X6 ) ) ) ) ) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ? [X4] :
                  ( ~ memberP(sK13,X4)
                  & ssItem(X4)
                  & memberP(sK12,X4) )
              & ssList(X3)
              & sK13 = X3
              & sK12 = X2
              & ( nil = X3
                | nil != X2 )
              & ? [X5] :
                  ( ssList(X5)
                  & ? [X6] :
                      ( ssList(X6)
                      & app(app(X5,X2),X6) = X3
                      & totalorderedP(X2)
                      & ! [X7] :
                          ( ~ ssItem(X7)
                          | ! [X8] :
                              ( ! [X9] :
                                  ( ~ ssItem(X9)
                                  | ! [X10] :
                                      ( ~ ssList(X10)
                                      | ~ leq(X7,X9)
                                      | app(cons(X9,nil),X10) != X2 ) )
                              | ~ ssList(X8)
                              | app(X8,cons(X7,nil)) != X5 ) )
                      & ! [X11] :
                          ( ~ ssItem(X11)
                          | ! [X12] :
                              ( ! [X13] :
                                  ( ~ ssItem(X13)
                                  | ! [X14] :
                                      ( app(X14,cons(X13,nil)) != X2
                                      | ~ ssList(X14)
                                      | ~ leq(X13,X11) ) )
                              | ~ ssList(X12)
                              | app(cons(X11,nil),X12) != X6 ) ) ) ) ) )
      & ssList(sK13) ) ),
    introduced(choice_axiom,[]) ).

fof(f170,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( ? [X4] :
                ( ~ memberP(sK13,X4)
                & ssItem(X4)
                & memberP(sK12,X4) )
            & ssList(X3)
            & sK13 = X3
            & sK12 = X2
            & ( nil = X3
              | nil != X2 )
            & ? [X5] :
                ( ssList(X5)
                & ? [X6] :
                    ( ssList(X6)
                    & app(app(X5,X2),X6) = X3
                    & totalorderedP(X2)
                    & ! [X7] :
                        ( ~ ssItem(X7)
                        | ! [X8] :
                            ( ! [X9] :
                                ( ~ ssItem(X9)
                                | ! [X10] :
                                    ( ~ ssList(X10)
                                    | ~ leq(X7,X9)
                                    | app(cons(X9,nil),X10) != X2 ) )
                            | ~ ssList(X8)
                            | app(X8,cons(X7,nil)) != X5 ) )
                    & ! [X11] :
                        ( ~ ssItem(X11)
                        | ! [X12] :
                            ( ! [X13] :
                                ( ~ ssItem(X13)
                                | ! [X14] :
                                    ( app(X14,cons(X13,nil)) != X2
                                    | ~ ssList(X14)
                                    | ~ leq(X13,X11) ) )
                            | ~ ssList(X12)
                            | app(cons(X11,nil),X12) != X6 ) ) ) ) ) )
   => ( ssList(sK14)
      & ? [X3] :
          ( ? [X4] :
              ( ~ memberP(sK13,X4)
              & ssItem(X4)
              & memberP(sK12,X4) )
          & ssList(X3)
          & sK13 = X3
          & sK12 = sK14
          & ( nil = X3
            | nil != sK14 )
          & ? [X5] :
              ( ssList(X5)
              & ? [X6] :
                  ( ssList(X6)
                  & app(app(X5,sK14),X6) = X3
                  & totalorderedP(sK14)
                  & ! [X7] :
                      ( ~ ssItem(X7)
                      | ! [X8] :
                          ( ! [X9] :
                              ( ~ ssItem(X9)
                              | ! [X10] :
                                  ( ~ ssList(X10)
                                  | ~ leq(X7,X9)
                                  | sK14 != app(cons(X9,nil),X10) ) )
                          | ~ ssList(X8)
                          | app(X8,cons(X7,nil)) != X5 ) )
                  & ! [X11] :
                      ( ~ ssItem(X11)
                      | ! [X12] :
                          ( ! [X13] :
                              ( ~ ssItem(X13)
                              | ! [X14] :
                                  ( app(X14,cons(X13,nil)) != sK14
                                  | ~ ssList(X14)
                                  | ~ leq(X13,X11) ) )
                          | ~ ssList(X12)
                          | app(cons(X11,nil),X12) != X6 ) ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f171,plain,
    ( ? [X3] :
        ( ? [X4] :
            ( ~ memberP(sK13,X4)
            & ssItem(X4)
            & memberP(sK12,X4) )
        & ssList(X3)
        & sK13 = X3
        & sK12 = sK14
        & ( nil = X3
          | nil != sK14 )
        & ? [X5] :
            ( ssList(X5)
            & ? [X6] :
                ( ssList(X6)
                & app(app(X5,sK14),X6) = X3
                & totalorderedP(sK14)
                & ! [X7] :
                    ( ~ ssItem(X7)
                    | ! [X8] :
                        ( ! [X9] :
                            ( ~ ssItem(X9)
                            | ! [X10] :
                                ( ~ ssList(X10)
                                | ~ leq(X7,X9)
                                | sK14 != app(cons(X9,nil),X10) ) )
                        | ~ ssList(X8)
                        | app(X8,cons(X7,nil)) != X5 ) )
                & ! [X11] :
                    ( ~ ssItem(X11)
                    | ! [X12] :
                        ( ! [X13] :
                            ( ~ ssItem(X13)
                            | ! [X14] :
                                ( app(X14,cons(X13,nil)) != sK14
                                | ~ ssList(X14)
                                | ~ leq(X13,X11) ) )
                        | ~ ssList(X12)
                        | app(cons(X11,nil),X12) != X6 ) ) ) ) )
   => ( ? [X4] :
          ( ~ memberP(sK13,X4)
          & ssItem(X4)
          & memberP(sK12,X4) )
      & ssList(sK15)
      & sK13 = sK15
      & sK12 = sK14
      & ( nil = sK15
        | nil != sK14 )
      & ? [X5] :
          ( ssList(X5)
          & ? [X6] :
              ( ssList(X6)
              & sK15 = app(app(X5,sK14),X6)
              & totalorderedP(sK14)
              & ! [X7] :
                  ( ~ ssItem(X7)
                  | ! [X8] :
                      ( ! [X9] :
                          ( ~ ssItem(X9)
                          | ! [X10] :
                              ( ~ ssList(X10)
                              | ~ leq(X7,X9)
                              | sK14 != app(cons(X9,nil),X10) ) )
                      | ~ ssList(X8)
                      | app(X8,cons(X7,nil)) != X5 ) )
              & ! [X11] :
                  ( ~ ssItem(X11)
                  | ! [X12] :
                      ( ! [X13] :
                          ( ~ ssItem(X13)
                          | ! [X14] :
                              ( app(X14,cons(X13,nil)) != sK14
                              | ~ ssList(X14)
                              | ~ leq(X13,X11) ) )
                      | ~ ssList(X12)
                      | app(cons(X11,nil),X12) != X6 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f172,plain,
    ( ? [X4] :
        ( ~ memberP(sK13,X4)
        & ssItem(X4)
        & memberP(sK12,X4) )
   => ( ~ memberP(sK13,sK16)
      & ssItem(sK16)
      & memberP(sK12,sK16) ) ),
    introduced(choice_axiom,[]) ).

fof(f173,plain,
    ( ? [X5] :
        ( ssList(X5)
        & ? [X6] :
            ( ssList(X6)
            & sK15 = app(app(X5,sK14),X6)
            & totalorderedP(sK14)
            & ! [X7] :
                ( ~ ssItem(X7)
                | ! [X8] :
                    ( ! [X9] :
                        ( ~ ssItem(X9)
                        | ! [X10] :
                            ( ~ ssList(X10)
                            | ~ leq(X7,X9)
                            | sK14 != app(cons(X9,nil),X10) ) )
                    | ~ ssList(X8)
                    | app(X8,cons(X7,nil)) != X5 ) )
            & ! [X11] :
                ( ~ ssItem(X11)
                | ! [X12] :
                    ( ! [X13] :
                        ( ~ ssItem(X13)
                        | ! [X14] :
                            ( app(X14,cons(X13,nil)) != sK14
                            | ~ ssList(X14)
                            | ~ leq(X13,X11) ) )
                    | ~ ssList(X12)
                    | app(cons(X11,nil),X12) != X6 ) ) ) )
   => ( ssList(sK17)
      & ? [X6] :
          ( ssList(X6)
          & app(app(sK17,sK14),X6) = sK15
          & totalorderedP(sK14)
          & ! [X7] :
              ( ~ ssItem(X7)
              | ! [X8] :
                  ( ! [X9] :
                      ( ~ ssItem(X9)
                      | ! [X10] :
                          ( ~ ssList(X10)
                          | ~ leq(X7,X9)
                          | sK14 != app(cons(X9,nil),X10) ) )
                  | ~ ssList(X8)
                  | sK17 != app(X8,cons(X7,nil)) ) )
          & ! [X11] :
              ( ~ ssItem(X11)
              | ! [X12] :
                  ( ! [X13] :
                      ( ~ ssItem(X13)
                      | ! [X14] :
                          ( app(X14,cons(X13,nil)) != sK14
                          | ~ ssList(X14)
                          | ~ leq(X13,X11) ) )
                  | ~ ssList(X12)
                  | app(cons(X11,nil),X12) != X6 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f174,plain,
    ( ? [X6] :
        ( ssList(X6)
        & app(app(sK17,sK14),X6) = sK15
        & totalorderedP(sK14)
        & ! [X7] :
            ( ~ ssItem(X7)
            | ! [X8] :
                ( ! [X9] :
                    ( ~ ssItem(X9)
                    | ! [X10] :
                        ( ~ ssList(X10)
                        | ~ leq(X7,X9)
                        | sK14 != app(cons(X9,nil),X10) ) )
                | ~ ssList(X8)
                | sK17 != app(X8,cons(X7,nil)) ) )
        & ! [X11] :
            ( ~ ssItem(X11)
            | ! [X12] :
                ( ! [X13] :
                    ( ~ ssItem(X13)
                    | ! [X14] :
                        ( app(X14,cons(X13,nil)) != sK14
                        | ~ ssList(X14)
                        | ~ leq(X13,X11) ) )
                | ~ ssList(X12)
                | app(cons(X11,nil),X12) != X6 ) ) )
   => ( ssList(sK18)
      & app(app(sK17,sK14),sK18) = sK15
      & totalorderedP(sK14)
      & ! [X7] :
          ( ~ ssItem(X7)
          | ! [X8] :
              ( ! [X9] :
                  ( ~ ssItem(X9)
                  | ! [X10] :
                      ( ~ ssList(X10)
                      | ~ leq(X7,X9)
                      | sK14 != app(cons(X9,nil),X10) ) )
              | ~ ssList(X8)
              | sK17 != app(X8,cons(X7,nil)) ) )
      & ! [X11] :
          ( ~ ssItem(X11)
          | ! [X12] :
              ( ! [X13] :
                  ( ~ ssItem(X13)
                  | ! [X14] :
                      ( app(X14,cons(X13,nil)) != sK14
                      | ~ ssList(X14)
                      | ~ leq(X13,X11) ) )
              | ~ ssList(X12)
              | app(cons(X11,nil),X12) != sK18 ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f167,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ? [X4] :
                      ( ~ memberP(X1,X4)
                      & ssItem(X4)
                      & memberP(X0,X4) )
                  & ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ( nil = X3
                    | nil != X2 )
                  & ? [X5] :
                      ( ssList(X5)
                      & ? [X6] :
                          ( ssList(X6)
                          & app(app(X5,X2),X6) = X3
                          & totalorderedP(X2)
                          & ! [X7] :
                              ( ~ ssItem(X7)
                              | ! [X8] :
                                  ( ! [X9] :
                                      ( ~ ssItem(X9)
                                      | ! [X10] :
                                          ( ~ ssList(X10)
                                          | ~ leq(X7,X9)
                                          | app(cons(X9,nil),X10) != X2 ) )
                                  | ~ ssList(X8)
                                  | app(X8,cons(X7,nil)) != X5 ) )
                          & ! [X11] :
                              ( ~ ssItem(X11)
                              | ! [X12] :
                                  ( ! [X13] :
                                      ( ~ ssItem(X13)
                                      | ! [X14] :
                                          ( app(X14,cons(X13,nil)) != X2
                                          | ~ ssList(X14)
                                          | ~ leq(X13,X11) ) )
                                  | ~ ssList(X12)
                                  | app(cons(X11,nil),X12) != X6 ) ) ) ) ) )
          & ssList(X1) ) ),
    inference(rectify,[],[f122]) ).

fof(f122,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( ? [X14] :
                      ( ~ memberP(X1,X14)
                      & ssItem(X14)
                      & memberP(X0,X14) )
                  & ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ( nil = X3
                    | nil != X2 )
                  & ? [X4] :
                      ( ssList(X4)
                      & ? [X5] :
                          ( ssList(X5)
                          & app(app(X4,X2),X5) = X3
                          & totalorderedP(X2)
                          & ! [X10] :
                              ( ~ ssItem(X10)
                              | ! [X11] :
                                  ( ! [X12] :
                                      ( ~ ssItem(X12)
                                      | ! [X13] :
                                          ( ~ ssList(X13)
                                          | ~ leq(X10,X12)
                                          | app(cons(X12,nil),X13) != X2 ) )
                                  | ~ ssList(X11)
                                  | app(X11,cons(X10,nil)) != X4 ) )
                          & ! [X6] :
                              ( ~ ssItem(X6)
                              | ! [X7] :
                                  ( ! [X8] :
                                      ( ~ ssItem(X8)
                                      | ! [X9] :
                                          ( app(X9,cons(X8,nil)) != X2
                                          | ~ ssList(X9)
                                          | ~ leq(X8,X6) ) )
                                  | ~ ssList(X7)
                                  | app(cons(X6,nil),X7) != X5 ) ) ) ) ) )
          & ssList(X1) ) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ~ totalorderedP(X2)
                            | app(app(X4,X2),X5) != X3
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ssList(X7)
                                    & app(cons(X6,nil),X7) = X5
                                    & ? [X8] :
                                        ( ? [X9] :
                                            ( app(X9,cons(X8,nil)) = X2
                                            & leq(X8,X6)
                                            & ssList(X9) )
                                        & ssItem(X8) ) ) )
                            | ~ ssList(X5)
                            | ? [X10] :
                                ( ? [X11] :
                                    ( ssList(X11)
                                    & app(X11,cons(X10,nil)) = X4
                                    & ? [X12] :
                                        ( ? [X13] :
                                            ( ssList(X13)
                                            & leq(X10,X12)
                                            & app(cons(X12,nil),X13) = X2 )
                                        & ssItem(X12) ) )
                                & ssItem(X10) ) ) )
                    | ~ ssList(X3)
                    | X0 != X2
                    | ! [X14] :
                        ( ~ memberP(X0,X14)
                        | ~ ssItem(X14)
                        | memberP(X1,X14) )
                    | ( nil = X2
                      & nil != X3 )
                    | X1 != X3 ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ~ ssList(X5)
                            | app(app(X4,X2),X5) != X3
                            | ? [X10] :
                                ( ? [X11] :
                                    ( app(cons(X10,nil),X11) = X5
                                    & ? [X12] :
                                        ( ssItem(X12)
                                        & ? [X13] :
                                            ( ssList(X13)
                                            & app(X13,cons(X12,nil)) = X2
                                            & leq(X12,X10) ) )
                                    & ssList(X11) )
                                & ssItem(X10) )
                            | ~ totalorderedP(X2)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ? [X8] :
                                        ( ssItem(X8)
                                        & ? [X9] :
                                            ( leq(X6,X8)
                                            & app(cons(X8,nil),X9) = X2
                                            & ssList(X9) ) )
                                    & ssList(X7)
                                    & app(X7,cons(X6,nil)) = X4 ) ) ) )
                    | ( nil = X2
                      & nil != X3 )
                    | X0 != X2
                    | X1 != X3
                    | ~ ssList(X3)
                    | ! [X14] :
                        ( ~ memberP(X0,X14)
                        | ~ ssItem(X14)
                        | memberP(X1,X14) ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ! [X4] :
                      ( ssList(X4)
                     => ! [X5] :
                          ( ~ ssList(X5)
                          | app(app(X4,X2),X5) != X3
                          | ? [X10] :
                              ( ? [X11] :
                                  ( app(cons(X10,nil),X11) = X5
                                  & ? [X12] :
                                      ( ssItem(X12)
                                      & ? [X13] :
                                          ( ssList(X13)
                                          & app(X13,cons(X12,nil)) = X2
                                          & leq(X12,X10) ) )
                                  & ssList(X11) )
                              & ssItem(X10) )
                          | ~ totalorderedP(X2)
                          | ? [X6] :
                              ( ssItem(X6)
                              & ? [X7] :
                                  ( ? [X8] :
                                      ( ssItem(X8)
                                      & ? [X9] :
                                          ( leq(X6,X8)
                                          & app(cons(X8,nil),X9) = X2
                                          & ssList(X9) ) )
                                  & ssList(X7)
                                  & app(X7,cons(X6,nil)) = X4 ) ) ) )
                  | ( nil = X2
                    & nil != X3 )
                  | X0 != X2
                  | X1 != X3
                  | ~ ssList(X3)
                  | ! [X14] :
                      ( ~ memberP(X0,X14)
                      | ~ ssItem(X14)
                      | memberP(X1,X14) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f741,plain,
    ( ~ ssItem(sK16)
    | ~ spl19_7 ),
    inference(subsumption_resolution,[],[f738,f250]) ).

fof(f250,plain,
    ~ memberP(sK15,sK16),
    inference(definition_unfolding,[],[f246,f242]) ).

fof(f242,plain,
    sK13 = sK15,
    inference(cnf_transformation,[],[f175]) ).

fof(f246,plain,
    ~ memberP(sK13,sK16),
    inference(cnf_transformation,[],[f175]) ).

fof(f738,plain,
    ( memberP(sK15,sK16)
    | ~ ssItem(sK16)
    | ~ spl19_7 ),
    inference(resolution,[],[f544,f251]) ).

fof(f251,plain,
    memberP(sK14,sK16),
    inference(definition_unfolding,[],[f244,f241]) ).

fof(f241,plain,
    sK12 = sK14,
    inference(cnf_transformation,[],[f175]) ).

fof(f244,plain,
    memberP(sK12,sK16),
    inference(cnf_transformation,[],[f175]) ).

fof(f544,plain,
    ( ! [X1] :
        ( ~ memberP(sK14,X1)
        | ~ ssItem(X1)
        | memberP(sK15,X1) )
    | ~ spl19_7 ),
    inference(subsumption_resolution,[],[f543,f239]) ).

fof(f239,plain,
    ssList(sK17),
    inference(cnf_transformation,[],[f175]) ).

fof(f543,plain,
    ( ! [X1] :
        ( ~ ssItem(X1)
        | ~ ssList(sK17)
        | memberP(sK15,X1)
        | ~ memberP(sK14,X1) )
    | ~ spl19_7 ),
    inference(subsumption_resolution,[],[f539,f247]) ).

fof(f247,plain,
    ssList(sK14),
    inference(cnf_transformation,[],[f175]) ).

fof(f539,plain,
    ( ! [X1] :
        ( ~ ssList(sK14)
        | memberP(sK15,X1)
        | ~ ssList(sK17)
        | ~ ssItem(X1)
        | ~ memberP(sK14,X1) )
    | ~ spl19_7 ),
    inference(duplicate_literal_removal,[],[f536]) ).

fof(f536,plain,
    ( ! [X1] :
        ( ~ ssList(sK17)
        | ~ ssList(sK14)
        | memberP(sK15,X1)
        | ~ ssItem(X1)
        | ~ ssItem(X1)
        | ~ memberP(sK14,X1) )
    | ~ spl19_7 ),
    inference(resolution,[],[f534,f227]) ).

fof(f227,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X1,X2),X0)
      | ~ ssList(X1)
      | ~ memberP(X2,X0)
      | ~ ssItem(X0)
      | ~ ssList(X2) ),
    inference(cnf_transformation,[],[f164]) ).

fof(f164,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) ) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f163]) ).

fof(f163,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) ) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f123]) ).

fof(f123,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ! [X2] :
              ( ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) ) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f36,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).

fof(f534,plain,
    ( ! [X5] :
        ( ~ memberP(app(sK17,sK14),X5)
        | memberP(sK15,X5)
        | ~ ssItem(X5) )
    | ~ spl19_7 ),
    inference(subsumption_resolution,[],[f533,f238]) ).

fof(f238,plain,
    ssList(sK18),
    inference(cnf_transformation,[],[f175]) ).

fof(f533,plain,
    ( ! [X5] :
        ( ~ ssList(sK18)
        | memberP(sK15,X5)
        | ~ memberP(app(sK17,sK14),X5)
        | ~ ssItem(X5) )
    | ~ spl19_7 ),
    inference(subsumption_resolution,[],[f526,f336]) ).

fof(f336,plain,
    ( ssList(app(sK17,sK14))
    | ~ spl19_7 ),
    inference(avatar_component_clause,[],[f335]) ).

fof(f335,plain,
    ( spl19_7
  <=> ssList(app(sK17,sK14)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl19_7])]) ).

fof(f526,plain,
    ! [X5] :
      ( ~ ssItem(X5)
      | ~ ssList(app(sK17,sK14))
      | ~ ssList(sK18)
      | ~ memberP(app(sK17,sK14),X5)
      | memberP(sK15,X5) ),
    inference(superposition,[],[f228,f237]) ).

fof(f237,plain,
    app(app(sK17,sK14),sK18) = sK15,
    inference(cnf_transformation,[],[f175]) ).

fof(f228,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X1,X2),X0)
      | ~ ssItem(X0)
      | ~ ssList(X2)
      | ~ memberP(X1,X0)
      | ~ ssList(X1) ),
    inference(cnf_transformation,[],[f164]) ).

fof(f403,plain,
    spl19_7,
    inference(avatar_contradiction_clause,[],[f402]) ).

fof(f402,plain,
    ( $false
    | spl19_7 ),
    inference(subsumption_resolution,[],[f401,f247]) ).

fof(f401,plain,
    ( ~ ssList(sK14)
    | spl19_7 ),
    inference(subsumption_resolution,[],[f400,f239]) ).

fof(f400,plain,
    ( ~ ssList(sK17)
    | ~ ssList(sK14)
    | spl19_7 ),
    inference(resolution,[],[f337,f219]) ).

fof(f219,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f128]) ).

fof(f128,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ssList(app(X0,X1)) ) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).

fof(f337,plain,
    ( ~ ssList(app(sK17,sK14))
    | spl19_7 ),
    inference(avatar_component_clause,[],[f335]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SWC402+1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n002.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 19:06:14 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.46  % (24608)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.46  % (24616)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.47  % (24616)Instruction limit reached!
% 0.19/0.47  % (24616)------------------------------
% 0.19/0.47  % (24616)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (24608)Instruction limit reached!
% 0.19/0.48  % (24608)------------------------------
% 0.19/0.48  % (24608)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (24608)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (24608)Termination reason: Unknown
% 0.19/0.48  % (24608)Termination phase: Preprocessing 3
% 0.19/0.48  
% 0.19/0.48  % (24608)Memory used [KB]: 1663
% 0.19/0.48  % (24608)Time elapsed: 0.004 s
% 0.19/0.48  % (24608)Instructions burned: 4 (million)
% 0.19/0.48  % (24608)------------------------------
% 0.19/0.48  % (24608)------------------------------
% 0.19/0.48  % (24621)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.48  % (24616)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (24616)Termination reason: Unknown
% 0.19/0.48  % (24616)Termination phase: Saturation
% 0.19/0.48  
% 0.19/0.48  % (24616)Memory used [KB]: 6396
% 0.19/0.48  % (24616)Time elapsed: 0.091 s
% 0.19/0.48  % (24616)Instructions burned: 12 (million)
% 0.19/0.48  % (24616)------------------------------
% 0.19/0.48  % (24616)------------------------------
% 0.19/0.48  % (24629)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.49  % (24628)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.50  % (24625)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.50  % (24617)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50  % (24621)Instruction limit reached!
% 0.19/0.50  % (24621)------------------------------
% 0.19/0.50  % (24621)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (24621)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (24621)Termination reason: Unknown
% 0.19/0.50  % (24621)Termination phase: Function definition elimination
% 0.19/0.50  
% 0.19/0.50  % (24621)Memory used [KB]: 1791
% 0.19/0.50  % (24621)Time elapsed: 0.006 s
% 0.19/0.50  % (24621)Instructions burned: 8 (million)
% 0.19/0.50  % (24621)------------------------------
% 0.19/0.50  % (24621)------------------------------
% 0.19/0.50  % (24620)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50  % (24617)Instruction limit reached!
% 0.19/0.50  % (24617)------------------------------
% 0.19/0.50  % (24617)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (24612)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50  % (24620)Instruction limit reached!
% 0.19/0.50  % (24620)------------------------------
% 0.19/0.50  % (24620)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (24620)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (24620)Termination reason: Unknown
% 0.19/0.50  % (24620)Termination phase: Preprocessing 3
% 0.19/0.50  
% 0.19/0.50  % (24620)Memory used [KB]: 1663
% 0.19/0.50  % (24620)Time elapsed: 0.005 s
% 0.19/0.50  % (24620)Instructions burned: 4 (million)
% 0.19/0.50  % (24620)------------------------------
% 0.19/0.50  % (24620)------------------------------
% 0.19/0.50  % (24606)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.51  % (24625)Instruction limit reached!
% 0.19/0.51  % (24625)------------------------------
% 0.19/0.51  % (24625)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (24617)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (24617)Termination reason: Unknown
% 0.19/0.51  % (24617)Termination phase: Saturation
% 0.19/0.51  
% 0.19/0.51  % (24617)Memory used [KB]: 6140
% 0.19/0.51  % (24617)Time elapsed: 0.005 s
% 0.19/0.51  % (24617)Instructions burned: 7 (million)
% 0.19/0.51  % (24617)------------------------------
% 0.19/0.51  % (24617)------------------------------
% 0.19/0.51  % (24633)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.51  % (24625)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (24625)Termination reason: Unknown
% 0.19/0.51  % (24625)Termination phase: Saturation
% 0.19/0.51  
% 0.19/0.51  % (24625)Memory used [KB]: 6396
% 0.19/0.51  % (24625)Time elapsed: 0.113 s
% 0.19/0.51  % (24625)Instructions burned: 12 (million)
% 0.19/0.51  % (24625)------------------------------
% 0.19/0.51  % (24625)------------------------------
% 0.19/0.52  % (24607)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52  % (24610)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52  % (24609)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (24635)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.52  % (24631)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.52  % (24615)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.52  % (24613)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.52  % (24611)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.52  % (24618)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.52  % (24623)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52  % (24623)Instruction limit reached!
% 0.19/0.52  % (24623)------------------------------
% 0.19/0.52  % (24623)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (24632)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (24633)Instruction limit reached!
% 0.19/0.53  % (24633)------------------------------
% 0.19/0.53  % (24633)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (24633)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (24633)Termination reason: Unknown
% 0.19/0.53  % (24633)Termination phase: Saturation
% 0.19/0.53  
% 0.19/0.53  % (24633)Memory used [KB]: 6780
% 0.19/0.53  % (24633)Time elapsed: 0.133 s
% 0.19/0.53  % (24633)Instructions burned: 25 (million)
% 0.19/0.53  % (24633)------------------------------
% 0.19/0.53  % (24633)------------------------------
% 0.19/0.53  % (24630)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53  % (24627)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (24634)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53  % (24624)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53  % (24624)Instruction limit reached!
% 0.19/0.53  % (24624)------------------------------
% 0.19/0.53  % (24624)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (24624)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (24624)Termination reason: Unknown
% 0.19/0.53  % (24624)Termination phase: shuffling
% 0.19/0.53  
% 0.19/0.53  % (24624)Memory used [KB]: 1535
% 0.19/0.53  % (24624)Time elapsed: 0.002 s
% 0.19/0.53  % (24624)Instructions burned: 2 (million)
% 0.19/0.53  % (24624)------------------------------
% 0.19/0.53  % (24624)------------------------------
% 0.19/0.54  % (24614)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.54  % (24607)Instruction limit reached!
% 0.19/0.54  % (24607)------------------------------
% 0.19/0.54  % (24607)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (24607)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (24607)Termination reason: Unknown
% 0.19/0.54  % (24607)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (24607)Memory used [KB]: 6396
% 0.19/0.54  % (24607)Time elapsed: 0.143 s
% 0.19/0.54  % (24607)Instructions burned: 13 (million)
% 0.19/0.54  % (24607)------------------------------
% 0.19/0.54  % (24607)------------------------------
% 0.19/0.54  % (24619)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (24623)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (24623)Termination reason: Unknown
% 0.19/0.54  % (24623)Termination phase: Preprocessing 2
% 0.19/0.54  
% 0.19/0.54  % (24623)Memory used [KB]: 1535
% 0.19/0.54  % (24623)Time elapsed: 0.002 s
% 0.19/0.54  % (24623)Instructions burned: 3 (million)
% 0.19/0.54  % (24623)------------------------------
% 0.19/0.54  % (24623)------------------------------
% 0.19/0.54  % (24626)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.54  % (24622)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54  % (24610)Instruction limit reached!
% 0.19/0.54  % (24610)------------------------------
% 0.19/0.54  % (24610)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (24612)First to succeed.
% 0.19/0.55  % (24618)Instruction limit reached!
% 0.19/0.55  % (24618)------------------------------
% 0.19/0.55  % (24618)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (24618)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (24618)Termination reason: Unknown
% 0.19/0.55  % (24618)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (24618)Memory used [KB]: 2046
% 0.19/0.55  % (24618)Time elapsed: 0.151 s
% 0.19/0.55  % (24618)Instructions burned: 18 (million)
% 0.19/0.55  % (24618)------------------------------
% 0.19/0.55  % (24618)------------------------------
% 0.19/0.55  % (24611)Instruction limit reached!
% 0.19/0.55  % (24611)------------------------------
% 0.19/0.55  % (24611)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (24611)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (24611)Termination reason: Unknown
% 0.19/0.55  % (24611)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (24611)Memory used [KB]: 1791
% 0.19/0.55  % (24611)Time elapsed: 0.161 s
% 0.19/0.55  % (24611)Instructions burned: 16 (million)
% 0.19/0.55  % (24611)------------------------------
% 0.19/0.55  % (24611)------------------------------
% 0.19/0.55  % (24612)Refutation found. Thanks to Tanya!
% 0.19/0.55  % SZS status Theorem for theBenchmark
% 0.19/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.55  % (24612)------------------------------
% 0.19/0.55  % (24612)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (24612)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (24612)Termination reason: Refutation
% 0.19/0.55  
% 0.19/0.55  % (24612)Memory used [KB]: 6396
% 0.19/0.55  % (24612)Time elapsed: 0.113 s
% 0.19/0.55  % (24612)Instructions burned: 24 (million)
% 0.19/0.55  % (24612)------------------------------
% 0.19/0.55  % (24612)------------------------------
% 0.19/0.55  % (24601)Success in time 0.211 s
%------------------------------------------------------------------------------