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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC416+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 : n016.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:41:04 EDT 2022

% Result   : Theorem 1.47s 0.55s
% Output   : Refutation 1.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   24
% Syntax   : Number of formulae    :  108 (  10 unt;   0 def)
%            Number of atoms       :  545 ( 157 equ)
%            Maximal formula atoms :   38 (   5 avg)
%            Number of connectives :  721 ( 284   ~; 266   |; 125   &)
%                                         (  12 <=>;  34  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  11 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :  147 ( 103   !;  44   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f416,plain,
    $false,
    inference(avatar_sat_refutation,[],[f221,f244,f250,f260,f261,f271,f274,f287,f380,f404,f415]) ).

fof(f415,plain,
    ( ~ spl10_13
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(avatar_split_clause,[],[f414,f246,f218,f327]) ).

fof(f327,plain,
    ( spl10_13
  <=> nil = sK4 ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).

fof(f218,plain,
    ( spl10_2
  <=> ssItem(sK7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).

fof(f246,plain,
    ( spl10_8
  <=> app(cons(sK7,nil),sK3) = sK4 ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).

fof(f414,plain,
    ( nil != sK4
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f413,f220]) ).

fof(f220,plain,
    ( ssItem(sK7)
    | ~ spl10_2 ),
    inference(avatar_component_clause,[],[f218]) ).

fof(f413,plain,
    ( nil != sK4
    | ~ ssItem(sK7)
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f364,f155]) ).

fof(f155,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f139]) ).

fof(f139,plain,
    ( ssList(sK4)
    & ssList(sK5)
    & sK5 = sK3
    & ( ( ssItem(sK7)
        & app(cons(sK7,nil),sK5) = sK6
        & ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( ~ ssList(X6)
                | ! [X7] :
                    ( hd(sK4) != X7
                    | ~ neq(nil,sK4)
                    | cons(X7,nil) != X6
                    | ~ ssItem(X7) )
                | app(X6,sK3) != X5 )
            | sK4 != X5 )
        & neq(sK4,nil) )
      | ( neq(sK4,nil)
        & ~ neq(sK6,nil) ) )
    & ssList(sK6)
    & sK6 = sK4
    & ssList(sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7])],[f108,f138,f137,f136,f135,f134]) ).

fof(f134,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( X0 = X2
                    & ( ( ? [X4] :
                            ( ssItem(X4)
                            & app(cons(X4,nil),X2) = X3 )
                        & ! [X5] :
                            ( ~ ssList(X5)
                            | ! [X6] :
                                ( ~ ssList(X6)
                                | ! [X7] :
                                    ( hd(X1) != X7
                                    | ~ neq(nil,X1)
                                    | cons(X7,nil) != X6
                                    | ~ ssItem(X7) )
                                | app(X6,X0) != X5 )
                            | X1 != X5 )
                        & neq(X1,nil) )
                      | ( neq(X1,nil)
                        & ~ neq(X3,nil) ) )
                    & ssList(X3)
                    & X1 = X3 ) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( sK3 = X2
                  & ( ( ? [X4] :
                          ( ssItem(X4)
                          & app(cons(X4,nil),X2) = X3 )
                      & ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | ! [X7] :
                                  ( hd(X1) != X7
                                  | ~ neq(nil,X1)
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X6,sK3) != X5 )
                          | X1 != X5 )
                      & neq(X1,nil) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3)
                  & X1 = X3 ) ) )
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f135,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( sK3 = X2
                & ( ( ? [X4] :
                        ( ssItem(X4)
                        & app(cons(X4,nil),X2) = X3 )
                    & ! [X5] :
                        ( ~ ssList(X5)
                        | ! [X6] :
                            ( ~ ssList(X6)
                            | ! [X7] :
                                ( hd(X1) != X7
                                | ~ neq(nil,X1)
                                | cons(X7,nil) != X6
                                | ~ ssItem(X7) )
                            | app(X6,sK3) != X5 )
                        | X1 != X5 )
                    & neq(X1,nil) )
                  | ( neq(X1,nil)
                    & ~ neq(X3,nil) ) )
                & ssList(X3)
                & X1 = X3 ) ) )
   => ( ssList(sK4)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( sK3 = X2
              & ( ( ? [X4] :
                      ( ssItem(X4)
                      & app(cons(X4,nil),X2) = X3 )
                  & ! [X5] :
                      ( ~ ssList(X5)
                      | ! [X6] :
                          ( ~ ssList(X6)
                          | ! [X7] :
                              ( hd(sK4) != X7
                              | ~ neq(nil,sK4)
                              | cons(X7,nil) != X6
                              | ~ ssItem(X7) )
                          | app(X6,sK3) != X5 )
                      | sK4 != X5 )
                  & neq(sK4,nil) )
                | ( neq(sK4,nil)
                  & ~ neq(X3,nil) ) )
              & ssList(X3)
              & sK4 = X3 ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( sK3 = X2
            & ( ( ? [X4] :
                    ( ssItem(X4)
                    & app(cons(X4,nil),X2) = X3 )
                & ! [X5] :
                    ( ~ ssList(X5)
                    | ! [X6] :
                        ( ~ ssList(X6)
                        | ! [X7] :
                            ( hd(sK4) != X7
                            | ~ neq(nil,sK4)
                            | cons(X7,nil) != X6
                            | ~ ssItem(X7) )
                        | app(X6,sK3) != X5 )
                    | sK4 != X5 )
                & neq(sK4,nil) )
              | ( neq(sK4,nil)
                & ~ neq(X3,nil) ) )
            & ssList(X3)
            & sK4 = X3 ) )
   => ( ssList(sK5)
      & ? [X3] :
          ( sK5 = sK3
          & ( ( ? [X4] :
                  ( ssItem(X4)
                  & app(cons(X4,nil),sK5) = X3 )
              & ! [X5] :
                  ( ~ ssList(X5)
                  | ! [X6] :
                      ( ~ ssList(X6)
                      | ! [X7] :
                          ( hd(sK4) != X7
                          | ~ neq(nil,sK4)
                          | cons(X7,nil) != X6
                          | ~ ssItem(X7) )
                      | app(X6,sK3) != X5 )
                  | sK4 != X5 )
              & neq(sK4,nil) )
            | ( neq(sK4,nil)
              & ~ neq(X3,nil) ) )
          & ssList(X3)
          & sK4 = X3 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f137,plain,
    ( ? [X3] :
        ( sK5 = sK3
        & ( ( ? [X4] :
                ( ssItem(X4)
                & app(cons(X4,nil),sK5) = X3 )
            & ! [X5] :
                ( ~ ssList(X5)
                | ! [X6] :
                    ( ~ ssList(X6)
                    | ! [X7] :
                        ( hd(sK4) != X7
                        | ~ neq(nil,sK4)
                        | cons(X7,nil) != X6
                        | ~ ssItem(X7) )
                    | app(X6,sK3) != X5 )
                | sK4 != X5 )
            & neq(sK4,nil) )
          | ( neq(sK4,nil)
            & ~ neq(X3,nil) ) )
        & ssList(X3)
        & sK4 = X3 )
   => ( sK5 = sK3
      & ( ( ? [X4] :
              ( ssItem(X4)
              & app(cons(X4,nil),sK5) = sK6 )
          & ! [X5] :
              ( ~ ssList(X5)
              | ! [X6] :
                  ( ~ ssList(X6)
                  | ! [X7] :
                      ( hd(sK4) != X7
                      | ~ neq(nil,sK4)
                      | cons(X7,nil) != X6
                      | ~ ssItem(X7) )
                  | app(X6,sK3) != X5 )
              | sK4 != X5 )
          & neq(sK4,nil) )
        | ( neq(sK4,nil)
          & ~ neq(sK6,nil) ) )
      & ssList(sK6)
      & sK6 = sK4 ) ),
    introduced(choice_axiom,[]) ).

fof(f138,plain,
    ( ? [X4] :
        ( ssItem(X4)
        & app(cons(X4,nil),sK5) = sK6 )
   => ( ssItem(sK7)
      & app(cons(sK7,nil),sK5) = sK6 ) ),
    introduced(choice_axiom,[]) ).

fof(f108,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X0 = X2
                  & ( ( ? [X4] :
                          ( ssItem(X4)
                          & app(cons(X4,nil),X2) = X3 )
                      & ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | ! [X7] :
                                  ( hd(X1) != X7
                                  | ~ neq(nil,X1)
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X6,X0) != X5 )
                          | X1 != X5 )
                      & neq(X1,nil) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3)
                  & X1 = X3 ) ) )
      & ssList(X0) ),
    inference(flattening,[],[f107]) ).

fof(f107,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & X1 = X3
                  & ( ( ? [X4] :
                          ( ssItem(X4)
                          & app(cons(X4,nil),X2) = X3 )
                      & ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | ! [X7] :
                                  ( hd(X1) != X7
                                  | ~ neq(nil,X1)
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7) )
                              | app(X6,X0) != X5 )
                          | X1 != X5 )
                      & neq(X1,nil) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & 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
                      | ( ( neq(X3,nil)
                          | ~ neq(X1,nil) )
                        & ( ! [X4] :
                              ( ssItem(X4)
                             => app(cons(X4,nil),X2) != X3 )
                          | ? [X5] :
                              ( ? [X6] :
                                  ( app(X6,X0) = X5
                                  & ? [X7] :
                                      ( hd(X1) = X7
                                      & neq(nil,X1)
                                      & cons(X7,nil) = X6
                                      & ssItem(X7) )
                                  & ssList(X6) )
                              & ssList(X5)
                              & X1 = X5 )
                          | ~ neq(X1,nil) ) ) ) ) ) ) ),
    inference(rectify,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X0 != X2
                      | ( ( ! [X7] :
                              ( ssItem(X7)
                             => app(cons(X7,nil),X2) != X3 )
                          | ~ neq(X1,nil)
                          | ? [X4] :
                              ( ? [X5] :
                                  ( app(X5,X0) = X4
                                  & ssList(X5)
                                  & ? [X6] :
                                      ( neq(nil,X1)
                                      & cons(X6,nil) = X5
                                      & ssItem(X6)
                                      & hd(X1) = X6 ) )
                              & ssList(X4)
                              & X1 = X4 ) )
                        & ( neq(X3,nil)
                          | ~ neq(X1,nil) ) )
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f364,plain,
    ( ~ ssList(sK3)
    | nil != sK4
    | ~ ssItem(sK7)
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(superposition,[],[f183,f357]) ).

fof(f357,plain,
    ( cons(sK7,sK3) = sK4
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f356,f155]) ).

fof(f356,plain,
    ( ~ ssList(sK3)
    | cons(sK7,sK3) = sK4
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f346,f220]) ).

fof(f346,plain,
    ( cons(sK7,sK3) = sK4
    | ~ ssItem(sK7)
    | ~ ssList(sK3)
    | ~ spl10_8 ),
    inference(superposition,[],[f188,f248]) ).

fof(f248,plain,
    ( app(cons(sK7,nil),sK3) = sK4
    | ~ spl10_8 ),
    inference(avatar_component_clause,[],[f246]) ).

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

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

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

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

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

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

fof(f404,plain,
    ( spl10_13
    | spl10_6
    | ~ spl10_9 ),
    inference(avatar_split_clause,[],[f403,f252,f236,f327]) ).

fof(f236,plain,
    ( spl10_6
  <=> neq(nil,sK4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).

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

fof(f403,plain,
    ( nil = sK4
    | spl10_6
    | ~ spl10_9 ),
    inference(subsumption_resolution,[],[f394,f253]) ).

fof(f253,plain,
    ( ssList(nil)
    | ~ spl10_9 ),
    inference(avatar_component_clause,[],[f252]) ).

fof(f394,plain,
    ( ~ ssList(nil)
    | nil = sK4
    | spl10_6 ),
    inference(subsumption_resolution,[],[f383,f168]) ).

fof(f168,plain,
    ssList(sK4),
    inference(cnf_transformation,[],[f139]) ).

fof(f383,plain,
    ( ~ ssList(sK4)
    | ~ ssList(nil)
    | nil = sK4
    | spl10_6 ),
    inference(resolution,[],[f238,f146]) ).

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

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

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

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

fof(f238,plain,
    ( ~ neq(nil,sK4)
    | spl10_6 ),
    inference(avatar_component_clause,[],[f236]) ).

fof(f380,plain,
    ( ~ spl10_2
    | spl10_4
    | ~ spl10_8 ),
    inference(avatar_contradiction_clause,[],[f379]) ).

fof(f379,plain,
    ( $false
    | ~ spl10_2
    | spl10_4
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f370,f248]) ).

fof(f370,plain,
    ( app(cons(sK7,nil),sK3) != sK4
    | ~ spl10_2
    | spl10_4
    | ~ spl10_8 ),
    inference(backward_demodulation,[],[f230,f367]) ).

fof(f367,plain,
    ( sK7 = hd(sK4)
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f366,f155]) ).

fof(f366,plain,
    ( sK7 = hd(sK4)
    | ~ ssList(sK3)
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(subsumption_resolution,[],[f362,f220]) ).

fof(f362,plain,
    ( ~ ssItem(sK7)
    | sK7 = hd(sK4)
    | ~ ssList(sK3)
    | ~ spl10_2
    | ~ spl10_8 ),
    inference(superposition,[],[f182,f357]) ).

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

fof(f122,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssItem(X1)
          | hd(cons(X1,X0)) = X1 ) ),
    inference(ennf_transformation,[],[f23]) ).

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

fof(f230,plain,
    ( app(cons(hd(sK4),nil),sK3) != sK4
    | spl10_4 ),
    inference(avatar_component_clause,[],[f228]) ).

fof(f228,plain,
    ( spl10_4
  <=> app(cons(hd(sK4),nil),sK3) = sK4 ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).

fof(f287,plain,
    ( ~ spl10_1
    | spl10_5
    | ~ spl10_9 ),
    inference(avatar_contradiction_clause,[],[f286]) ).

fof(f286,plain,
    ( $false
    | ~ spl10_1
    | spl10_5
    | ~ spl10_9 ),
    inference(subsumption_resolution,[],[f285,f253]) ).

fof(f285,plain,
    ( ~ ssList(nil)
    | ~ spl10_1
    | spl10_5 ),
    inference(resolution,[],[f281,f209]) ).

fof(f209,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f199]) ).

fof(f199,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f147]) ).

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

fof(f281,plain,
    ( neq(nil,nil)
    | ~ spl10_1
    | spl10_5 ),
    inference(backward_demodulation,[],[f215,f276]) ).

fof(f276,plain,
    ( nil = sK4
    | spl10_5 ),
    inference(subsumption_resolution,[],[f275,f168]) ).

fof(f275,plain,
    ( ~ ssList(sK4)
    | nil = sK4
    | spl10_5 ),
    inference(resolution,[],[f234,f170]) ).

fof(f170,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f110]) ).

fof(f110,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(flattening,[],[f109]) ).

fof(f109,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).

fof(f234,plain,
    ( ~ ssItem(hd(sK4))
    | spl10_5 ),
    inference(avatar_component_clause,[],[f232]) ).

fof(f232,plain,
    ( spl10_5
  <=> ssItem(hd(sK4)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).

fof(f215,plain,
    ( neq(sK4,nil)
    | ~ spl10_1 ),
    inference(avatar_component_clause,[],[f214]) ).

fof(f214,plain,
    ( spl10_1
  <=> neq(sK4,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).

fof(f274,plain,
    ( ~ spl10_5
    | spl10_7
    | ~ spl10_9 ),
    inference(avatar_split_clause,[],[f273,f252,f240,f232]) ).

fof(f240,plain,
    ( spl10_7
  <=> ssList(cons(hd(sK4),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).

fof(f273,plain,
    ( ~ ssItem(hd(sK4))
    | spl10_7
    | ~ spl10_9 ),
    inference(subsumption_resolution,[],[f272,f253]) ).

fof(f272,plain,
    ( ~ ssList(nil)
    | ~ ssItem(hd(sK4))
    | spl10_7 ),
    inference(resolution,[],[f190,f242]) ).

fof(f242,plain,
    ( ~ ssList(cons(hd(sK4),nil))
    | spl10_7 ),
    inference(avatar_component_clause,[],[f240]) ).

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

fof(f125,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/sandbox2/benchmark/theBenchmark.p',ax16) ).

fof(f271,plain,
    ( ~ spl10_7
    | spl10_3 ),
    inference(avatar_split_clause,[],[f270,f224,f240]) ).

fof(f224,plain,
    ( spl10_3
  <=> ssList(app(cons(hd(sK4),nil),sK3)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).

fof(f270,plain,
    ( ~ ssList(cons(hd(sK4),nil))
    | spl10_3 ),
    inference(subsumption_resolution,[],[f262,f155]) ).

fof(f262,plain,
    ( ~ ssList(cons(hd(sK4),nil))
    | ~ ssList(sK3)
    | spl10_3 ),
    inference(resolution,[],[f189,f226]) ).

fof(f226,plain,
    ( ~ ssList(app(cons(hd(sK4),nil),sK3))
    | spl10_3 ),
    inference(avatar_component_clause,[],[f224]) ).

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

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

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

fof(f261,plain,
    spl10_9,
    inference(avatar_split_clause,[],[f169,f252]) ).

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

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

fof(f260,plain,
    ( ~ spl10_1
    | spl10_8 ),
    inference(avatar_split_clause,[],[f195,f246,f214]) ).

fof(f195,plain,
    ( app(cons(sK7,nil),sK3) = sK4
    | ~ neq(sK4,nil) ),
    inference(definition_unfolding,[],[f162,f166,f156,f156]) ).

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

fof(f166,plain,
    sK5 = sK3,
    inference(cnf_transformation,[],[f139]) ).

fof(f162,plain,
    ( app(cons(sK7,nil),sK5) = sK6
    | ~ neq(sK6,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f250,plain,
    spl10_1,
    inference(avatar_split_clause,[],[f212,f214]) ).

fof(f212,plain,
    neq(sK4,nil),
    inference(duplicate_literal_removal,[],[f159]) ).

fof(f159,plain,
    ( neq(sK4,nil)
    | neq(sK4,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f244,plain,
    ( ~ spl10_6
    | ~ spl10_3
    | ~ spl10_7
    | ~ spl10_1
    | ~ spl10_4
    | ~ spl10_5 ),
    inference(avatar_split_clause,[],[f205,f232,f228,f214,f240,f224,f236]) ).

fof(f205,plain,
    ( ~ ssItem(hd(sK4))
    | app(cons(hd(sK4),nil),sK3) != sK4
    | ~ neq(sK4,nil)
    | ~ ssList(cons(hd(sK4),nil))
    | ~ ssList(app(cons(hd(sK4),nil),sK3))
    | ~ neq(nil,sK4) ),
    inference(equality_resolution,[],[f204]) ).

fof(f204,plain,
    ! [X5] :
      ( ~ ssList(X5)
      | ~ ssList(cons(hd(sK4),nil))
      | ~ neq(nil,sK4)
      | ~ ssItem(hd(sK4))
      | app(cons(hd(sK4),nil),sK3) != X5
      | sK4 != X5
      | ~ neq(sK4,nil) ),
    inference(equality_resolution,[],[f203]) ).

fof(f203,plain,
    ! [X6,X5] :
      ( ~ ssList(X5)
      | ~ ssList(X6)
      | ~ neq(nil,sK4)
      | cons(hd(sK4),nil) != X6
      | ~ ssItem(hd(sK4))
      | app(X6,sK3) != X5
      | sK4 != X5
      | ~ neq(sK4,nil) ),
    inference(equality_resolution,[],[f196]) ).

fof(f196,plain,
    ! [X6,X7,X5] :
      ( ~ ssList(X5)
      | ~ ssList(X6)
      | hd(sK4) != X7
      | ~ neq(nil,sK4)
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X6,sK3) != X5
      | sK4 != X5
      | ~ neq(sK4,nil) ),
    inference(definition_unfolding,[],[f160,f156]) ).

fof(f160,plain,
    ! [X6,X7,X5] :
      ( ~ ssList(X5)
      | ~ ssList(X6)
      | hd(sK4) != X7
      | ~ neq(nil,sK4)
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | app(X6,sK3) != X5
      | sK4 != X5
      | ~ neq(sK6,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f221,plain,
    ( ~ spl10_1
    | spl10_2 ),
    inference(avatar_split_clause,[],[f193,f218,f214]) ).

fof(f193,plain,
    ( ssItem(sK7)
    | ~ neq(sK4,nil) ),
    inference(definition_unfolding,[],[f164,f156]) ).

fof(f164,plain,
    ( ssItem(sK7)
    | ~ neq(sK6,nil) ),
    inference(cnf_transformation,[],[f139]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34  % Computer : n016.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 19:17:31 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (20883)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50  % (20892)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51  % (20879)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (20876)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.51  % (20880)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51  % (20884)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.51  % (20893)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52  % (20889)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (20893)Instruction limit reached!
% 0.19/0.52  % (20893)------------------------------
% 0.19/0.52  % (20893)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (20893)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (20893)Termination reason: Unknown
% 0.19/0.52  % (20893)Termination phase: Preprocessing 3
% 0.19/0.52  
% 0.19/0.52  % (20893)Memory used [KB]: 1663
% 0.19/0.52  % (20893)Time elapsed: 0.005 s
% 0.19/0.52  % (20893)Instructions burned: 4 (million)
% 0.19/0.52  % (20893)------------------------------
% 0.19/0.52  % (20893)------------------------------
% 0.19/0.52  % (20882)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.52  % (20898)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.53  % (20901)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.53  % (20904)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53  % (20890)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.53  % (20878)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.53  % (20877)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.53  % (20878)Instruction limit reached!
% 0.19/0.53  % (20878)------------------------------
% 0.19/0.53  % (20878)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (20878)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (20878)Termination reason: Unknown
% 0.19/0.53  % (20878)Termination phase: Preprocessing 3
% 0.19/0.53  
% 0.19/0.53  % (20878)Memory used [KB]: 1663
% 0.19/0.53  % (20878)Time elapsed: 0.003 s
% 0.19/0.53  % (20878)Instructions burned: 4 (million)
% 0.19/0.53  % (20878)------------------------------
% 0.19/0.53  % (20878)------------------------------
% 0.19/0.53  % (20890)Instruction limit reached!
% 0.19/0.53  % (20890)------------------------------
% 0.19/0.53  % (20890)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (20890)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (20890)Termination reason: Unknown
% 0.19/0.53  % (20890)Termination phase: Preprocessing 3
% 0.19/0.53  
% 0.19/0.53  % (20890)Memory used [KB]: 1663
% 0.19/0.53  % (20890)Time elapsed: 0.003 s
% 0.19/0.53  % (20890)Instructions burned: 5 (million)
% 0.19/0.53  % (20890)------------------------------
% 0.19/0.53  % (20890)------------------------------
% 0.19/0.53  % (20905)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.53  % (20904)Instruction limit reached!
% 0.19/0.53  % (20904)------------------------------
% 0.19/0.53  % (20904)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (20904)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (20904)Termination reason: Unknown
% 0.19/0.53  % (20904)Termination phase: Property scanning
% 0.19/0.53  
% 0.19/0.53  % (20904)Memory used [KB]: 1791
% 0.19/0.53  % (20904)Time elapsed: 0.005 s
% 0.19/0.53  % (20904)Instructions burned: 9 (million)
% 0.19/0.53  % (20904)------------------------------
% 0.19/0.53  % (20904)------------------------------
% 0.19/0.53  % (20881)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.53  % (20896)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.53  % (20891)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.47/0.53  % (20887)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.47/0.54  % (20895)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 1.47/0.54  % (20885)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 1.47/0.54  % (20895)Refutation not found, incomplete strategy% (20895)------------------------------
% 1.47/0.54  % (20895)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.54  % (20895)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.54  % (20895)Termination reason: Refutation not found, incomplete strategy
% 1.47/0.54  
% 1.47/0.54  % (20895)Memory used [KB]: 6140
% 1.47/0.54  % (20895)Time elapsed: 0.137 s
% 1.47/0.54  % (20895)Instructions burned: 6 (million)
% 1.47/0.54  % (20895)------------------------------
% 1.47/0.54  % (20895)------------------------------
% 1.47/0.54  % (20899)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.47/0.54  % (20902)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.47/0.54  % (20897)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.47/0.54  % (20880)Instruction limit reached!
% 1.47/0.54  % (20880)------------------------------
% 1.47/0.54  % (20880)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.54  % (20880)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.54  % (20880)Termination reason: Unknown
% 1.47/0.54  % (20880)Termination phase: Saturation
% 1.47/0.54  
% 1.47/0.54  % (20880)Memory used [KB]: 6268
% 1.47/0.54  % (20880)Time elapsed: 0.134 s
% 1.47/0.54  % (20880)Instructions burned: 14 (million)
% 1.47/0.54  % (20880)------------------------------
% 1.47/0.54  % (20880)------------------------------
% 1.47/0.54  % (20900)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.47/0.54  % (20903)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 1.47/0.54  % (20887)Instruction limit reached!
% 1.47/0.54  % (20887)------------------------------
% 1.47/0.54  % (20887)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.54  % (20887)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.54  % (20887)Termination reason: Unknown
% 1.47/0.54  % (20887)Termination phase: Saturation
% 1.47/0.54  
% 1.47/0.54  % (20887)Memory used [KB]: 6140
% 1.47/0.54  % (20887)Time elapsed: 0.151 s
% 1.47/0.54  % (20887)Instructions burned: 8 (million)
% 1.47/0.54  % (20887)------------------------------
% 1.47/0.54  % (20887)------------------------------
% 1.47/0.55  % (20886)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.47/0.55  % (20894)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.47/0.55  % (20888)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.47/0.55  % (20894)Instruction limit reached!
% 1.47/0.55  % (20894)------------------------------
% 1.47/0.55  % (20894)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.55  % (20894)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.55  % (20894)Termination reason: Unknown
% 1.47/0.55  % (20894)Termination phase: Preprocessing 3
% 1.47/0.55  
% 1.47/0.55  % (20894)Memory used [KB]: 1535
% 1.47/0.55  % (20894)Time elapsed: 0.002 s
% 1.47/0.55  % (20894)Instructions burned: 3 (million)
% 1.47/0.55  % (20894)------------------------------
% 1.47/0.55  % (20894)------------------------------
% 1.47/0.55  % (20882)First to succeed.
% 1.47/0.55  % (20877)Instruction limit reached!
% 1.47/0.55  % (20877)------------------------------
% 1.47/0.55  % (20877)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.55  % (20877)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.55  % (20877)Termination reason: Unknown
% 1.47/0.55  % (20877)Termination phase: Saturation
% 1.47/0.55  
% 1.47/0.55  % (20877)Memory used [KB]: 6396
% 1.47/0.55  % (20877)Time elapsed: 0.144 s
% 1.47/0.55  % (20877)Instructions burned: 13 (million)
% 1.47/0.55  % (20877)------------------------------
% 1.47/0.55  % (20877)------------------------------
% 1.47/0.55  % (20882)Refutation found. Thanks to Tanya!
% 1.47/0.55  % SZS status Theorem for theBenchmark
% 1.47/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 1.61/0.55  % (20882)------------------------------
% 1.61/0.55  % (20882)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.61/0.55  % (20882)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.61/0.55  % (20882)Termination reason: Refutation
% 1.61/0.55  
% 1.61/0.55  % (20882)Memory used [KB]: 6140
% 1.61/0.55  % (20882)Time elapsed: 0.116 s
% 1.61/0.55  % (20882)Instructions burned: 8 (million)
% 1.61/0.55  % (20882)------------------------------
% 1.61/0.55  % (20882)------------------------------
% 1.61/0.55  % (20875)Success in time 0.195 s
%------------------------------------------------------------------------------