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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC003+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 : n019.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:38:09 EDT 2022

% Result   : Theorem 0.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   84 (   7 unt;   0 def)
%            Number of atoms       :  569 ( 143 equ)
%            Maximal formula atoms :   48 (   6 avg)
%            Number of connectives :  767 ( 282   ~; 262   |; 185   &)
%                                         (  11 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   16 (  14 usr;  10 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :  167 (  96   !;  71   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f505,plain,
    $false,
    inference(avatar_sat_refutation,[],[f278,f279,f283,f288,f289,f290,f298,f325,f405,f504]) ).

fof(f504,plain,
    ( ~ spl13_5
    | ~ spl13_11
    | spl13_12 ),
    inference(avatar_contradiction_clause,[],[f503]) ).

fof(f503,plain,
    ( $false
    | ~ spl13_5
    | ~ spl13_11
    | spl13_12 ),
    inference(subsumption_resolution,[],[f502,f277]) ).

fof(f277,plain,
    ( ssItem(sK8)
    | ~ spl13_5 ),
    inference(avatar_component_clause,[],[f275]) ).

fof(f275,plain,
    ( spl13_5
  <=> ssItem(sK8) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_5])]) ).

fof(f502,plain,
    ( ~ ssItem(sK8)
    | ~ spl13_11
    | spl13_12 ),
    inference(subsumption_resolution,[],[f495,f178]) ).

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

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

fof(f495,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sK8)
    | ~ spl13_11
    | spl13_12 ),
    inference(trivial_inequality_removal,[],[f493]) ).

fof(f493,plain,
    ( ~ ssItem(sK8)
    | nil != nil
    | ~ ssList(nil)
    | ~ spl13_11
    | spl13_12 ),
    inference(superposition,[],[f182,f421]) ).

fof(f421,plain,
    ( nil = cons(sK8,nil)
    | ~ spl13_11
    | spl13_12 ),
    inference(subsumption_resolution,[],[f420,f178]) ).

fof(f420,plain,
    ( ~ ssList(nil)
    | nil = cons(sK8,nil)
    | ~ spl13_11
    | spl13_12 ),
    inference(subsumption_resolution,[],[f414,f319]) ).

fof(f319,plain,
    ( ssList(cons(sK8,nil))
    | ~ spl13_11 ),
    inference(avatar_component_clause,[],[f318]) ).

fof(f318,plain,
    ( spl13_11
  <=> ssList(cons(sK8,nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_11])]) ).

fof(f414,plain,
    ( nil = cons(sK8,nil)
    | ~ ssList(cons(sK8,nil))
    | ~ ssList(nil)
    | spl13_12 ),
    inference(resolution,[],[f181,f324]) ).

fof(f324,plain,
    ( ~ neq(cons(sK8,nil),nil)
    | spl13_12 ),
    inference(avatar_component_clause,[],[f322]) ).

fof(f322,plain,
    ( spl13_12
  <=> neq(cons(sK8,nil),nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_12])]) ).

fof(f181,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f142]) ).

fof(f142,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) ) ),
    inference(nnf_transformation,[],[f121]) ).

fof(f121,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).

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

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

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

fof(f405,plain,
    ( ~ spl13_5
    | spl13_11 ),
    inference(avatar_contradiction_clause,[],[f404]) ).

fof(f404,plain,
    ( $false
    | ~ spl13_5
    | spl13_11 ),
    inference(subsumption_resolution,[],[f403,f178]) ).

fof(f403,plain,
    ( ~ ssList(nil)
    | ~ spl13_5
    | spl13_11 ),
    inference(subsumption_resolution,[],[f400,f277]) ).

fof(f400,plain,
    ( ~ ssItem(sK8)
    | ~ ssList(nil)
    | spl13_11 ),
    inference(resolution,[],[f222,f320]) ).

fof(f320,plain,
    ( ~ ssList(cons(sK8,nil))
    | spl13_11 ),
    inference(avatar_component_clause,[],[f318]) ).

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

fof(f111,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssItem(X1)
          | ssList(cons(X1,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(f325,plain,
    ( ~ spl13_11
    | ~ spl13_12
    | ~ spl13_2
    | ~ spl13_3
    | ~ spl13_4
    | ~ spl13_6
    | ~ spl13_7 ),
    inference(avatar_split_clause,[],[f316,f285,f281,f270,f265,f260,f322,f318]) ).

fof(f260,plain,
    ( spl13_2
  <=> app(app(sK9,cons(sK8,nil)),sK10) = sK5 ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).

fof(f265,plain,
    ( spl13_3
  <=> ssList(sK9) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).

fof(f270,plain,
    ( spl13_4
  <=> app(sK9,sK10) = sK6 ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_4])]) ).

fof(f281,plain,
    ( spl13_6
  <=> ! [X6,X4,X5] :
        ( ~ ssList(X4)
        | app(X4,X6) != sK6
        | app(app(X4,X5),X6) != sK5
        | ~ ssList(X6)
        | ~ ssList(X5)
        | ~ neq(X5,nil) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_6])]) ).

fof(f285,plain,
    ( spl13_7
  <=> ssList(sK10) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_7])]) ).

fof(f316,plain,
    ( ~ neq(cons(sK8,nil),nil)
    | ~ ssList(cons(sK8,nil))
    | ~ spl13_2
    | ~ spl13_3
    | ~ spl13_4
    | ~ spl13_6
    | ~ spl13_7 ),
    inference(subsumption_resolution,[],[f315,f267]) ).

fof(f267,plain,
    ( ssList(sK9)
    | ~ spl13_3 ),
    inference(avatar_component_clause,[],[f265]) ).

fof(f315,plain,
    ( ~ ssList(sK9)
    | ~ neq(cons(sK8,nil),nil)
    | ~ ssList(cons(sK8,nil))
    | ~ spl13_2
    | ~ spl13_4
    | ~ spl13_6
    | ~ spl13_7 ),
    inference(subsumption_resolution,[],[f314,f272]) ).

fof(f272,plain,
    ( app(sK9,sK10) = sK6
    | ~ spl13_4 ),
    inference(avatar_component_clause,[],[f270]) ).

fof(f314,plain,
    ( ~ ssList(cons(sK8,nil))
    | ~ neq(cons(sK8,nil),nil)
    | app(sK9,sK10) != sK6
    | ~ ssList(sK9)
    | ~ spl13_2
    | ~ spl13_6
    | ~ spl13_7 ),
    inference(subsumption_resolution,[],[f303,f287]) ).

fof(f287,plain,
    ( ssList(sK10)
    | ~ spl13_7 ),
    inference(avatar_component_clause,[],[f285]) ).

fof(f303,plain,
    ( ~ ssList(sK10)
    | ~ neq(cons(sK8,nil),nil)
    | app(sK9,sK10) != sK6
    | ~ ssList(cons(sK8,nil))
    | ~ ssList(sK9)
    | ~ spl13_2
    | ~ spl13_6 ),
    inference(trivial_inequality_removal,[],[f302]) ).

fof(f302,plain,
    ( ~ neq(cons(sK8,nil),nil)
    | ~ ssList(sK10)
    | sK5 != sK5
    | ~ ssList(sK9)
    | app(sK9,sK10) != sK6
    | ~ ssList(cons(sK8,nil))
    | ~ spl13_2
    | ~ spl13_6 ),
    inference(superposition,[],[f282,f262]) ).

fof(f262,plain,
    ( app(app(sK9,cons(sK8,nil)),sK10) = sK5
    | ~ spl13_2 ),
    inference(avatar_component_clause,[],[f260]) ).

fof(f282,plain,
    ( ! [X6,X4,X5] :
        ( app(app(X4,X5),X6) != sK5
        | ~ ssList(X5)
        | ~ ssList(X4)
        | ~ ssList(X6)
        | app(X4,X6) != sK6
        | ~ neq(X5,nil) )
    | ~ spl13_6 ),
    inference(avatar_component_clause,[],[f281]) ).

fof(f298,plain,
    ( spl13_4
    | ~ spl13_1 ),
    inference(avatar_split_clause,[],[f241,f256,f270]) ).

fof(f256,plain,
    ( spl13_1
  <=> neq(sK5,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).

fof(f241,plain,
    ( ~ neq(sK5,nil)
    | app(sK9,sK10) = sK6 ),
    inference(definition_unfolding,[],[f197,f212]) ).

fof(f212,plain,
    sK7 = sK5,
    inference(cnf_transformation,[],[f156]) ).

fof(f156,plain,
    ( sK7 = sK5
    & ( ( ! [X4] :
            ( ~ ssList(X4)
            | ! [X5] :
                ( ! [X6] :
                    ( app(X4,X6) != sK4
                    | ~ neq(X5,nil)
                    | ~ ssList(X6)
                    | app(app(X4,X5),X6) != sK5 )
                | ~ ssList(X5) ) )
        & neq(sK5,nil)
        & ssItem(sK8)
        & ssList(sK9)
        & ! [X10] :
            ( ~ ssItem(X10)
            | sK8 = X10
            | ~ geq(X10,sK8)
            | ~ memberP(sK7,X10) )
        & ssList(sK10)
        & app(app(sK9,cons(sK8,nil)),sK10) = sK7
        & app(sK9,sK10) = sK6 )
      | ( ~ neq(sK7,nil)
        & neq(sK5,nil) ) )
    & sK4 = sK6
    & ssList(sK7)
    & ssList(sK6)
    & ssList(sK5)
    & ssList(sK4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10])],[f103,f155,f154,f153,f152,f151,f150,f149]) ).

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

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

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

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

fof(f153,plain,
    ( ? [X7] :
        ( ssItem(X7)
        & ? [X8] :
            ( ssList(X8)
            & ? [X9] :
                ( ! [X10] :
                    ( ~ ssItem(X10)
                    | X7 = X10
                    | ~ geq(X10,X7)
                    | ~ memberP(sK7,X10) )
                & ssList(X9)
                & app(app(X8,cons(X7,nil)),X9) = sK7
                & app(X8,X9) = sK6 ) ) )
   => ( ssItem(sK8)
      & ? [X8] :
          ( ssList(X8)
          & ? [X9] :
              ( ! [X10] :
                  ( ~ ssItem(X10)
                  | sK8 = X10
                  | ~ geq(X10,sK8)
                  | ~ memberP(sK7,X10) )
              & ssList(X9)
              & app(app(X8,cons(sK8,nil)),X9) = sK7
              & app(X8,X9) = sK6 ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f154,plain,
    ( ? [X8] :
        ( ssList(X8)
        & ? [X9] :
            ( ! [X10] :
                ( ~ ssItem(X10)
                | sK8 = X10
                | ~ geq(X10,sK8)
                | ~ memberP(sK7,X10) )
            & ssList(X9)
            & app(app(X8,cons(sK8,nil)),X9) = sK7
            & app(X8,X9) = sK6 ) )
   => ( ssList(sK9)
      & ? [X9] :
          ( ! [X10] :
              ( ~ ssItem(X10)
              | sK8 = X10
              | ~ geq(X10,sK8)
              | ~ memberP(sK7,X10) )
          & ssList(X9)
          & app(app(sK9,cons(sK8,nil)),X9) = sK7
          & sK6 = app(sK9,X9) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f155,plain,
    ( ? [X9] :
        ( ! [X10] :
            ( ~ ssItem(X10)
            | sK8 = X10
            | ~ geq(X10,sK8)
            | ~ memberP(sK7,X10) )
        & ssList(X9)
        & app(app(sK9,cons(sK8,nil)),X9) = sK7
        & sK6 = app(sK9,X9) )
   => ( ! [X10] :
          ( ~ ssItem(X10)
          | sK8 = X10
          | ~ geq(X10,sK8)
          | ~ memberP(sK7,X10) )
      & ssList(sK10)
      & app(app(sK9,cons(sK8,nil)),sK10) = sK7
      & app(sK9,sK10) = sK6 ) ),
    introduced(choice_axiom,[]) ).

fof(f103,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & ( ( ! [X4] :
                          ( ~ ssList(X4)
                          | ! [X5] :
                              ( ! [X6] :
                                  ( app(X4,X6) != X0
                                  | ~ neq(X5,nil)
                                  | ~ ssList(X6)
                                  | app(app(X4,X5),X6) != X1 )
                              | ~ ssList(X5) ) )
                      & neq(X1,nil)
                      & ? [X7] :
                          ( ssItem(X7)
                          & ? [X8] :
                              ( ssList(X8)
                              & ? [X9] :
                                  ( ! [X10] :
                                      ( ~ ssItem(X10)
                                      | X7 = X10
                                      | ~ geq(X10,X7)
                                      | ~ memberP(X3,X10) )
                                  & ssList(X9)
                                  & app(app(X8,cons(X7,nil)),X9) = X3
                                  & app(X8,X9) = X2 ) ) ) )
                    | ( ~ neq(X3,nil)
                      & neq(X1,nil) ) )
                  & X0 = X2
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f102]) ).

fof(f102,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & ( ( ~ neq(X3,nil)
                      & neq(X1,nil) )
                    | ( ! [X4] :
                          ( ~ ssList(X4)
                          | ! [X5] :
                              ( ! [X6] :
                                  ( app(X4,X6) != X0
                                  | ~ neq(X5,nil)
                                  | ~ ssList(X6)
                                  | app(app(X4,X5),X6) != X1 )
                              | ~ ssList(X5) ) )
                      & neq(X1,nil)
                      & ? [X7] :
                          ( ? [X8] :
                              ( ? [X9] :
                                  ( app(app(X8,cons(X7,nil)),X9) = X3
                                  & ! [X10] :
                                      ( ~ ssItem(X10)
                                      | X7 = X10
                                      | ~ geq(X10,X7)
                                      | ~ memberP(X3,X10) )
                                  & app(X8,X9) = X2
                                  & ssList(X9) )
                              & ssList(X8) )
                          & ssItem(X7) ) ) )
                  & X1 = X3
                  & 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
                      | ( ( ~ neq(X1,nil)
                          | neq(X3,nil) )
                        & ( ? [X4] :
                              ( ssList(X4)
                              & ? [X5] :
                                  ( ssList(X5)
                                  & ? [X6] :
                                      ( app(X4,X6) = X0
                                      & ssList(X6)
                                      & neq(X5,nil)
                                      & app(app(X4,X5),X6) = X1 ) ) )
                          | ~ neq(X1,nil)
                          | ! [X7] :
                              ( ssItem(X7)
                             => ! [X8] :
                                  ( ssList(X8)
                                 => ! [X9] :
                                      ( ssList(X9)
                                     => ( app(app(X8,cons(X7,nil)),X9) != X3
                                        | ? [X10] :
                                            ( ssItem(X10)
                                            & memberP(X3,X10)
                                            & geq(X10,X7)
                                            & X7 != X10 )
                                        | app(X8,X9) != X2 ) ) ) ) ) )
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f197,plain,
    ( app(sK9,sK10) = sK6
    | ~ neq(sK7,nil) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f290,plain,
    ( ~ spl13_1
    | spl13_2 ),
    inference(avatar_split_clause,[],[f239,f260,f256]) ).

fof(f239,plain,
    ( app(app(sK9,cons(sK8,nil)),sK10) = sK5
    | ~ neq(sK5,nil) ),
    inference(definition_unfolding,[],[f199,f212,f212]) ).

fof(f199,plain,
    ( app(app(sK9,cons(sK8,nil)),sK10) = sK7
    | ~ neq(sK7,nil) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f289,plain,
    spl13_1,
    inference(avatar_split_clause,[],[f252,f256]) ).

fof(f252,plain,
    neq(sK5,nil),
    inference(duplicate_literal_removal,[],[f208]) ).

fof(f208,plain,
    ( neq(sK5,nil)
    | neq(sK5,nil) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f288,plain,
    ( ~ spl13_1
    | spl13_7 ),
    inference(avatar_split_clause,[],[f238,f285,f256]) ).

fof(f238,plain,
    ( ssList(sK10)
    | ~ neq(sK5,nil) ),
    inference(definition_unfolding,[],[f201,f212]) ).

fof(f201,plain,
    ( ssList(sK10)
    | ~ neq(sK7,nil) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f283,plain,
    ( ~ spl13_1
    | spl13_6 ),
    inference(avatar_split_clause,[],[f231,f281,f256]) ).

fof(f231,plain,
    ! [X6,X4,X5] :
      ( ~ ssList(X4)
      | ~ ssList(X5)
      | ~ neq(X5,nil)
      | ~ ssList(X6)
      | app(app(X4,X5),X6) != sK5
      | app(X4,X6) != sK6
      | ~ neq(sK5,nil) ),
    inference(definition_unfolding,[],[f211,f195,f212]) ).

fof(f195,plain,
    sK4 = sK6,
    inference(cnf_transformation,[],[f156]) ).

fof(f211,plain,
    ! [X6,X4,X5] :
      ( ~ ssList(X4)
      | app(X4,X6) != sK4
      | ~ neq(X5,nil)
      | ~ ssList(X6)
      | app(app(X4,X5),X6) != sK5
      | ~ ssList(X5)
      | ~ neq(sK7,nil) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f279,plain,
    ( ~ spl13_1
    | spl13_3 ),
    inference(avatar_split_clause,[],[f235,f265,f256]) ).

fof(f235,plain,
    ( ssList(sK9)
    | ~ neq(sK5,nil) ),
    inference(definition_unfolding,[],[f205,f212]) ).

fof(f205,plain,
    ( ssList(sK9)
    | ~ neq(sK7,nil) ),
    inference(cnf_transformation,[],[f156]) ).

fof(f278,plain,
    ( spl13_5
    | ~ spl13_1 ),
    inference(avatar_split_clause,[],[f234,f256,f275]) ).

fof(f234,plain,
    ( ~ neq(sK5,nil)
    | ssItem(sK8) ),
    inference(definition_unfolding,[],[f207,f212]) ).

fof(f207,plain,
    ( ssItem(sK8)
    | ~ neq(sK7,nil) ),
    inference(cnf_transformation,[],[f156]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC003+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.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 17:54:35 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.46  % (9147)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.47  % (9171)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.20/0.48  % (9163)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.20/0.49  % (9155)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.20/0.49  % (9163)Instruction limit reached!
% 0.20/0.49  % (9163)------------------------------
% 0.20/0.49  % (9163)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49  % (9163)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49  % (9163)Termination reason: Unknown
% 0.20/0.49  % (9163)Termination phase: Equality resolution with deletion
% 0.20/0.49  
% 0.20/0.49  % (9163)Memory used [KB]: 1791
% 0.20/0.49  % (9163)Time elapsed: 0.009 s
% 0.20/0.49  % (9163)Instructions burned: 9 (million)
% 0.20/0.49  % (9163)------------------------------
% 0.20/0.49  % (9163)------------------------------
% 0.20/0.49  % (9162)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.20/0.49  % (9162)Instruction limit reached!
% 0.20/0.49  % (9162)------------------------------
% 0.20/0.49  % (9162)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49  % (9162)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49  % (9162)Termination reason: Unknown
% 0.20/0.49  % (9162)Termination phase: Preprocessing 3
% 0.20/0.49  
% 0.20/0.49  % (9162)Memory used [KB]: 1535
% 0.20/0.49  % (9162)Time elapsed: 0.003 s
% 0.20/0.49  % (9162)Instructions burned: 3 (million)
% 0.20/0.49  % (9162)------------------------------
% 0.20/0.49  % (9162)------------------------------
% 0.20/0.49  % (9150)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.20/0.50  % (9150)Instruction limit reached!
% 0.20/0.50  % (9150)------------------------------
% 0.20/0.50  % (9150)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (9150)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (9150)Termination reason: Unknown
% 0.20/0.50  % (9150)Termination phase: Preprocessing 3
% 0.20/0.50  
% 0.20/0.50  % (9150)Memory used [KB]: 1535
% 0.20/0.50  % (9150)Time elapsed: 0.003 s
% 0.20/0.50  % (9150)Instructions burned: 3 (million)
% 0.20/0.50  % (9150)------------------------------
% 0.20/0.50  % (9150)------------------------------
% 0.20/0.50  % (9159)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.20/0.50  % (9167)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.20/0.50  % (9154)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.51  % (9175)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.20/0.51  % (9165)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51  % (9156)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.20/0.51  % (9158)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.20/0.51  % (9165)Instruction limit reached!
% 0.20/0.51  % (9165)------------------------------
% 0.20/0.51  % (9165)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (9165)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (9165)Termination reason: Unknown
% 0.20/0.51  % (9165)Termination phase: shuffling
% 0.20/0.51  
% 0.20/0.51  % (9165)Memory used [KB]: 1535
% 0.20/0.51  % (9165)Time elapsed: 0.004 s
% 0.20/0.51  % (9165)Instructions burned: 3 (million)
% 0.20/0.51  % (9165)------------------------------
% 0.20/0.51  % (9165)------------------------------
% 0.20/0.52  % (9153)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.20/0.52  % (9151)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (9168)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.20/0.52  % (9149)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.20/0.52  % (9174)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.20/0.52  % (9172)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.20/0.52  % (9173)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.52  % (9152)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.20/0.52  % (9167)Refutation not found, incomplete strategy% (9167)------------------------------
% 0.20/0.52  % (9167)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (9167)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (9167)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (9167)Memory used [KB]: 6140
% 0.20/0.52  % (9167)Time elapsed: 0.126 s
% 0.20/0.52  % (9167)Instructions burned: 6 (million)
% 0.20/0.52  % (9167)------------------------------
% 0.20/0.52  % (9167)------------------------------
% 0.20/0.53  % (9158)Instruction limit reached!
% 0.20/0.53  % (9158)------------------------------
% 0.20/0.53  % (9158)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (9158)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (9158)Termination reason: Unknown
% 0.20/0.53  % (9158)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (9158)Memory used [KB]: 6268
% 0.20/0.53  % (9158)Time elapsed: 0.131 s
% 0.20/0.53  % (9158)Instructions burned: 12 (million)
% 0.20/0.53  % (9158)------------------------------
% 0.20/0.53  % (9158)------------------------------
% 0.20/0.53  % (9170)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.20/0.53  % (9177)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.20/0.53  % (9152)First to succeed.
% 0.20/0.53  % (9161)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.20/0.53  % (9171)Instruction limit reached!
% 0.20/0.53  % (9171)------------------------------
% 0.20/0.53  % (9171)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (9171)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (9171)Termination reason: Unknown
% 0.20/0.53  % (9171)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (9171)Memory used [KB]: 2302
% 0.20/0.53  % (9171)Time elapsed: 0.136 s
% 0.20/0.53  % (9171)Instructions burned: 46 (million)
% 0.20/0.53  % (9171)------------------------------
% 0.20/0.53  % (9171)------------------------------
% 0.20/0.53  % (9159)Instruction limit reached!
% 0.20/0.53  % (9159)------------------------------
% 0.20/0.53  % (9159)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (9159)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (9159)Termination reason: Unknown
% 0.20/0.53  % (9159)Termination phase: Saturation
% 0.20/0.53  
% 0.20/0.53  % (9159)Memory used [KB]: 6140
% 0.20/0.53  % (9159)Time elapsed: 0.129 s
% 0.20/0.53  % (9159)Instructions burned: 8 (million)
% 0.20/0.53  % (9159)------------------------------
% 0.20/0.53  % (9159)------------------------------
% 0.20/0.53  % (9169)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.20/0.53  % (9176)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.20/0.54  % (9166)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.20/0.54  % (9166)Instruction limit reached!
% 0.20/0.54  % (9166)------------------------------
% 0.20/0.54  % (9166)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (9166)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (9166)Termination reason: Unknown
% 0.20/0.54  % (9166)Termination phase: Unused predicate definition removal
% 0.20/0.54  
% 0.20/0.54  % (9166)Memory used [KB]: 1535
% 0.20/0.54  % (9166)Time elapsed: 0.002 s
% 0.20/0.54  % (9166)Instructions burned: 2 (million)
% 0.20/0.54  % (9166)------------------------------
% 0.20/0.54  % (9166)------------------------------
% 0.20/0.54  % (9157)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.54  % (9176)Instruction limit reached!
% 0.20/0.54  % (9176)------------------------------
% 0.20/0.54  % (9176)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (9176)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (9176)Termination reason: Unknown
% 0.20/0.54  % (9176)Termination phase: Function definition elimination
% 0.20/0.54  
% 0.20/0.54  % (9176)Memory used [KB]: 1791
% 0.20/0.54  % (9176)Time elapsed: 0.006 s
% 0.20/0.54  % (9176)Instructions burned: 8 (million)
% 0.20/0.54  % (9176)------------------------------
% 0.20/0.54  % (9176)------------------------------
% 0.20/0.54  % (9160)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.20/0.54  % (9149)Instruction limit reached!
% 0.20/0.54  % (9149)------------------------------
% 0.20/0.54  % (9149)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (9164)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.20/0.54  % (9153)Instruction limit reached!
% 0.20/0.54  % (9153)------------------------------
% 0.20/0.54  % (9153)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (9155)Instruction limit reached!
% 0.20/0.55  % (9155)------------------------------
% 0.20/0.55  % (9155)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (9149)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (9149)Termination reason: Unknown
% 0.20/0.55  % (9149)Termination phase: Saturation
% 0.20/0.55  
% 0.20/0.55  % (9149)Memory used [KB]: 6524
% 0.20/0.55  % (9149)Time elapsed: 0.145 s
% 0.20/0.55  % (9149)Instructions burned: 14 (million)
% 0.20/0.55  % (9149)------------------------------
% 0.20/0.55  % (9149)------------------------------
% 0.20/0.55  % (9170)Also succeeded, but the first one will report.
% 0.20/0.55  % (9152)Refutation found. Thanks to Tanya!
% 0.20/0.55  % SZS status Theorem for theBenchmark
% 0.20/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55  % (9152)------------------------------
% 0.20/0.55  % (9152)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (9152)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (9152)Termination reason: Refutation
% 0.20/0.55  
% 0.20/0.55  % (9152)Memory used [KB]: 6268
% 0.20/0.55  % (9152)Time elapsed: 0.141 s
% 0.20/0.55  % (9152)Instructions burned: 11 (million)
% 0.20/0.55  % (9152)------------------------------
% 0.20/0.55  % (9152)------------------------------
% 0.20/0.55  % (9144)Success in time 0.2 s
%------------------------------------------------------------------------------