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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC106+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 : n018.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:50 EDT 2022

% Result   : Theorem 0.19s 0.55s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   83 (  10 unt;   0 def)
%            Number of atoms       :  407 (  96 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :  481 ( 157   ~; 140   |; 145   &)
%                                         (  12 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   9 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  107 (  54   !;  53   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f334,plain,
    $false,
    inference(avatar_sat_refutation,[],[f235,f246,f261,f270,f272,f273,f276,f324,f333]) ).

fof(f333,plain,
    ( ~ spl11_4
    | ~ spl11_6
    | ~ spl11_7
    | spl11_9 ),
    inference(avatar_contradiction_clause,[],[f332]) ).

fof(f332,plain,
    ( $false
    | ~ spl11_4
    | ~ spl11_6
    | ~ spl11_7
    | spl11_9 ),
    inference(subsumption_resolution,[],[f331,f309]) ).

fof(f309,plain,
    ( nil != sK2
    | ~ spl11_4
    | ~ spl11_6
    | ~ spl11_7 ),
    inference(subsumption_resolution,[],[f308,f253]) ).

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

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

fof(f308,plain,
    ( ~ ssList(nil)
    | nil != sK2
    | ~ spl11_4
    | ~ spl11_7 ),
    inference(subsumption_resolution,[],[f307,f259]) ).

fof(f259,plain,
    ( ssItem(sK4)
    | ~ spl11_7 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f257,plain,
    ( spl11_7
  <=> ssItem(sK4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).

fof(f307,plain,
    ( nil != sK2
    | ~ ssItem(sK4)
    | ~ ssList(nil)
    | ~ spl11_4 ),
    inference(superposition,[],[f186,f244]) ).

fof(f244,plain,
    ( cons(sK4,nil) = sK2
    | ~ spl11_4 ),
    inference(avatar_component_clause,[],[f242]) ).

fof(f242,plain,
    ( spl11_4
  <=> cons(sK4,nil) = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).

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

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

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

fof(f331,plain,
    ( nil = sK2
    | ~ spl11_6
    | spl11_9 ),
    inference(subsumption_resolution,[],[f330,f253]) ).

fof(f330,plain,
    ( ~ ssList(nil)
    | nil = sK2
    | spl11_9 ),
    inference(subsumption_resolution,[],[f327,f216]) ).

fof(f216,plain,
    ssList(sK2),
    inference(definition_unfolding,[],[f160,f177]) ).

fof(f177,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f139]) ).

fof(f139,plain,
    ( sK0 = sK2
    & ssList(sK3)
    & ( ( neq(sK1,nil)
        & ( ~ neq(sK0,nil)
          | ~ rearsegP(sK1,sK0) )
        & ssItem(sK4)
        & app(sK5,cons(sK4,nil)) = sK3
        & cons(sK4,nil) = sK2
        & ssList(sK5) )
      | ( ~ neq(sK3,nil)
        & neq(sK1,nil) ) )
    & sK3 = sK1
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f107,f138,f137,f136,f135,f134,f133]) ).

fof(f133,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( X0 = X2
                    & ssList(X3)
                    & ( ( neq(X1,nil)
                        & ( ~ neq(X0,nil)
                          | ~ rearsegP(X1,X0) )
                        & ? [X4] :
                            ( ssItem(X4)
                            & ? [X5] :
                                ( app(X5,cons(X4,nil)) = X3
                                & cons(X4,nil) = X2
                                & ssList(X5) ) ) )
                      | ( ~ neq(X3,nil)
                        & neq(X1,nil) ) )
                    & X1 = X3 )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( sK0 = X2
                  & ssList(X3)
                  & ( ( neq(X1,nil)
                      & ( ~ neq(sK0,nil)
                        | ~ rearsegP(X1,sK0) )
                      & ? [X4] :
                          ( ssItem(X4)
                          & ? [X5] :
                              ( app(X5,cons(X4,nil)) = X3
                              & cons(X4,nil) = X2
                              & ssList(X5) ) ) )
                    | ( ~ neq(X3,nil)
                      & neq(X1,nil) ) )
                  & X1 = X3 )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f134,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( sK0 = X2
                & ssList(X3)
                & ( ( neq(X1,nil)
                    & ( ~ neq(sK0,nil)
                      | ~ rearsegP(X1,sK0) )
                    & ? [X4] :
                        ( ssItem(X4)
                        & ? [X5] :
                            ( app(X5,cons(X4,nil)) = X3
                            & cons(X4,nil) = X2
                            & ssList(X5) ) ) )
                  | ( ~ neq(X3,nil)
                    & neq(X1,nil) ) )
                & X1 = X3 )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( sK0 = X2
              & ssList(X3)
              & ( ( neq(sK1,nil)
                  & ( ~ neq(sK0,nil)
                    | ~ rearsegP(sK1,sK0) )
                  & ? [X4] :
                      ( ssItem(X4)
                      & ? [X5] :
                          ( app(X5,cons(X4,nil)) = X3
                          & cons(X4,nil) = X2
                          & ssList(X5) ) ) )
                | ( ~ neq(X3,nil)
                  & neq(sK1,nil) ) )
              & sK1 = X3 )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f135,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( sK0 = X2
            & ssList(X3)
            & ( ( neq(sK1,nil)
                & ( ~ neq(sK0,nil)
                  | ~ rearsegP(sK1,sK0) )
                & ? [X4] :
                    ( ssItem(X4)
                    & ? [X5] :
                        ( app(X5,cons(X4,nil)) = X3
                        & cons(X4,nil) = X2
                        & ssList(X5) ) ) )
              | ( ~ neq(X3,nil)
                & neq(sK1,nil) ) )
            & sK1 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( sK0 = sK2
          & ssList(X3)
          & ( ( neq(sK1,nil)
              & ( ~ neq(sK0,nil)
                | ~ rearsegP(sK1,sK0) )
              & ? [X4] :
                  ( ssItem(X4)
                  & ? [X5] :
                      ( app(X5,cons(X4,nil)) = X3
                      & cons(X4,nil) = sK2
                      & ssList(X5) ) ) )
            | ( ~ neq(X3,nil)
              & neq(sK1,nil) ) )
          & sK1 = X3 )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    ( ? [X3] :
        ( sK0 = sK2
        & ssList(X3)
        & ( ( neq(sK1,nil)
            & ( ~ neq(sK0,nil)
              | ~ rearsegP(sK1,sK0) )
            & ? [X4] :
                ( ssItem(X4)
                & ? [X5] :
                    ( app(X5,cons(X4,nil)) = X3
                    & cons(X4,nil) = sK2
                    & ssList(X5) ) ) )
          | ( ~ neq(X3,nil)
            & neq(sK1,nil) ) )
        & sK1 = X3 )
   => ( sK0 = sK2
      & ssList(sK3)
      & ( ( neq(sK1,nil)
          & ( ~ neq(sK0,nil)
            | ~ rearsegP(sK1,sK0) )
          & ? [X4] :
              ( ssItem(X4)
              & ? [X5] :
                  ( app(X5,cons(X4,nil)) = sK3
                  & cons(X4,nil) = sK2
                  & ssList(X5) ) ) )
        | ( ~ neq(sK3,nil)
          & neq(sK1,nil) ) )
      & sK3 = sK1 ) ),
    introduced(choice_axiom,[]) ).

fof(f137,plain,
    ( ? [X4] :
        ( ssItem(X4)
        & ? [X5] :
            ( app(X5,cons(X4,nil)) = sK3
            & cons(X4,nil) = sK2
            & ssList(X5) ) )
   => ( ssItem(sK4)
      & ? [X5] :
          ( sK3 = app(X5,cons(sK4,nil))
          & cons(sK4,nil) = sK2
          & ssList(X5) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f138,plain,
    ( ? [X5] :
        ( sK3 = app(X5,cons(sK4,nil))
        & cons(sK4,nil) = sK2
        & ssList(X5) )
   => ( app(sK5,cons(sK4,nil)) = sK3
      & cons(sK4,nil) = sK2
      & ssList(sK5) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f106,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ( ~ neq(X0,nil)
                        | ~ rearsegP(X1,X0) )
                      & ? [X4] :
                          ( ? [X5] :
                              ( app(X5,cons(X4,nil)) = X3
                              & cons(X4,nil) = X2
                              & ssList(X5) )
                          & ssItem(X4) ) )
                    | ( ~ neq(X3,nil)
                      & neq(X1,nil) ) )
                  & 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)
                   => ( X1 != X3
                      | X0 != X2
                      | ( ( ~ neq(X1,nil)
                          | ( neq(X0,nil)
                            & rearsegP(X1,X0) )
                          | ! [X4] :
                              ( ssItem(X4)
                             => ! [X5] :
                                  ( ssList(X5)
                                 => ( app(X5,cons(X4,nil)) != X3
                                    | cons(X4,nil) != X2 ) ) ) )
                        & ( neq(X3,nil)
                          | ~ neq(X1,nil) ) ) ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f160,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f139]) ).

fof(f327,plain,
    ( ~ ssList(sK2)
    | nil = sK2
    | ~ ssList(nil)
    | spl11_9 ),
    inference(resolution,[],[f157,f269]) ).

fof(f269,plain,
    ( ~ neq(sK2,nil)
    | spl11_9 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f267,plain,
    ( spl11_9
  <=> neq(sK2,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).

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

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

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

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

fof(f324,plain,
    ( spl11_8
    | ~ spl11_1
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(avatar_split_clause,[],[f321,f242,f237,f228,f263]) ).

fof(f263,plain,
    ( spl11_8
  <=> rearsegP(sK1,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).

fof(f228,plain,
    ( spl11_1
  <=> ssList(sK5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).

fof(f237,plain,
    ( spl11_3
  <=> app(sK5,cons(sK4,nil)) = sK1 ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).

fof(f321,plain,
    ( rearsegP(sK1,sK2)
    | ~ spl11_1
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f320,f230]) ).

fof(f230,plain,
    ( ssList(sK5)
    | ~ spl11_1 ),
    inference(avatar_component_clause,[],[f228]) ).

fof(f320,plain,
    ( ~ ssList(sK5)
    | rearsegP(sK1,sK2)
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f317,f216]) ).

fof(f317,plain,
    ( ~ ssList(sK2)
    | ~ ssList(sK5)
    | rearsegP(sK1,sK2)
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(superposition,[],[f275,f277]) ).

fof(f277,plain,
    ( app(sK5,sK2) = sK1
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(forward_demodulation,[],[f239,f244]) ).

fof(f239,plain,
    ( app(sK5,cons(sK4,nil)) = sK1
    | ~ spl11_3 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f275,plain,
    ! [X2,X1] :
      ( rearsegP(app(X2,X1),X1)
      | ~ ssList(X1)
      | ~ ssList(X2) ),
    inference(subsumption_resolution,[],[f221,f204]) ).

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

fof(f100,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ssList(app(X0,X1))
          | ~ ssList(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(f221,plain,
    ! [X2,X1] :
      ( rearsegP(app(X2,X1),X1)
      | ~ ssList(X1)
      | ~ ssList(app(X2,X1))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f191]) ).

fof(f191,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X0)
      | rearsegP(X0,X1)
      | app(X2,X1) != X0
      | ~ ssList(X2)
      | ~ ssList(X1) ),
    inference(cnf_transformation,[],[f147]) ).

fof(f147,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ( ( rearsegP(X0,X1)
              | ! [X2] :
                  ( app(X2,X1) != X0
                  | ~ ssList(X2) ) )
            & ( ( app(sK8(X0,X1),X1) = X0
                & ssList(sK8(X0,X1)) )
              | ~ rearsegP(X0,X1) ) )
          | ~ ssList(X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f145,f146]) ).

fof(f146,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( app(X3,X1) = X0
          & ssList(X3) )
     => ( app(sK8(X0,X1),X1) = X0
        & ssList(sK8(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f145,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ( ( rearsegP(X0,X1)
              | ! [X2] :
                  ( app(X2,X1) != X0
                  | ~ ssList(X2) ) )
            & ( ? [X3] :
                  ( app(X3,X1) = X0
                  & ssList(X3) )
              | ~ rearsegP(X0,X1) ) )
          | ~ ssList(X1) ) ),
    inference(rectify,[],[f144]) ).

fof(f144,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ( ( rearsegP(X0,X1)
              | ! [X2] :
                  ( app(X2,X1) != X0
                  | ~ ssList(X2) ) )
            & ( ? [X2] :
                  ( app(X2,X1) = X0
                  & ssList(X2) )
              | ~ rearsegP(X0,X1) ) )
          | ~ ssList(X1) ) ),
    inference(nnf_transformation,[],[f114]) ).

fof(f114,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ( rearsegP(X0,X1)
          <=> ? [X2] :
                ( app(X2,X1) = X0
                & ssList(X2) ) )
          | ~ ssList(X1) ) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( rearsegP(X0,X1)
          <=> ? [X2] :
                ( app(X2,X1) = X0
                & ssList(X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).

fof(f276,plain,
    ( spl11_3
    | ~ spl11_2 ),
    inference(avatar_split_clause,[],[f212,f232,f237]) ).

fof(f232,plain,
    ( spl11_2
  <=> neq(sK1,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).

fof(f212,plain,
    ( ~ neq(sK1,nil)
    | app(sK5,cons(sK4,nil)) = sK1 ),
    inference(definition_unfolding,[],[f169,f163,f163]) ).

fof(f163,plain,
    sK3 = sK1,
    inference(cnf_transformation,[],[f139]) ).

fof(f169,plain,
    ( app(sK5,cons(sK4,nil)) = sK3
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f273,plain,
    ( ~ spl11_2
    | spl11_4 ),
    inference(avatar_split_clause,[],[f214,f242,f232]) ).

fof(f214,plain,
    ( cons(sK4,nil) = sK2
    | ~ neq(sK1,nil) ),
    inference(definition_unfolding,[],[f167,f163]) ).

fof(f167,plain,
    ( cons(sK4,nil) = sK2
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f272,plain,
    ( ~ spl11_2
    | spl11_7 ),
    inference(avatar_split_clause,[],[f211,f257,f232]) ).

fof(f211,plain,
    ( ssItem(sK4)
    | ~ neq(sK1,nil) ),
    inference(definition_unfolding,[],[f171,f163]) ).

fof(f171,plain,
    ( ssItem(sK4)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f270,plain,
    ( ~ spl11_8
    | ~ spl11_9
    | ~ spl11_2 ),
    inference(avatar_split_clause,[],[f209,f232,f267,f263]) ).

fof(f209,plain,
    ( ~ neq(sK1,nil)
    | ~ neq(sK2,nil)
    | ~ rearsegP(sK1,sK2) ),
    inference(definition_unfolding,[],[f173,f177,f177,f163]) ).

fof(f173,plain,
    ( ~ neq(sK0,nil)
    | ~ rearsegP(sK1,sK0)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f261,plain,
    spl11_6,
    inference(avatar_split_clause,[],[f196,f252]) ).

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

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

fof(f246,plain,
    spl11_2,
    inference(avatar_split_clause,[],[f226,f232]) ).

fof(f226,plain,
    neq(sK1,nil),
    inference(duplicate_literal_removal,[],[f174]) ).

fof(f174,plain,
    ( neq(sK1,nil)
    | neq(sK1,nil) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f235,plain,
    ( spl11_1
    | ~ spl11_2 ),
    inference(avatar_split_clause,[],[f215,f232,f228]) ).

fof(f215,plain,
    ( ~ neq(sK1,nil)
    | ssList(sK5) ),
    inference(definition_unfolding,[],[f165,f163]) ).

fof(f165,plain,
    ( ssList(sK5)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f139]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC106+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 18:28:25 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.48  % (20600)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.48  % (20600)Instruction limit reached!
% 0.19/0.48  % (20600)------------------------------
% 0.19/0.48  % (20600)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49  % (20608)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.49  % (20592)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.50  % (20600)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (20600)Termination reason: Unknown
% 0.19/0.50  % (20600)Termination phase: Saturation
% 0.19/0.50  
% 0.19/0.50  % (20600)Memory used [KB]: 6140
% 0.19/0.50  % (20600)Time elapsed: 0.089 s
% 0.19/0.50  % (20600)Instructions burned: 7 (million)
% 0.19/0.50  % (20600)------------------------------
% 0.19/0.50  % (20600)------------------------------
% 0.19/0.51  % (20608)Refutation not found, incomplete strategy% (20608)------------------------------
% 0.19/0.51  % (20608)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (20608)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (20608)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51  
% 0.19/0.51  % (20608)Memory used [KB]: 6140
% 0.19/0.51  % (20608)Time elapsed: 0.112 s
% 0.19/0.51  % (20608)Instructions burned: 7 (million)
% 0.19/0.51  % (20608)------------------------------
% 0.19/0.51  % (20608)------------------------------
% 0.19/0.51  % (20612)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.51  % (20594)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.51  % (20605)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  % (20601)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.51  % (20595)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.51  % (20596)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.52  % (20613)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52  % (20589)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.52  % (20597)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.52  % (20593)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52  % (20591)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.52  % (20611)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  % (20604)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.53  % (20610)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (20599)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.53  % (20604)Instruction limit reached!
% 0.19/0.53  % (20604)------------------------------
% 0.19/0.53  % (20604)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (20604)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (20604)Termination reason: Unknown
% 0.19/0.53  % (20604)Termination phase: Property scanning
% 0.19/0.53  
% 0.19/0.53  % (20604)Memory used [KB]: 1791
% 0.19/0.53  % (20604)Time elapsed: 0.004 s
% 0.19/0.53  % (20604)Instructions burned: 7 (million)
% 0.19/0.53  % (20604)------------------------------
% 0.19/0.53  % (20604)------------------------------
% 0.19/0.53  % (20590)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  % (20603)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  % (20606)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.54  % (20606)Instruction limit reached!
% 0.19/0.54  % (20606)------------------------------
% 0.19/0.54  % (20606)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (20606)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (20606)Termination reason: Unknown
% 0.19/0.54  % (20606)Termination phase: Naming
% 0.19/0.54  
% 0.19/0.54  % (20606)Memory used [KB]: 1535
% 0.19/0.54  % (20606)Time elapsed: 0.003 s
% 0.19/0.54  % (20606)Instructions burned: 3 (million)
% 0.19/0.54  % (20606)------------------------------
% 0.19/0.54  % (20606)------------------------------
% 0.19/0.54  % (20598)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.54  % (20601)Instruction limit reached!
% 0.19/0.54  % (20601)------------------------------
% 0.19/0.54  % (20601)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (20601)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (20601)Termination reason: Unknown
% 0.19/0.54  % (20601)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (20601)Memory used [KB]: 2046
% 0.19/0.54  % (20601)Time elapsed: 0.129 s
% 0.19/0.54  % (20601)Instructions burned: 16 (million)
% 0.19/0.54  % (20601)------------------------------
% 0.19/0.54  % (20601)------------------------------
% 0.19/0.54  % (20591)Instruction limit reached!
% 0.19/0.54  % (20591)------------------------------
% 0.19/0.54  % (20591)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (20591)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (20591)Termination reason: Unknown
% 0.19/0.54  % (20591)Termination phase: Naming
% 0.19/0.54  
% 0.19/0.54  % (20591)Memory used [KB]: 1535
% 0.19/0.54  % (20591)Time elapsed: 0.004 s
% 0.19/0.54  % (20591)Instructions burned: 3 (million)
% 0.19/0.54  % (20591)------------------------------
% 0.19/0.54  % (20591)------------------------------
% 0.19/0.54  % (20602)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (20593)First to succeed.
% 0.19/0.54  % (20599)Instruction limit reached!
% 0.19/0.54  % (20599)------------------------------
% 0.19/0.54  % (20599)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (20599)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (20599)Termination reason: Unknown
% 0.19/0.54  % (20599)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (20599)Memory used [KB]: 6268
% 0.19/0.54  % (20599)Time elapsed: 0.135 s
% 0.19/0.54  % (20599)Instructions burned: 13 (million)
% 0.19/0.54  % (20599)------------------------------
% 0.19/0.54  % (20599)------------------------------
% 0.19/0.54  % (20609)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.54  % (20617)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.54  % (20603)Instruction limit reached!
% 0.19/0.54  % (20603)------------------------------
% 0.19/0.54  % (20603)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (20603)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (20603)Termination reason: Unknown
% 0.19/0.54  % (20603)Termination phase: Preprocessing 3
% 0.19/0.54  
% 0.19/0.54  % (20603)Memory used [KB]: 1535
% 0.19/0.54  % (20603)Time elapsed: 0.003 s
% 0.19/0.54  % (20603)Instructions burned: 3 (million)
% 0.19/0.54  % (20603)------------------------------
% 0.19/0.54  % (20603)------------------------------
% 0.19/0.54  % (20615)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54  % (20614)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.54  % (20618)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.54  % (20616)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.55  % (20617)Instruction limit reached!
% 0.19/0.55  % (20617)------------------------------
% 0.19/0.55  % (20617)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (20592)Instruction limit reached!
% 0.19/0.55  % (20592)------------------------------
% 0.19/0.55  % (20592)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (20592)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (20592)Termination reason: Unknown
% 0.19/0.55  % (20592)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (20592)Memory used [KB]: 7036
% 0.19/0.55  % (20592)Time elapsed: 0.130 s
% 0.19/0.55  % (20592)Instructions burned: 52 (million)
% 0.19/0.55  % (20592)------------------------------
% 0.19/0.55  % (20592)------------------------------
% 0.19/0.55  % (20597)Also succeeded, but the first one will report.
% 0.19/0.55  % (20593)Refutation found. Thanks to Tanya!
% 0.19/0.55  % SZS status Theorem for theBenchmark
% 0.19/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.55  % (20593)------------------------------
% 0.19/0.55  % (20593)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (20593)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (20593)Termination reason: Refutation
% 0.19/0.55  
% 0.19/0.55  % (20593)Memory used [KB]: 6140
% 0.19/0.55  % (20593)Time elapsed: 0.145 s
% 0.19/0.55  % (20593)Instructions burned: 6 (million)
% 0.19/0.55  % (20593)------------------------------
% 0.19/0.55  % (20593)------------------------------
% 0.19/0.55  % (20586)Success in time 0.199 s
%------------------------------------------------------------------------------