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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC233+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 : n025.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:46 EDT 2022

% Result   : Theorem 2.16s 0.60s
% Output   : Refutation 2.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   83 (   8 unt;   0 def)
%            Number of atoms       :  638 ( 129 equ)
%            Maximal formula atoms :   50 (   7 avg)
%            Number of connectives :  892 ( 337   ~; 324   |; 199   &)
%                                         (   3 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   4 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :  234 ( 163   !;  71   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f414,plain,
    $false,
    inference(avatar_sat_refutation,[],[f248,f394,f400,f413]) ).

fof(f413,plain,
    ( ~ spl11_2
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(avatar_contradiction_clause,[],[f412]) ).

fof(f412,plain,
    ( $false
    | ~ spl11_2
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f411,f393]) ).

fof(f393,plain,
    ( ssItem(sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ spl11_4 ),
    inference(avatar_component_clause,[],[f391]) ).

fof(f391,plain,
    ( spl11_4
  <=> ssItem(sK8(sK1(sK6),nil,sK0(sK6))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).

fof(f411,plain,
    ( ~ ssItem(sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ spl11_2
    | ~ spl11_3 ),
    inference(resolution,[],[f407,f203]) ).

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

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

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

fof(f407,plain,
    ( memberP(nil,sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ spl11_2
    | ~ spl11_3 ),
    inference(subsumption_resolution,[],[f406,f198]) ).

fof(f198,plain,
    ssList(sK6),
    inference(cnf_transformation,[],[f154]) ).

fof(f154,plain,
    ( ssList(sK5)
    & ssList(sK6)
    & sK4 = sK6
    & ssList(sK7)
    & ! [X4] :
        ( ~ ssItem(X4)
        | ! [X5] :
            ( ! [X6] :
                ( ~ ssList(X6)
                | app(app(X5,cons(X4,nil)),X6) != sK4
                | ( ssItem(sK8(X4,X5,X6))
                  & ~ lt(X4,sK8(X4,X5,X6))
                  & leq(X4,sK8(X4,X5,X6))
                  & memberP(X6,sK8(X4,X5,X6))
                  & memberP(X5,sK8(X4,X5,X6)) ) )
            | ~ ssList(X5) ) )
    & sK7 = sK5
    & ! [X8] :
        ( ~ ssItem(X8)
        | ! [X9] :
            ( ~ ssList(X9)
            | ! [X10] :
                ( ! [X11] :
                    ( ~ ssItem(X11)
                    | ( ( lt(X11,X8)
                        | ~ memberP(X9,X11) )
                      & ( lt(X8,X11)
                        | ~ memberP(X10,X11) ) ) )
                | ~ ssList(X10)
                | app(app(X9,cons(X8,nil)),X10) != sK6 ) ) )
    & nil != sK4
    & ssList(sK4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8])],[f148,f153,f152,f151,f150,f149]) ).

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

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

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

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

fof(f153,plain,
    ! [X4,X5,X6] :
      ( ? [X7] :
          ( ssItem(X7)
          & ~ lt(X4,X7)
          & leq(X4,X7)
          & memberP(X6,X7)
          & memberP(X5,X7) )
     => ( ssItem(sK8(X4,X5,X6))
        & ~ lt(X4,sK8(X4,X5,X6))
        & leq(X4,sK8(X4,X5,X6))
        & memberP(X6,sK8(X4,X5,X6))
        & memberP(X5,sK8(X4,X5,X6)) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

fof(f406,plain,
    ( memberP(nil,sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ ssList(sK6)
    | ~ spl11_2
    | ~ spl11_3 ),
    inference(subsumption_resolution,[],[f405,f229]) ).

fof(f229,plain,
    nil != sK6,
    inference(definition_unfolding,[],[f187,f197]) ).

fof(f197,plain,
    sK4 = sK6,
    inference(cnf_transformation,[],[f154]) ).

fof(f187,plain,
    nil != sK4,
    inference(cnf_transformation,[],[f154]) ).

fof(f405,plain,
    ( nil = sK6
    | memberP(nil,sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ ssList(sK6)
    | ~ spl11_2
    | ~ spl11_3 ),
    inference(subsumption_resolution,[],[f404,f388]) ).

fof(f388,plain,
    ( ssList(cons(sK1(sK6),nil))
    | ~ spl11_3 ),
    inference(avatar_component_clause,[],[f387]) ).

fof(f387,plain,
    ( spl11_3
  <=> ssList(cons(sK1(sK6),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).

fof(f404,plain,
    ( memberP(nil,sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ ssList(cons(sK1(sK6),nil))
    | nil = sK6
    | ~ ssList(sK6)
    | ~ spl11_2 ),
    inference(equality_resolution,[],[f379]) ).

fof(f379,plain,
    ( ! [X0] :
        ( sK6 != X0
        | memberP(nil,sK8(sK1(X0),nil,sK0(X0)))
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f378,f169]) ).

fof(f169,plain,
    ! [X0] :
      ( ssItem(sK1(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f140]) ).

fof(f140,plain,
    ! [X0] :
      ( ( ssItem(sK1(X0))
        & cons(sK1(X0),sK0(X0)) = X0
        & ssList(sK0(X0)) )
      | ~ ssList(X0)
      | nil = X0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f136,f139,f138]) ).

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

fof(f139,plain,
    ! [X0] :
      ( ? [X2] :
          ( ssItem(X2)
          & cons(X2,sK0(X0)) = X0 )
     => ( ssItem(sK1(X0))
        & cons(sK1(X0),sK0(X0)) = X0 ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f378,plain,
    ( ! [X0] :
        ( nil = X0
        | sK6 != X0
        | ~ ssList(X0)
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssItem(sK1(X0))
        | memberP(nil,sK8(sK1(X0),nil,sK0(X0))) )
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f377,f167]) ).

fof(f167,plain,
    ! [X0] :
      ( ssList(sK0(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f140]) ).

fof(f377,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | nil = X0
        | ~ ssList(sK0(X0))
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssItem(sK1(X0))
        | sK6 != X0
        | memberP(nil,sK8(sK1(X0),nil,sK0(X0))) )
    | ~ spl11_2 ),
    inference(superposition,[],[f356,f168]) ).

fof(f168,plain,
    ! [X0] :
      ( cons(sK1(X0),sK0(X0)) = X0
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f140]) ).

fof(f356,plain,
    ( ! [X8,X7] :
        ( cons(X7,X8) != sK6
        | memberP(nil,sK8(X7,nil,X8))
        | ~ ssList(cons(X7,nil))
        | ~ ssItem(X7)
        | ~ ssList(X8) )
    | ~ spl11_2 ),
    inference(duplicate_literal_removal,[],[f334]) ).

fof(f334,plain,
    ( ! [X8,X7] :
        ( ~ ssItem(X7)
        | ~ ssItem(X7)
        | memberP(nil,sK8(X7,nil,X8))
        | ~ ssList(X8)
        | ~ ssList(cons(X7,nil))
        | ~ ssList(X8)
        | cons(X7,X8) != sK6 )
    | ~ spl11_2 ),
    inference(superposition,[],[f259,f214]) ).

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

fof(f133,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssItem(X1)
          | cons(X1,X0) = app(cons(X1,nil),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/sandbox/benchmark/theBenchmark.p',ax81) ).

fof(f259,plain,
    ( ! [X14,X15] :
        ( app(cons(X14,nil),X15) != sK6
        | memberP(nil,sK8(X14,nil,X15))
        | ~ ssList(X15)
        | ~ ssList(cons(X14,nil))
        | ~ ssItem(X14) )
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f255,f245]) ).

fof(f245,plain,
    ( ssList(nil)
    | ~ spl11_2 ),
    inference(avatar_component_clause,[],[f244]) ).

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

fof(f255,plain,
    ! [X14,X15] :
      ( memberP(nil,sK8(X14,nil,X15))
      | ~ ssList(X15)
      | app(cons(X14,nil),X15) != sK6
      | ~ ssItem(X14)
      | ~ ssList(cons(X14,nil))
      | ~ ssList(nil) ),
    inference(superposition,[],[f228,f213]) ).

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

fof(f120,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/sandbox/benchmark/theBenchmark.p',ax28) ).

fof(f228,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK6
      | memberP(X5,sK8(X4,X5,X6))
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssItem(X4) ),
    inference(definition_unfolding,[],[f191,f197]) ).

fof(f191,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK4
      | memberP(X5,sK8(X4,X5,X6))
      | ~ ssList(X5) ),
    inference(cnf_transformation,[],[f154]) ).

fof(f400,plain,
    ( ~ spl11_2
    | spl11_3 ),
    inference(avatar_contradiction_clause,[],[f399]) ).

fof(f399,plain,
    ( $false
    | ~ spl11_2
    | spl11_3 ),
    inference(subsumption_resolution,[],[f398,f229]) ).

fof(f398,plain,
    ( nil = sK6
    | ~ spl11_2
    | spl11_3 ),
    inference(subsumption_resolution,[],[f397,f198]) ).

fof(f397,plain,
    ( ~ ssList(sK6)
    | nil = sK6
    | ~ spl11_2
    | spl11_3 ),
    inference(resolution,[],[f396,f169]) ).

fof(f396,plain,
    ( ~ ssItem(sK1(sK6))
    | ~ spl11_2
    | spl11_3 ),
    inference(subsumption_resolution,[],[f395,f245]) ).

fof(f395,plain,
    ( ~ ssItem(sK1(sK6))
    | ~ ssList(nil)
    | spl11_3 ),
    inference(resolution,[],[f389,f202]) ).

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

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

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

fof(f389,plain,
    ( ~ ssList(cons(sK1(sK6),nil))
    | spl11_3 ),
    inference(avatar_component_clause,[],[f387]) ).

fof(f394,plain,
    ( ~ spl11_3
    | spl11_4
    | ~ spl11_2 ),
    inference(avatar_split_clause,[],[f385,f244,f391,f387]) ).

fof(f385,plain,
    ( ssItem(sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ ssList(cons(sK1(sK6),nil))
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f384,f198]) ).

fof(f384,plain,
    ( ~ ssList(sK6)
    | ~ ssList(cons(sK1(sK6),nil))
    | ssItem(sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f383,f229]) ).

fof(f383,plain,
    ( nil = sK6
    | ~ ssList(cons(sK1(sK6),nil))
    | ssItem(sK8(sK1(sK6),nil,sK0(sK6)))
    | ~ ssList(sK6)
    | ~ spl11_2 ),
    inference(equality_resolution,[],[f370]) ).

fof(f370,plain,
    ( ! [X0] :
        ( sK6 != X0
        | nil = X0
        | ~ ssList(X0)
        | ~ ssList(cons(sK1(X0),nil))
        | ssItem(sK8(sK1(X0),nil,sK0(X0))) )
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f369,f169]) ).

fof(f369,plain,
    ( ! [X0] :
        ( ~ ssList(cons(sK1(X0),nil))
        | sK6 != X0
        | ssItem(sK8(sK1(X0),nil,sK0(X0)))
        | nil = X0
        | ~ ssList(X0)
        | ~ ssItem(sK1(X0)) )
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f368,f167]) ).

fof(f368,plain,
    ( ! [X0] :
        ( nil = X0
        | ~ ssList(sK0(X0))
        | ~ ssItem(sK1(X0))
        | ~ ssList(cons(sK1(X0),nil))
        | sK6 != X0
        | ssItem(sK8(sK1(X0),nil,sK0(X0)))
        | ~ ssList(X0) )
    | ~ spl11_2 ),
    inference(superposition,[],[f361,f168]) ).

fof(f361,plain,
    ( ! [X11,X12] :
        ( cons(X11,X12) != sK6
        | ssItem(sK8(X11,nil,X12))
        | ~ ssList(X12)
        | ~ ssItem(X11)
        | ~ ssList(cons(X11,nil)) )
    | ~ spl11_2 ),
    inference(duplicate_literal_removal,[],[f336]) ).

fof(f336,plain,
    ( ! [X11,X12] :
        ( ~ ssList(X12)
        | ~ ssList(cons(X11,nil))
        | ssItem(sK8(X11,nil,X12))
        | ~ ssItem(X11)
        | ~ ssList(X12)
        | ~ ssItem(X11)
        | cons(X11,X12) != sK6 )
    | ~ spl11_2 ),
    inference(superposition,[],[f261,f214]) ).

fof(f261,plain,
    ( ! [X6,X7] :
        ( app(cons(X6,nil),X7) != sK6
        | ~ ssItem(X6)
        | ~ ssList(X7)
        | ~ ssList(cons(X6,nil))
        | ssItem(sK8(X6,nil,X7)) )
    | ~ spl11_2 ),
    inference(subsumption_resolution,[],[f251,f245]) ).

fof(f251,plain,
    ! [X6,X7] :
      ( ~ ssList(cons(X6,nil))
      | ssItem(sK8(X6,nil,X7))
      | ~ ssList(X7)
      | ~ ssItem(X6)
      | ~ ssList(nil)
      | app(cons(X6,nil),X7) != sK6 ),
    inference(superposition,[],[f224,f213]) ).

fof(f224,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK6
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ssItem(sK8(X4,X5,X6)) ),
    inference(definition_unfolding,[],[f195,f197]) ).

fof(f195,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK4
      | ssItem(sK8(X4,X5,X6))
      | ~ ssList(X5) ),
    inference(cnf_transformation,[],[f154]) ).

fof(f248,plain,
    spl11_2,
    inference(avatar_split_clause,[],[f201,f244]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : SWC233+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.32  % Computer : n025.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Tue Aug 30 18:46:15 EDT 2022
% 0.10/0.32  % CPUTime    : 
% 0.15/0.47  % (24736)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.15/0.47  % (24735)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.15/0.47  % (24727)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.15/0.48  % (24728)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.15/0.48  % (24723)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.15/0.48  % (24743)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.15/0.48  % (24731)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.15/0.49  % (24744)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.15/0.49  % (24739)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.15/0.50  % (24743)Instruction limit reached!
% 0.15/0.50  % (24743)------------------------------
% 0.15/0.50  % (24743)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.50  % (24727)Instruction limit reached!
% 0.15/0.50  % (24727)------------------------------
% 0.15/0.50  % (24727)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.50  % (24743)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.50  % (24743)Termination reason: Unknown
% 0.15/0.50  % (24743)Termination phase: Function definition elimination
% 0.15/0.50  
% 0.15/0.50  % (24743)Memory used [KB]: 1791
% 0.15/0.50  % (24743)Time elapsed: 0.007 s
% 0.15/0.50  % (24743)Instructions burned: 8 (million)
% 0.15/0.50  % (24743)------------------------------
% 0.15/0.50  % (24743)------------------------------
% 0.15/0.51  % (24727)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.51  % (24727)Termination reason: Unknown
% 0.15/0.51  % (24727)Termination phase: Saturation
% 0.15/0.51  
% 0.15/0.51  % (24727)Memory used [KB]: 2046
% 0.15/0.51  % (24727)Time elapsed: 0.120 s
% 0.15/0.51  % (24727)Instructions burned: 16 (million)
% 0.15/0.51  % (24727)------------------------------
% 0.15/0.51  % (24727)------------------------------
% 0.15/0.51  % (24719)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.15/0.51  % (24720)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.15/0.52  % (24735)Instruction limit reached!
% 0.15/0.52  % (24735)------------------------------
% 0.15/0.52  % (24735)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.52  % (24735)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.52  % (24735)Termination reason: Unknown
% 0.15/0.52  % (24735)Termination phase: Saturation
% 0.15/0.52  
% 0.15/0.52  % (24735)Memory used [KB]: 6524
% 0.15/0.52  % (24735)Time elapsed: 0.134 s
% 0.15/0.52  % (24735)Instructions burned: 30 (million)
% 0.15/0.52  % (24735)------------------------------
% 0.15/0.52  % (24735)------------------------------
% 0.15/0.52  % (24722)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.15/0.52  % (24716)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.15/0.52  % (24726)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.15/0.53  % (24725)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.15/0.53  % (24726)Instruction limit reached!
% 0.15/0.53  % (24726)------------------------------
% 0.15/0.53  % (24726)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.53  % (24726)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.53  % (24726)Termination reason: Unknown
% 0.15/0.53  % (24726)Termination phase: Saturation
% 0.15/0.53  
% 0.15/0.53  % (24726)Memory used [KB]: 6140
% 0.15/0.53  % (24726)Time elapsed: 0.152 s
% 0.15/0.53  % (24726)Instructions burned: 7 (million)
% 0.15/0.53  % (24726)------------------------------
% 0.15/0.53  % (24726)------------------------------
% 0.15/0.53  % (24744)Instruction limit reached!
% 0.15/0.53  % (24744)------------------------------
% 0.15/0.53  % (24744)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.53  % (24744)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.53  % (24744)Termination reason: Unknown
% 0.15/0.53  % (24744)Termination phase: Saturation
% 0.15/0.53  
% 0.15/0.53  % (24744)Memory used [KB]: 6396
% 0.15/0.53  % (24744)Time elapsed: 0.156 s
% 0.15/0.53  % (24744)Instructions burned: 24 (million)
% 0.15/0.53  % (24744)------------------------------
% 0.15/0.53  % (24744)------------------------------
% 0.15/0.53  % (24717)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.15/0.53  % (24717)Instruction limit reached!
% 0.15/0.53  % (24717)------------------------------
% 0.15/0.53  % (24717)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.53  % (24717)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.53  % (24717)Termination reason: Unknown
% 0.15/0.53  % (24717)Termination phase: Preprocessing 3
% 0.15/0.53  
% 0.15/0.53  % (24717)Memory used [KB]: 1663
% 0.15/0.53  % (24717)Time elapsed: 0.004 s
% 0.15/0.53  % (24717)Instructions burned: 4 (million)
% 0.15/0.53  % (24717)------------------------------
% 0.15/0.53  % (24717)------------------------------
% 0.15/0.53  % (24719)Instruction limit reached!
% 0.15/0.53  % (24719)------------------------------
% 0.15/0.53  % (24719)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.53  % (24719)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.53  % (24719)Termination reason: Unknown
% 0.15/0.53  % (24719)Termination phase: Saturation
% 0.15/0.53  
% 0.15/0.53  % (24719)Memory used [KB]: 6268
% 0.15/0.53  % (24719)Time elapsed: 0.156 s
% 0.15/0.53  % (24719)Instructions burned: 13 (million)
% 0.15/0.53  % (24719)------------------------------
% 0.15/0.53  % (24719)------------------------------
% 0.15/0.54  % (24720)Instruction limit reached!
% 0.15/0.54  % (24720)------------------------------
% 0.15/0.54  % (24720)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.54  % (24720)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.54  % (24720)Termination reason: Unknown
% 0.15/0.54  % (24720)Termination phase: Saturation
% 0.15/0.54  
% 0.15/0.54  % (24720)Memory used [KB]: 1791
% 0.15/0.54  % (24720)Time elapsed: 0.158 s
% 0.15/0.54  % (24720)Instructions burned: 16 (million)
% 0.15/0.54  % (24720)------------------------------
% 0.15/0.54  % (24720)------------------------------
% 0.15/0.54  % (24737)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.15/0.54  % (24738)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.15/0.54  % (24741)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.15/0.54  % (24742)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.15/0.55  % (24733)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.15/0.55  % (24733)Instruction limit reached!
% 0.15/0.55  % (24733)------------------------------
% 0.15/0.55  % (24733)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.55  % (24733)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.55  % (24733)Termination reason: Unknown
% 0.15/0.55  % (24733)Termination phase: Naming
% 0.15/0.55  
% 0.15/0.55  % (24733)Memory used [KB]: 1535
% 0.15/0.55  % (24733)Time elapsed: 0.003 s
% 0.15/0.55  % (24733)Instructions burned: 2 (million)
% 0.15/0.55  % (24733)------------------------------
% 0.15/0.55  % (24733)------------------------------
% 0.15/0.55  % (24734)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.15/0.55  % (24725)Refutation not found, incomplete strategy% (24725)------------------------------
% 0.15/0.55  % (24725)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.55  % (24725)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.55  % (24725)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.55  
% 0.15/0.55  % (24725)Memory used [KB]: 6140
% 0.15/0.55  % (24725)Time elapsed: 0.169 s
% 0.15/0.55  % (24725)Instructions burned: 8 (million)
% 0.15/0.55  % (24725)------------------------------
% 0.15/0.55  % (24725)------------------------------
% 0.15/0.55  % (24729)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.15/0.55  % (24730)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.15/0.56  % (24721)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.83/0.56  % (24716)Instruction limit reached!
% 1.83/0.56  % (24716)------------------------------
% 1.83/0.56  % (24716)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.56  % (24716)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.56  % (24716)Termination reason: Unknown
% 1.83/0.56  % (24716)Termination phase: Saturation
% 1.83/0.56  
% 1.83/0.56  % (24716)Memory used [KB]: 6396
% 1.83/0.56  % (24716)Time elapsed: 0.157 s
% 1.83/0.56  % (24716)Instructions burned: 14 (million)
% 1.83/0.56  % (24716)------------------------------
% 1.83/0.56  % (24716)------------------------------
% 1.83/0.57  % (24728)Instruction limit reached!
% 1.83/0.57  % (24728)------------------------------
% 1.83/0.57  % (24728)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.57  % (24728)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.57  % (24728)Termination reason: Unknown
% 1.83/0.57  % (24728)Termination phase: Saturation
% 1.83/0.57  
% 1.83/0.57  % (24728)Memory used [KB]: 7675
% 1.83/0.57  % (24728)Time elapsed: 0.170 s
% 1.83/0.57  % (24728)Instructions burned: 51 (million)
% 1.83/0.57  % (24728)------------------------------
% 1.83/0.57  % (24728)------------------------------
% 1.83/0.57  % (24723)Instruction limit reached!
% 1.83/0.57  % (24723)------------------------------
% 1.83/0.57  % (24723)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.57  % (24723)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.57  % (24723)Termination reason: Unknown
% 1.83/0.57  % (24723)Termination phase: Saturation
% 1.83/0.57  
% 1.83/0.57  % (24723)Memory used [KB]: 6908
% 1.83/0.57  % (24723)Time elapsed: 0.167 s
% 1.83/0.57  % (24723)Instructions burned: 49 (million)
% 1.83/0.57  % (24723)------------------------------
% 1.83/0.57  % (24723)------------------------------
% 1.83/0.57  % (24734)Instruction limit reached!
% 1.83/0.57  % (24734)------------------------------
% 1.83/0.57  % (24734)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.57  % (24734)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.57  % (24734)Termination reason: Unknown
% 1.83/0.57  % (24734)Termination phase: Saturation
% 1.83/0.57  
% 1.83/0.57  % (24734)Memory used [KB]: 6268
% 1.83/0.57  % (24734)Time elapsed: 0.171 s
% 1.83/0.57  % (24734)Instructions burned: 11 (million)
% 1.83/0.57  % (24734)------------------------------
% 1.83/0.57  % (24734)------------------------------
% 1.83/0.57  % (24729)Instruction limit reached!
% 1.83/0.57  % (24729)------------------------------
% 1.83/0.57  % (24729)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.57  % (24729)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.57  % (24729)Termination reason: Unknown
% 1.83/0.57  % (24729)Termination phase: Preprocessing 3
% 1.83/0.57  
% 1.83/0.57  % (24729)Memory used [KB]: 1663
% 1.83/0.57  % (24729)Time elapsed: 0.004 s
% 1.83/0.57  % (24729)Instructions burned: 3 (million)
% 1.83/0.57  % (24729)------------------------------
% 1.83/0.57  % (24729)------------------------------
% 1.83/0.57  % (24739)Instruction limit reached!
% 1.83/0.57  % (24739)------------------------------
% 1.83/0.57  % (24739)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.57  % (24739)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.57  % (24739)Termination reason: Unknown
% 1.83/0.57  % (24739)Termination phase: Saturation
% 1.83/0.57  
% 1.83/0.57  % (24739)Memory used [KB]: 6780
% 1.83/0.57  % (24739)Time elapsed: 0.193 s
% 1.83/0.57  % (24739)Instructions burned: 50 (million)
% 1.83/0.57  % (24739)------------------------------
% 1.83/0.57  % (24739)------------------------------
% 1.83/0.58  % (24731)Instruction limit reached!
% 1.83/0.58  % (24731)------------------------------
% 1.83/0.58  % (24731)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.58  % (24731)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.58  % (24731)Termination reason: Unknown
% 1.83/0.58  % (24731)Termination phase: Saturation
% 1.83/0.58  
% 1.83/0.58  % (24731)Memory used [KB]: 6908
% 1.83/0.58  % (24731)Time elapsed: 0.192 s
% 1.83/0.58  % (24731)Instructions burned: 50 (million)
% 1.83/0.58  % (24731)------------------------------
% 1.83/0.58  % (24731)------------------------------
% 1.83/0.58  % (24742)Instruction limit reached!
% 1.83/0.58  % (24742)------------------------------
% 1.83/0.58  % (24742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.58  % (24730)Instruction limit reached!
% 1.83/0.58  % (24730)------------------------------
% 1.83/0.58  % (24730)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.83/0.58  % (24742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.58  % (24730)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.83/0.58  % (24742)Termination reason: Unknown
% 1.83/0.58  % (24730)Termination reason: Unknown
% 1.83/0.58  % (24742)Termination phase: Saturation
% 1.83/0.58  % (24730)Termination phase: Property scanning
% 1.83/0.58  
% 1.83/0.58  
% 1.83/0.58  % (24742)Memory used [KB]: 6524
% 1.83/0.58  % (24730)Memory used [KB]: 1791
% 1.83/0.58  % (24742)Time elapsed: 0.189 s
% 1.83/0.58  % (24730)Time elapsed: 0.006 s
% 1.83/0.58  % (24742)Instructions burned: 25 (million)
% 1.83/0.58  % (24730)Instructions burned: 7 (million)
% 1.83/0.58  % (24742)------------------------------
% 1.83/0.58  % (24742)------------------------------
% 1.83/0.58  % (24730)------------------------------
% 1.83/0.58  % (24730)------------------------------
% 1.83/0.60  % (24721)First to succeed.
% 2.16/0.60  % (24721)Refutation found. Thanks to Tanya!
% 2.16/0.60  % SZS status Theorem for theBenchmark
% 2.16/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 2.16/0.61  % (24721)------------------------------
% 2.16/0.61  % (24721)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.16/0.61  % (24721)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.16/0.61  % (24721)Termination reason: Refutation
% 2.16/0.61  
% 2.16/0.61  % (24721)Memory used [KB]: 6268
% 2.16/0.61  % (24721)Time elapsed: 0.217 s
% 2.16/0.61  % (24721)Instructions burned: 15 (million)
% 2.16/0.61  % (24721)------------------------------
% 2.16/0.61  % (24721)------------------------------
% 2.16/0.61  % (24714)Success in time 0.268 s
%------------------------------------------------------------------------------