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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC226+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 : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:39:44 EDT 2022

% Result   : Theorem 1.42s 0.57s
% Output   : Refutation 1.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   82 (   7 unt;   0 def)
%            Number of atoms       :  675 ( 186 equ)
%            Maximal formula atoms :   56 (   8 avg)
%            Number of connectives :  940 ( 347   ~; 332   |; 230   &)
%                                         (   4 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   5 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :  238 ( 162   !;  76   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f506,plain,
    $false,
    inference(avatar_sat_refutation,[],[f286,f287,f476,f488,f505]) ).

fof(f505,plain,
    ( ~ spl18_2
    | spl18_4
    | ~ spl18_7
    | ~ spl18_8 ),
    inference(avatar_contradiction_clause,[],[f504]) ).

fof(f504,plain,
    ( $false
    | ~ spl18_2
    | spl18_4
    | ~ spl18_7
    | ~ spl18_8 ),
    inference(subsumption_resolution,[],[f500,f475]) ).

fof(f475,plain,
    ( ssItem(sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ spl18_8 ),
    inference(avatar_component_clause,[],[f473]) ).

fof(f473,plain,
    ( spl18_8
  <=> ssItem(sK11(sK5(sK6),nil,sK4(sK6))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_8])]) ).

fof(f500,plain,
    ( ~ ssItem(sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ spl18_2
    | spl18_4
    | ~ spl18_7 ),
    inference(resolution,[],[f499,f227]) ).

fof(f227,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f105]) ).

fof(f105,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).

fof(f499,plain,
    ( memberP(nil,sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ spl18_2
    | spl18_4
    | ~ spl18_7 ),
    inference(subsumption_resolution,[],[f498,f280]) ).

fof(f280,plain,
    ( nil != sK6
    | spl18_4 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f278,plain,
    ( spl18_4
  <=> nil = sK6 ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_4])]) ).

fof(f498,plain,
    ( nil = sK6
    | memberP(nil,sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ spl18_2
    | ~ spl18_7 ),
    inference(subsumption_resolution,[],[f497,f470]) ).

fof(f470,plain,
    ( ssList(cons(sK5(sK6),nil))
    | ~ spl18_7 ),
    inference(avatar_component_clause,[],[f469]) ).

fof(f469,plain,
    ( spl18_7
  <=> ssList(cons(sK5(sK6),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_7])]) ).

fof(f497,plain,
    ( memberP(nil,sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ ssList(cons(sK5(sK6),nil))
    | nil = sK6
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f496,f199]) ).

fof(f199,plain,
    ssList(sK6),
    inference(cnf_transformation,[],[f160]) ).

fof(f160,plain,
    ( ssList(sK7)
    & nil != sK6
    & ssList(sK9)
    & ! [X5] :
        ( ~ ssItem(X5)
        | ! [X6] :
            ( ! [X7] :
                ( ! [X8] :
                    ( ~ ssList(X8)
                    | sK8 != app(X8,cons(X7,nil))
                    | ~ leq(X7,X5) )
                | ~ ssItem(X7) )
            | ~ ssList(X6)
            | app(cons(X5,nil),X6) != sK10 ) )
    & totalorderedP(sK8)
    & app(sK8,sK10) = sK9
    & ssList(sK10)
    & sK8 = sK6
    & sK7 = sK9
    & ( nil = sK9
      | nil != sK8 )
    & ! [X9] :
        ( ~ ssItem(X9)
        | ! [X10] :
            ( ! [X11] :
                ( ~ ssList(X11)
                | ( memberP(X10,sK11(X9,X10,X11))
                  & memberP(X11,sK11(X9,X10,X11))
                  & ssItem(sK11(X9,X10,X11))
                  & leq(X9,sK11(X9,X10,X11))
                  & ~ leq(sK11(X9,X10,X11),X9) )
                | app(app(X10,cons(X9,nil)),X11) != sK6 )
            | ~ ssList(X10) ) )
    & ssList(sK8)
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f153,f159,f158,f157,f156,f155,f154]) ).

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

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

fof(f156,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( nil != sK6
            & ssList(X3)
            & ? [X4] :
                ( ! [X5] :
                    ( ~ ssItem(X5)
                    | ! [X6] :
                        ( ! [X7] :
                            ( ! [X8] :
                                ( ~ ssList(X8)
                                | app(X8,cons(X7,nil)) != X2
                                | ~ leq(X7,X5) )
                            | ~ ssItem(X7) )
                        | ~ ssList(X6)
                        | app(cons(X5,nil),X6) != X4 ) )
                & totalorderedP(X2)
                & app(X2,X4) = X3
                & ssList(X4) )
            & sK6 = X2
            & sK7 = X3
            & ( nil = X3
              | nil != X2 )
            & ! [X9] :
                ( ~ ssItem(X9)
                | ! [X10] :
                    ( ! [X11] :
                        ( ~ ssList(X11)
                        | ? [X12] :
                            ( memberP(X10,X12)
                            & memberP(X11,X12)
                            & ssItem(X12)
                            & leq(X9,X12)
                            & ~ leq(X12,X9) )
                        | app(app(X10,cons(X9,nil)),X11) != sK6 )
                    | ~ ssList(X10) ) ) )
        & ssList(X2) )
   => ( ? [X3] :
          ( nil != sK6
          & ssList(X3)
          & ? [X4] :
              ( ! [X5] :
                  ( ~ ssItem(X5)
                  | ! [X6] :
                      ( ! [X7] :
                          ( ! [X8] :
                              ( ~ ssList(X8)
                              | sK8 != app(X8,cons(X7,nil))
                              | ~ leq(X7,X5) )
                          | ~ ssItem(X7) )
                      | ~ ssList(X6)
                      | app(cons(X5,nil),X6) != X4 ) )
              & totalorderedP(sK8)
              & app(sK8,X4) = X3
              & ssList(X4) )
          & sK8 = sK6
          & sK7 = X3
          & ( nil = X3
            | nil != sK8 )
          & ! [X9] :
              ( ~ ssItem(X9)
              | ! [X10] :
                  ( ! [X11] :
                      ( ~ ssList(X11)
                      | ? [X12] :
                          ( memberP(X10,X12)
                          & memberP(X11,X12)
                          & ssItem(X12)
                          & leq(X9,X12)
                          & ~ leq(X12,X9) )
                      | app(app(X10,cons(X9,nil)),X11) != sK6 )
                  | ~ ssList(X10) ) ) )
      & ssList(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f157,plain,
    ( ? [X3] :
        ( nil != sK6
        & ssList(X3)
        & ? [X4] :
            ( ! [X5] :
                ( ~ ssItem(X5)
                | ! [X6] :
                    ( ! [X7] :
                        ( ! [X8] :
                            ( ~ ssList(X8)
                            | sK8 != app(X8,cons(X7,nil))
                            | ~ leq(X7,X5) )
                        | ~ ssItem(X7) )
                    | ~ ssList(X6)
                    | app(cons(X5,nil),X6) != X4 ) )
            & totalorderedP(sK8)
            & app(sK8,X4) = X3
            & ssList(X4) )
        & sK8 = sK6
        & sK7 = X3
        & ( nil = X3
          | nil != sK8 )
        & ! [X9] :
            ( ~ ssItem(X9)
            | ! [X10] :
                ( ! [X11] :
                    ( ~ ssList(X11)
                    | ? [X12] :
                        ( memberP(X10,X12)
                        & memberP(X11,X12)
                        & ssItem(X12)
                        & leq(X9,X12)
                        & ~ leq(X12,X9) )
                    | app(app(X10,cons(X9,nil)),X11) != sK6 )
                | ~ ssList(X10) ) ) )
   => ( nil != sK6
      & ssList(sK9)
      & ? [X4] :
          ( ! [X5] :
              ( ~ ssItem(X5)
              | ! [X6] :
                  ( ! [X7] :
                      ( ! [X8] :
                          ( ~ ssList(X8)
                          | sK8 != app(X8,cons(X7,nil))
                          | ~ leq(X7,X5) )
                      | ~ ssItem(X7) )
                  | ~ ssList(X6)
                  | app(cons(X5,nil),X6) != X4 ) )
          & totalorderedP(sK8)
          & app(sK8,X4) = sK9
          & ssList(X4) )
      & sK8 = sK6
      & sK7 = sK9
      & ( nil = sK9
        | nil != sK8 )
      & ! [X9] :
          ( ~ ssItem(X9)
          | ! [X10] :
              ( ! [X11] :
                  ( ~ ssList(X11)
                  | ? [X12] :
                      ( memberP(X10,X12)
                      & memberP(X11,X12)
                      & ssItem(X12)
                      & leq(X9,X12)
                      & ~ leq(X12,X9) )
                  | app(app(X10,cons(X9,nil)),X11) != sK6 )
              | ~ ssList(X10) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f158,plain,
    ( ? [X4] :
        ( ! [X5] :
            ( ~ ssItem(X5)
            | ! [X6] :
                ( ! [X7] :
                    ( ! [X8] :
                        ( ~ ssList(X8)
                        | sK8 != app(X8,cons(X7,nil))
                        | ~ leq(X7,X5) )
                    | ~ ssItem(X7) )
                | ~ ssList(X6)
                | app(cons(X5,nil),X6) != X4 ) )
        & totalorderedP(sK8)
        & app(sK8,X4) = sK9
        & ssList(X4) )
   => ( ! [X5] :
          ( ~ ssItem(X5)
          | ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ~ ssList(X8)
                      | sK8 != app(X8,cons(X7,nil))
                      | ~ leq(X7,X5) )
                  | ~ ssItem(X7) )
              | ~ ssList(X6)
              | app(cons(X5,nil),X6) != sK10 ) )
      & totalorderedP(sK8)
      & app(sK8,sK10) = sK9
      & ssList(sK10) ) ),
    introduced(choice_axiom,[]) ).

fof(f159,plain,
    ! [X9,X10,X11] :
      ( ? [X12] :
          ( memberP(X10,X12)
          & memberP(X11,X12)
          & ssItem(X12)
          & leq(X9,X12)
          & ~ leq(X12,X9) )
     => ( memberP(X10,sK11(X9,X10,X11))
        & memberP(X11,sK11(X9,X10,X11))
        & ssItem(sK11(X9,X10,X11))
        & leq(X9,sK11(X9,X10,X11))
        & ~ leq(sK11(X9,X10,X11),X9) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f496,plain,
    ( ~ ssList(sK6)
    | memberP(nil,sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ ssList(cons(sK5(sK6),nil))
    | nil = sK6
    | ~ spl18_2 ),
    inference(equality_resolution,[],[f462]) ).

fof(f462,plain,
    ( ! [X0] :
        ( sK6 != X0
        | ~ ssList(X0)
        | memberP(nil,sK11(sK5(X0),nil,sK4(X0)))
        | nil = X0
        | ~ ssList(cons(sK5(X0),nil)) )
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f461,f186]) ).

fof(f186,plain,
    ! [X0] :
      ( ssItem(sK5(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f148]) ).

fof(f148,plain,
    ! [X0] :
      ( nil = X0
      | ( ssList(sK4(X0))
        & ssItem(sK5(X0))
        & cons(sK5(X0),sK4(X0)) = X0 )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f133,f147,f146]) ).

fof(f146,plain,
    ! [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssItem(X2)
              & cons(X2,X1) = X0 ) )
     => ( ssList(sK4(X0))
        & ? [X2] :
            ( ssItem(X2)
            & cons(X2,sK4(X0)) = X0 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f147,plain,
    ! [X0] :
      ( ? [X2] :
          ( ssItem(X2)
          & cons(X2,sK4(X0)) = X0 )
     => ( ssItem(sK5(X0))
        & cons(sK5(X0),sK4(X0)) = X0 ) ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ! [X0] :
      ( nil = X0
      | ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssItem(X2)
              & cons(X2,X1) = X0 ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f132]) ).

fof(f132,plain,
    ! [X0] :
      ( nil = X0
      | ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssItem(X2)
              & cons(X2,X1) = X0 ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f20,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil = X0
        | ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ssItem(X2)
                & cons(X2,X1) = X0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).

fof(f461,plain,
    ( ! [X0] :
        ( nil = X0
        | ~ ssList(X0)
        | ~ ssItem(sK5(X0))
        | sK6 != X0
        | ~ ssList(cons(sK5(X0),nil))
        | memberP(nil,sK11(sK5(X0),nil,sK4(X0))) )
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f459,f187]) ).

fof(f187,plain,
    ! [X0] :
      ( ssList(sK4(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f148]) ).

fof(f459,plain,
    ( ! [X0] :
        ( ~ ssList(cons(sK5(X0),nil))
        | nil = X0
        | ~ ssList(X0)
        | ~ ssList(sK4(X0))
        | sK6 != X0
        | memberP(nil,sK11(sK5(X0),nil,sK4(X0)))
        | ~ ssItem(sK5(X0)) )
    | ~ spl18_2 ),
    inference(superposition,[],[f427,f185]) ).

fof(f185,plain,
    ! [X0] :
      ( cons(sK5(X0),sK4(X0)) = X0
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f148]) ).

fof(f427,plain,
    ( ! [X12,X13] :
        ( cons(X12,X13) != sK6
        | ~ ssList(X13)
        | ~ ssItem(X12)
        | ~ ssList(cons(X12,nil))
        | memberP(nil,sK11(X12,nil,X13)) )
    | ~ spl18_2 ),
    inference(duplicate_literal_removal,[],[f406]) ).

fof(f406,plain,
    ( ! [X12,X13] :
        ( ~ ssList(cons(X12,nil))
        | ~ ssItem(X12)
        | ~ ssList(X13)
        | cons(X12,X13) != sK6
        | ~ ssItem(X12)
        | memberP(nil,sK11(X12,nil,X13))
        | ~ ssList(X13) )
    | ~ spl18_2 ),
    inference(superposition,[],[f310,f241]) ).

fof(f241,plain,
    ! [X0,X1] :
      ( cons(X1,X0) = app(cons(X1,nil),X0)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f120]) ).

fof(f120,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) = app(cons(X1,nil),X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f81]) ).

fof(f81,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) = app(cons(X1,nil),X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).

fof(f310,plain,
    ( ! [X0,X1] :
        ( app(cons(X0,nil),X1) != sK6
        | ~ ssList(X1)
        | ~ ssList(cons(X0,nil))
        | ~ ssItem(X0)
        | memberP(nil,sK11(X0,nil,X1)) )
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f301,f270]) ).

fof(f270,plain,
    ( ssList(nil)
    | ~ spl18_2 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f269,plain,
    ( spl18_2
  <=> ssList(nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_2])]) ).

fof(f301,plain,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | ~ ssItem(X0)
      | ~ ssList(nil)
      | ~ ssList(cons(X0,nil))
      | memberP(nil,sK11(X0,nil,X1))
      | app(cons(X0,nil),X1) != sK6 ),
    inference(superposition,[],[f205,f229]) ).

fof(f229,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f107,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f28,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(nil,X0) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).

fof(f205,plain,
    ! [X10,X11,X9] :
      ( app(app(X10,cons(X9,nil)),X11) != sK6
      | ~ ssList(X10)
      | memberP(X10,sK11(X9,X10,X11))
      | ~ ssItem(X9)
      | ~ ssList(X11) ),
    inference(cnf_transformation,[],[f160]) ).

fof(f488,plain,
    ( ~ spl18_2
    | spl18_4
    | spl18_7 ),
    inference(avatar_contradiction_clause,[],[f487]) ).

fof(f487,plain,
    ( $false
    | ~ spl18_2
    | spl18_4
    | spl18_7 ),
    inference(subsumption_resolution,[],[f486,f280]) ).

fof(f486,plain,
    ( nil = sK6
    | ~ spl18_2
    | spl18_7 ),
    inference(subsumption_resolution,[],[f482,f199]) ).

fof(f482,plain,
    ( ~ ssList(sK6)
    | nil = sK6
    | ~ spl18_2
    | spl18_7 ),
    inference(resolution,[],[f481,f186]) ).

fof(f481,plain,
    ( ~ ssItem(sK5(sK6))
    | ~ spl18_2
    | spl18_7 ),
    inference(subsumption_resolution,[],[f477,f270]) ).

fof(f477,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sK5(sK6))
    | spl18_7 ),
    inference(resolution,[],[f471,f246]) ).

fof(f246,plain,
    ! [X0,X1] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) ) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ssList(cons(X1,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).

fof(f471,plain,
    ( ~ ssList(cons(sK5(sK6),nil))
    | spl18_7 ),
    inference(avatar_component_clause,[],[f469]) ).

fof(f476,plain,
    ( ~ spl18_7
    | spl18_8
    | ~ spl18_2
    | spl18_4 ),
    inference(avatar_split_clause,[],[f467,f278,f269,f473,f469]) ).

fof(f467,plain,
    ( ssItem(sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ ssList(cons(sK5(sK6),nil))
    | ~ spl18_2
    | spl18_4 ),
    inference(subsumption_resolution,[],[f466,f280]) ).

fof(f466,plain,
    ( ~ ssList(cons(sK5(sK6),nil))
    | nil = sK6
    | ssItem(sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f465,f199]) ).

fof(f465,plain,
    ( ~ ssList(cons(sK5(sK6),nil))
    | ~ ssList(sK6)
    | nil = sK6
    | ssItem(sK11(sK5(sK6),nil,sK4(sK6)))
    | ~ spl18_2 ),
    inference(equality_resolution,[],[f438]) ).

fof(f438,plain,
    ( ! [X0] :
        ( sK6 != X0
        | nil = X0
        | ~ ssList(X0)
        | ssItem(sK11(sK5(X0),nil,sK4(X0)))
        | ~ ssList(cons(sK5(X0),nil)) )
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f437,f187]) ).

fof(f437,plain,
    ( ! [X0] :
        ( nil = X0
        | sK6 != X0
        | ~ ssList(sK4(X0))
        | ~ ssList(cons(sK5(X0),nil))
        | ssItem(sK11(sK5(X0),nil,sK4(X0)))
        | ~ ssList(X0) )
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f435,f186]) ).

fof(f435,plain,
    ( ! [X0] :
        ( nil = X0
        | ~ ssList(cons(sK5(X0),nil))
        | sK6 != X0
        | ~ ssItem(sK5(X0))
        | ssItem(sK11(sK5(X0),nil,sK4(X0)))
        | ~ ssList(sK4(X0))
        | ~ ssList(X0) )
    | ~ spl18_2 ),
    inference(superposition,[],[f422,f185]) ).

fof(f422,plain,
    ( ! [X8,X9] :
        ( cons(X8,X9) != sK6
        | ~ ssList(X9)
        | ssItem(sK11(X8,nil,X9))
        | ~ ssItem(X8)
        | ~ ssList(cons(X8,nil)) )
    | ~ spl18_2 ),
    inference(duplicate_literal_removal,[],[f404]) ).

fof(f404,plain,
    ( ! [X8,X9] :
        ( ~ ssList(X9)
        | ~ ssList(X9)
        | ssItem(sK11(X8,nil,X9))
        | ~ ssList(cons(X8,nil))
        | cons(X8,X9) != sK6
        | ~ ssItem(X8)
        | ~ ssItem(X8) )
    | ~ spl18_2 ),
    inference(superposition,[],[f308,f241]) ).

fof(f308,plain,
    ( ! [X8,X9] :
        ( app(cons(X8,nil),X9) != sK6
        | ~ ssList(cons(X8,nil))
        | ~ ssList(X9)
        | ~ ssItem(X8)
        | ssItem(sK11(X8,nil,X9)) )
    | ~ spl18_2 ),
    inference(subsumption_resolution,[],[f305,f270]) ).

fof(f305,plain,
    ! [X8,X9] :
      ( ~ ssList(X9)
      | ~ ssItem(X8)
      | ssItem(sK11(X8,nil,X9))
      | ~ ssList(nil)
      | app(cons(X8,nil),X9) != sK6
      | ~ ssList(cons(X8,nil)) ),
    inference(superposition,[],[f203,f229]) ).

fof(f203,plain,
    ! [X10,X11,X9] :
      ( app(app(X10,cons(X9,nil)),X11) != sK6
      | ~ ssList(X11)
      | ~ ssList(X10)
      | ssItem(sK11(X9,X10,X11))
      | ~ ssItem(X9) ),
    inference(cnf_transformation,[],[f160]) ).

fof(f287,plain,
    spl18_2,
    inference(avatar_split_clause,[],[f239,f269]) ).

fof(f239,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f286,plain,
    ~ spl18_4,
    inference(avatar_split_clause,[],[f214,f278]) ).

fof(f214,plain,
    nil != sK6,
    inference(cnf_transformation,[],[f160]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC226+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % 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.34  % Computer : n015.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 18:48:21 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (11739)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)
% 1.25/0.51  % (11741)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)
% 1.25/0.52  % (11755)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)
% 1.25/0.52  % (11733)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)
% 1.25/0.52  % (11754)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)
% 1.25/0.52  % (11747)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)
% 1.25/0.52  % (11746)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)
% 1.25/0.52  % (11746)Instruction limit reached!
% 1.25/0.52  % (11746)------------------------------
% 1.25/0.52  % (11746)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.25/0.52  % (11746)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.25/0.52  % (11746)Termination reason: Unknown
% 1.25/0.52  % (11746)Termination phase: Naming
% 1.25/0.52  
% 1.25/0.52  % (11746)Memory used [KB]: 1535
% 1.25/0.52  % (11746)Time elapsed: 0.005 s
% 1.25/0.52  % (11746)Instructions burned: 3 (million)
% 1.25/0.52  % (11746)------------------------------
% 1.25/0.52  % (11746)------------------------------
% 1.25/0.52  % (11732)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.25/0.52  % (11736)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)
% 1.25/0.53  % (11738)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)
% 1.25/0.53  % (11750)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)
% 1.25/0.53  % (11760)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)
% 1.25/0.53  % (11759)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)
% 1.25/0.53  % (11740)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)
% 1.25/0.53  % (11749)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.25/0.53  % (11735)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)
% 1.25/0.53  % (11749)Instruction limit reached!
% 1.25/0.53  % (11749)------------------------------
% 1.25/0.53  % (11749)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.25/0.53  % (11734)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)
% 1.42/0.53  % (11758)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)
% 1.42/0.53  % (11761)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)
% 1.42/0.53  % (11747)Instruction limit reached!
% 1.42/0.53  % (11747)------------------------------
% 1.42/0.53  % (11747)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.53  % (11750)Instruction limit reached!
% 1.42/0.53  % (11750)------------------------------
% 1.42/0.53  % (11750)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.53  % (11750)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.53  % (11750)Termination reason: Unknown
% 1.42/0.53  % (11750)Termination phase: Preprocessing 3
% 1.42/0.53  
% 1.42/0.53  % (11750)Memory used [KB]: 1535
% 1.42/0.53  % (11750)Time elapsed: 0.004 s
% 1.42/0.53  % (11750)Instructions burned: 3 (million)
% 1.42/0.53  % (11750)------------------------------
% 1.42/0.53  % (11750)------------------------------
% 1.42/0.53  % (11751)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)
% 1.42/0.53  % (11742)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)
% 1.42/0.53  % (11753)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)
% 1.42/0.53  % (11737)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)
% 1.42/0.54  % (11749)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54  % (11749)Termination reason: Unknown
% 1.42/0.54  % (11749)Termination phase: Preprocessing 3
% 1.42/0.54  
% 1.42/0.54  % (11749)Memory used [KB]: 1663
% 1.42/0.54  % (11749)Time elapsed: 0.004 s
% 1.42/0.54  % (11749)Instructions burned: 4 (million)
% 1.42/0.54  % (11749)------------------------------
% 1.42/0.54  % (11749)------------------------------
% 1.42/0.54  % (11734)Instruction limit reached!
% 1.42/0.54  % (11734)------------------------------
% 1.42/0.54  % (11734)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.54  % (11734)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54  % (11734)Termination reason: Unknown
% 1.42/0.54  % (11734)Termination phase: Preprocessing 3
% 1.42/0.54  
% 1.42/0.54  % (11734)Memory used [KB]: 1663
% 1.42/0.54  % (11734)Time elapsed: 0.004 s
% 1.42/0.54  % (11734)Instructions burned: 4 (million)
% 1.42/0.54  % (11734)------------------------------
% 1.42/0.54  % (11734)------------------------------
% 1.42/0.54  % (11733)Instruction limit reached!
% 1.42/0.54  % (11733)------------------------------
% 1.42/0.54  % (11733)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.54  % (11733)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54  % (11733)Termination reason: Unknown
% 1.42/0.54  % (11733)Termination phase: Saturation
% 1.42/0.54  
% 1.42/0.54  % (11733)Memory used [KB]: 6396
% 1.42/0.54  % (11733)Time elapsed: 0.132 s
% 1.42/0.54  % (11733)Instructions burned: 14 (million)
% 1.42/0.54  % (11733)------------------------------
% 1.42/0.54  % (11733)------------------------------
% 1.42/0.54  % (11752)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)
% 1.42/0.54  % (11745)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)
% 1.42/0.54  % (11743)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)
% 1.42/0.54  % (11756)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)
% 1.42/0.54  % (11747)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54  % (11747)Termination reason: Unknown
% 1.42/0.54  % (11747)Termination phase: Function definition elimination
% 1.42/0.54  
% 1.42/0.54  % (11747)Memory used [KB]: 1791
% 1.42/0.54  % (11747)Time elapsed: 0.008 s
% 1.42/0.54  % (11747)Instructions burned: 8 (million)
% 1.42/0.54  % (11747)------------------------------
% 1.42/0.54  % (11747)------------------------------
% 1.42/0.54  % (11738)First to succeed.
% 1.42/0.55  % (11744)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)
% 1.42/0.55  % (11742)Instruction limit reached!
% 1.42/0.55  % (11742)------------------------------
% 1.42/0.55  % (11742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.55  % (11742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.55  % (11742)Termination reason: Unknown
% 1.42/0.55  % (11742)Termination phase: Saturation
% 1.42/0.55  
% 1.42/0.55  % (11742)Memory used [KB]: 6268
% 1.42/0.55  % (11742)Time elapsed: 0.150 s
% 1.42/0.55  % (11742)Instructions burned: 13 (million)
% 1.42/0.55  % (11742)------------------------------
% 1.42/0.55  % (11742)------------------------------
% 1.42/0.55  % (11737)Instruction limit reached!
% 1.42/0.55  % (11737)------------------------------
% 1.42/0.55  % (11737)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.55  % (11737)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.55  % (11737)Termination reason: Unknown
% 1.42/0.55  % (11737)Termination phase: Saturation
% 1.42/0.55  
% 1.42/0.55  % (11737)Memory used [KB]: 1791
% 1.42/0.55  % (11737)Time elapsed: 0.148 s
% 1.42/0.55  % (11737)Instructions burned: 15 (million)
% 1.42/0.55  % (11737)------------------------------
% 1.42/0.55  % (11737)------------------------------
% 1.42/0.55  % (11757)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)
% 1.42/0.55  % (11760)Instruction limit reached!
% 1.42/0.55  % (11760)------------------------------
% 1.42/0.55  % (11760)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.55  % (11760)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.55  % (11760)Termination reason: Unknown
% 1.42/0.55  % (11760)Termination phase: Function definition elimination
% 1.42/0.55  
% 1.42/0.55  % (11760)Memory used [KB]: 1791
% 1.42/0.55  % (11760)Time elapsed: 0.006 s
% 1.42/0.55  % (11760)Instructions burned: 8 (million)
% 1.42/0.55  % (11760)------------------------------
% 1.42/0.55  % (11760)------------------------------
% 1.42/0.55  % (11736)Instruction limit reached!
% 1.42/0.55  % (11736)------------------------------
% 1.42/0.55  % (11736)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.55  % (11736)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.55  % (11736)Termination reason: Unknown
% 1.42/0.55  % (11736)Termination phase: Saturation
% 1.42/0.55  
% 1.42/0.55  % (11736)Memory used [KB]: 6268
% 1.42/0.55  % (11736)Time elapsed: 0.155 s
% 1.42/0.55  % (11736)Instructions burned: 13 (million)
% 1.42/0.55  % (11736)------------------------------
% 1.42/0.55  % (11736)------------------------------
% 1.42/0.56  % (11748)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)
% 1.42/0.56  % (11741)Instruction limit reached!
% 1.42/0.56  % (11741)------------------------------
% 1.42/0.56  % (11741)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.56  % (11741)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.56  % (11741)Termination reason: Unknown
% 1.42/0.56  % (11741)Termination phase: Saturation
% 1.42/0.56  
% 1.42/0.56  % (11741)Memory used [KB]: 6780
% 1.42/0.56  % (11741)Time elapsed: 0.158 s
% 1.42/0.56  % (11741)Instructions burned: 33 (million)
% 1.42/0.56  % (11741)------------------------------
% 1.42/0.56  % (11741)------------------------------
% 1.42/0.56  % (11751)Instruction limit reached!
% 1.42/0.56  % (11751)------------------------------
% 1.42/0.56  % (11751)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.56  % (11751)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.56  % (11751)Termination reason: Unknown
% 1.42/0.56  % (11751)Termination phase: Saturation
% 1.42/0.56  
% 1.42/0.56  % (11751)Memory used [KB]: 6396
% 1.42/0.56  % (11751)Time elapsed: 0.158 s
% 1.42/0.56  % (11751)Instructions burned: 11 (million)
% 1.42/0.56  % (11751)------------------------------
% 1.42/0.56  % (11751)------------------------------
% 1.42/0.56  % (11743)Instruction limit reached!
% 1.42/0.56  % (11743)------------------------------
% 1.42/0.56  % (11743)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.56  % (11743)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.56  % (11743)Termination reason: Unknown
% 1.42/0.56  % (11743)Termination phase: Saturation
% 1.42/0.56  
% 1.42/0.56  % (11743)Memory used [KB]: 6140
% 1.42/0.56  % (11743)Time elapsed: 0.147 s
% 1.42/0.56  % (11743)Instructions burned: 8 (million)
% 1.42/0.56  % (11743)------------------------------
% 1.42/0.56  % (11743)------------------------------
% 1.42/0.56  % (11739)Refutation not found, non-redundant clauses discarded% (11739)------------------------------
% 1.42/0.56  % (11739)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.57  % (11738)Refutation found. Thanks to Tanya!
% 1.42/0.57  % SZS status Theorem for theBenchmark
% 1.42/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 1.42/0.57  % (11738)------------------------------
% 1.42/0.57  % (11738)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.57  % (11738)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.57  % (11738)Termination reason: Refutation
% 1.42/0.57  
% 1.42/0.57  % (11738)Memory used [KB]: 6396
% 1.42/0.57  % (11738)Time elapsed: 0.095 s
% 1.42/0.57  % (11738)Instructions burned: 16 (million)
% 1.42/0.57  % (11738)------------------------------
% 1.42/0.57  % (11738)------------------------------
% 1.42/0.57  % (11731)Success in time 0.207 s
%------------------------------------------------------------------------------