TSTP Solution File: SWC218+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWC218+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_sat --cores 0 -t %d %s

% Computer : n027.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:42:27 EDT 2022

% Result   : Theorem 1.77s 0.58s
% Output   : Refutation 1.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   82 (  14 unt;   0 def)
%            Number of atoms       :  375 ( 117 equ)
%            Maximal formula atoms :   24 (   4 avg)
%            Number of connectives :  416 ( 123   ~; 108   |; 142   &)
%                                         (  12 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   7 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :  126 (  58   !;  68   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f764,plain,
    $false,
    inference(avatar_sat_refutation,[],[f608,f637,f642,f675,f681,f709,f761]) ).

fof(f761,plain,
    ( ~ spl60_1
    | ~ spl60_9 ),
    inference(avatar_contradiction_clause,[],[f760]) ).

fof(f760,plain,
    ( $false
    | ~ spl60_1
    | ~ spl60_9 ),
    inference(subsumption_resolution,[],[f759,f378]) ).

fof(f378,plain,
    ~ singletonP(nil),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,axiom,
    ~ singletonP(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax39) ).

fof(f759,plain,
    ( singletonP(nil)
    | ~ spl60_1
    | ~ spl60_9 ),
    inference(subsumption_resolution,[],[f758,f601]) ).

fof(f601,plain,
    ( ssList(nil)
    | ~ spl60_1 ),
    inference(avatar_component_clause,[],[f600]) ).

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

fof(f758,plain,
    ( ~ ssList(nil)
    | singletonP(nil)
    | ~ spl60_9 ),
    inference(subsumption_resolution,[],[f741,f523]) ).

fof(f523,plain,
    ssItem(sK49),
    inference(cnf_transformation,[],[f329]) ).

fof(f329,plain,
    ( ssList(sK44)
    & ~ neq(sK43,nil)
    & sK44 = sK46
    & ssList(sK47)
    & ssList(sK48)
    & sK46 = app(sK47,sK48)
    & app(app(sK47,cons(sK49,nil)),sK48) = sK45
    & ssItem(sK49)
    & ssList(sK46)
    & sK43 = sK45
    & ssList(sK45)
    & ssList(sK43) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44,sK45,sK46,sK47,sK48,sK49])],[f121,f328,f327,f326,f325,f324,f323,f322]) ).

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

fof(f323,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ~ neq(sK43,nil)
                & X1 = X3
                & ? [X4] :
                    ( ssList(X4)
                    & ? [X5] :
                        ( ssList(X5)
                        & app(X4,X5) = X3
                        & ? [X6] :
                            ( app(app(X4,cons(X6,nil)),X5) = X2
                            & ssItem(X6) ) ) )
                & ssList(X3)
                & sK43 = X2 )
            & ssList(X2) ) )
   => ( ssList(sK44)
      & ? [X2] :
          ( ? [X3] :
              ( ~ neq(sK43,nil)
              & sK44 = X3
              & ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(X4,X5) = X3
                      & ? [X6] :
                          ( app(app(X4,cons(X6,nil)),X5) = X2
                          & ssItem(X6) ) ) )
              & ssList(X3)
              & sK43 = X2 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f324,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ neq(sK43,nil)
            & sK44 = X3
            & ? [X4] :
                ( ssList(X4)
                & ? [X5] :
                    ( ssList(X5)
                    & app(X4,X5) = X3
                    & ? [X6] :
                        ( app(app(X4,cons(X6,nil)),X5) = X2
                        & ssItem(X6) ) ) )
            & ssList(X3)
            & sK43 = X2 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ neq(sK43,nil)
          & sK44 = X3
          & ? [X4] :
              ( ssList(X4)
              & ? [X5] :
                  ( ssList(X5)
                  & app(X4,X5) = X3
                  & ? [X6] :
                      ( app(app(X4,cons(X6,nil)),X5) = sK45
                      & ssItem(X6) ) ) )
          & ssList(X3)
          & sK43 = sK45 )
      & ssList(sK45) ) ),
    introduced(choice_axiom,[]) ).

fof(f325,plain,
    ( ? [X3] :
        ( ~ neq(sK43,nil)
        & sK44 = X3
        & ? [X4] :
            ( ssList(X4)
            & ? [X5] :
                ( ssList(X5)
                & app(X4,X5) = X3
                & ? [X6] :
                    ( app(app(X4,cons(X6,nil)),X5) = sK45
                    & ssItem(X6) ) ) )
        & ssList(X3)
        & sK43 = sK45 )
   => ( ~ neq(sK43,nil)
      & sK44 = sK46
      & ? [X4] :
          ( ssList(X4)
          & ? [X5] :
              ( ssList(X5)
              & app(X4,X5) = sK46
              & ? [X6] :
                  ( app(app(X4,cons(X6,nil)),X5) = sK45
                  & ssItem(X6) ) ) )
      & ssList(sK46)
      & sK43 = sK45 ) ),
    introduced(choice_axiom,[]) ).

fof(f326,plain,
    ( ? [X4] :
        ( ssList(X4)
        & ? [X5] :
            ( ssList(X5)
            & app(X4,X5) = sK46
            & ? [X6] :
                ( app(app(X4,cons(X6,nil)),X5) = sK45
                & ssItem(X6) ) ) )
   => ( ssList(sK47)
      & ? [X5] :
          ( ssList(X5)
          & sK46 = app(sK47,X5)
          & ? [X6] :
              ( sK45 = app(app(sK47,cons(X6,nil)),X5)
              & ssItem(X6) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f327,plain,
    ( ? [X5] :
        ( ssList(X5)
        & sK46 = app(sK47,X5)
        & ? [X6] :
            ( sK45 = app(app(sK47,cons(X6,nil)),X5)
            & ssItem(X6) ) )
   => ( ssList(sK48)
      & sK46 = app(sK47,sK48)
      & ? [X6] :
          ( sK45 = app(app(sK47,cons(X6,nil)),sK48)
          & ssItem(X6) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f328,plain,
    ( ? [X6] :
        ( sK45 = app(app(sK47,cons(X6,nil)),sK48)
        & ssItem(X6) )
   => ( app(app(sK47,cons(sK49,nil)),sK48) = sK45
      & ssItem(sK49) ) ),
    introduced(choice_axiom,[]) ).

fof(f121,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ~ neq(X0,nil)
                  & X1 = X3
                  & ? [X4] :
                      ( ssList(X4)
                      & ? [X5] :
                          ( ssList(X5)
                          & app(X4,X5) = X3
                          & ? [X6] :
                              ( app(app(X4,cons(X6,nil)),X5) = X2
                              & ssItem(X6) ) ) )
                  & ssList(X3)
                  & X0 = X2 )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f120]) ).

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

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

fof(f741,plain,
    ( ~ ssItem(sK49)
    | singletonP(nil)
    | ~ ssList(nil)
    | ~ spl60_9 ),
    inference(superposition,[],[f588,f668]) ).

fof(f668,plain,
    ( nil = cons(sK49,nil)
    | ~ spl60_9 ),
    inference(avatar_component_clause,[],[f666]) ).

fof(f666,plain,
    ( spl60_9
  <=> nil = cons(sK49,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_9])]) ).

fof(f588,plain,
    ! [X1] :
      ( ~ ssList(cons(X1,nil))
      | singletonP(cons(X1,nil))
      | ~ ssItem(X1) ),
    inference(equality_resolution,[],[f534]) ).

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

fof(f333,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( singletonP(X0)
          | ! [X1] :
              ( ~ ssItem(X1)
              | cons(X1,nil) != X0 ) )
        & ( ( ssItem(sK50(X0))
            & cons(sK50(X0),nil) = X0 )
          | ~ singletonP(X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK50])],[f331,f332]) ).

fof(f332,plain,
    ! [X0] :
      ( ? [X2] :
          ( ssItem(X2)
          & cons(X2,nil) = X0 )
     => ( ssItem(sK50(X0))
        & cons(sK50(X0),nil) = X0 ) ),
    introduced(choice_axiom,[]) ).

fof(f331,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( singletonP(X0)
          | ! [X1] :
              ( ~ ssItem(X1)
              | cons(X1,nil) != X0 ) )
        & ( ? [X2] :
              ( ssItem(X2)
              & cons(X2,nil) = X0 )
          | ~ singletonP(X0) ) ) ),
    inference(rectify,[],[f330]) ).

fof(f330,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( singletonP(X0)
          | ! [X1] :
              ( ~ ssItem(X1)
              | cons(X1,nil) != X0 ) )
        & ( ? [X1] :
              ( ssItem(X1)
              & cons(X1,nil) = X0 )
          | ~ singletonP(X0) ) ) ),
    inference(nnf_transformation,[],[f108]) ).

fof(f108,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( singletonP(X0)
      <=> ? [X1] :
            ( ssItem(X1)
            & cons(X1,nil) = X0 ) ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( singletonP(X0)
      <=> ? [X1] :
            ( ssItem(X1)
            & cons(X1,nil) = X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

fof(f709,plain,
    ( spl60_9
    | ~ spl60_5
    | ~ spl60_8 ),
    inference(avatar_split_clause,[],[f708,f662,f626,f666]) ).

fof(f626,plain,
    ( spl60_5
  <=> nil = app(sK47,cons(sK49,nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_5])]) ).

fof(f662,plain,
    ( spl60_8
  <=> ssList(cons(sK49,nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_8])]) ).

fof(f708,plain,
    ( nil = cons(sK49,nil)
    | ~ spl60_5
    | ~ spl60_8 ),
    inference(subsumption_resolution,[],[f707,f527]) ).

fof(f527,plain,
    ssList(sK47),
    inference(cnf_transformation,[],[f329]) ).

fof(f707,plain,
    ( nil = cons(sK49,nil)
    | ~ ssList(sK47)
    | ~ spl60_5
    | ~ spl60_8 ),
    inference(subsumption_resolution,[],[f706,f663]) ).

fof(f663,plain,
    ( ssList(cons(sK49,nil))
    | ~ spl60_8 ),
    inference(avatar_component_clause,[],[f662]) ).

fof(f706,plain,
    ( ~ ssList(cons(sK49,nil))
    | ~ ssList(sK47)
    | nil = cons(sK49,nil)
    | ~ spl60_5 ),
    inference(trivial_inequality_removal,[],[f701]) ).

fof(f701,plain,
    ( nil = cons(sK49,nil)
    | nil != nil
    | ~ ssList(sK47)
    | ~ ssList(cons(sK49,nil))
    | ~ spl60_5 ),
    inference(superposition,[],[f450,f628]) ).

fof(f628,plain,
    ( nil = app(sK47,cons(sK49,nil))
    | ~ spl60_5 ),
    inference(avatar_component_clause,[],[f626]) ).

fof(f450,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | nil = X1 ),
    inference(cnf_transformation,[],[f289]) ).

fof(f289,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( ( nil = app(X0,X1)
              | nil != X1
              | nil != X0 )
            & ( ( nil = X1
                & nil = X0 )
              | nil != app(X0,X1) ) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f288]) ).

fof(f288,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( ( nil = app(X0,X1)
              | nil != X1
              | nil != X0 )
            & ( ( nil = X1
                & nil = X0 )
              | nil != app(X0,X1) ) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f210]) ).

fof(f210,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( nil = app(X0,X1)
          <=> ( nil = X1
              & nil = X0 ) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f83]) ).

fof(f83,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( nil = app(X0,X1)
          <=> ( nil = X1
              & nil = X0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).

fof(f681,plain,
    ( spl60_6
    | ~ spl60_8 ),
    inference(avatar_contradiction_clause,[],[f680]) ).

fof(f680,plain,
    ( $false
    | spl60_6
    | ~ spl60_8 ),
    inference(unit_resulting_resolution,[],[f527,f663,f632,f499]) ).

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

fof(f167,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(f632,plain,
    ( ~ ssList(app(sK47,cons(sK49,nil)))
    | spl60_6 ),
    inference(avatar_component_clause,[],[f630]) ).

fof(f630,plain,
    ( spl60_6
  <=> ssList(app(sK47,cons(sK49,nil))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_6])]) ).

fof(f675,plain,
    ( ~ spl60_1
    | spl60_8 ),
    inference(avatar_contradiction_clause,[],[f674]) ).

fof(f674,plain,
    ( $false
    | ~ spl60_1
    | spl60_8 ),
    inference(unit_resulting_resolution,[],[f523,f601,f664,f492]) ).

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

fof(f150,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssItem(X1)
          | ssList(cons(X1,X0)) )
      | ~ ssList(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(f664,plain,
    ( ~ ssList(cons(sK49,nil))
    | spl60_8 ),
    inference(avatar_component_clause,[],[f662]) ).

fof(f642,plain,
    ( ~ spl60_1
    | spl60_7 ),
    inference(avatar_contradiction_clause,[],[f641]) ).

fof(f641,plain,
    ( $false
    | ~ spl60_1
    | spl60_7 ),
    inference(unit_resulting_resolution,[],[f601,f520,f563,f636,f494]) ).

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

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

fof(f125,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(f636,plain,
    ( nil != sK45
    | spl60_7 ),
    inference(avatar_component_clause,[],[f634]) ).

fof(f634,plain,
    ( spl60_7
  <=> nil = sK45 ),
    introduced(avatar_definition,[new_symbols(naming,[spl60_7])]) ).

fof(f563,plain,
    ~ neq(sK45,nil),
    inference(definition_unfolding,[],[f529,f521]) ).

fof(f521,plain,
    sK43 = sK45,
    inference(cnf_transformation,[],[f329]) ).

fof(f529,plain,
    ~ neq(sK43,nil),
    inference(cnf_transformation,[],[f329]) ).

fof(f520,plain,
    ssList(sK45),
    inference(cnf_transformation,[],[f329]) ).

fof(f637,plain,
    ( spl60_5
    | ~ spl60_6
    | ~ spl60_7 ),
    inference(avatar_split_clause,[],[f624,f634,f630,f626]) ).

fof(f624,plain,
    ( nil != sK45
    | ~ ssList(app(sK47,cons(sK49,nil)))
    | nil = app(sK47,cons(sK49,nil)) ),
    inference(subsumption_resolution,[],[f612,f526]) ).

fof(f526,plain,
    ssList(sK48),
    inference(cnf_transformation,[],[f329]) ).

fof(f612,plain,
    ( ~ ssList(sK48)
    | nil != sK45
    | ~ ssList(app(sK47,cons(sK49,nil)))
    | nil = app(sK47,cons(sK49,nil)) ),
    inference(superposition,[],[f449,f524]) ).

fof(f524,plain,
    app(app(sK47,cons(sK49,nil)),sK48) = sK45,
    inference(cnf_transformation,[],[f329]) ).

fof(f449,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | nil = X0
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(cnf_transformation,[],[f289]) ).

fof(f608,plain,
    spl60_1,
    inference(avatar_split_clause,[],[f389,f600]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC218+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_sat --cores 0 -t %d %s
% 0.12/0.34  % Computer : n027.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:50:16 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (29764)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.51  % (29748)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (29743)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52  % (29757)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.52  % (29747)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.52  % (29768)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.52  % (29742)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.52  % (29746)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53  % (29744)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.53  TRYING [1]
% 0.19/0.53  % (29760)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53  % (29750)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53  TRYING [2]
% 0.19/0.53  % (29750)Instruction limit reached!
% 0.19/0.53  % (29750)------------------------------
% 0.19/0.53  % (29750)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (29750)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (29750)Termination reason: Unknown
% 0.19/0.53  % (29750)Termination phase: Preprocessing 2
% 0.19/0.53  
% 0.19/0.53  % (29750)Memory used [KB]: 1023
% 0.19/0.53  % (29750)Time elapsed: 0.002 s
% 0.19/0.53  % (29750)Instructions burned: 3 (million)
% 0.19/0.53  % (29750)------------------------------
% 0.19/0.53  % (29750)------------------------------
% 0.19/0.53  % (29745)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53  % (29770)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.54  % (29751)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (29762)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.54  % (29765)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.54  % (29758)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54  % (29749)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.54  % (29749)Instruction limit reached!
% 0.19/0.54  % (29749)------------------------------
% 0.19/0.54  % (29749)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (29749)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (29749)Termination reason: Unknown
% 0.19/0.54  % (29749)Termination phase: Property scanning
% 0.19/0.54  
% 0.19/0.54  % (29749)Memory used [KB]: 1279
% 0.19/0.54  % (29749)Time elapsed: 0.004 s
% 0.19/0.54  % (29749)Instructions burned: 7 (million)
% 0.19/0.54  % (29749)------------------------------
% 0.19/0.54  % (29749)------------------------------
% 0.19/0.54  % (29761)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.54  % (29755)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54  % (29752)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54  % (29759)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.54  % (29754)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.54  % (29767)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.19/0.55  % (29756)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.55  % (29763)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.55  % (29766)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.61/0.56  % (29769)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 1.61/0.56  % (29748)Instruction limit reached!
% 1.61/0.56  % (29748)------------------------------
% 1.61/0.56  % (29748)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.61/0.56  % (29748)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.61/0.56  % (29748)Termination reason: Unknown
% 1.61/0.56  % (29748)Termination phase: Finite model building constraint generation
% 1.61/0.56  
% 1.61/0.56  % (29748)Memory used [KB]: 7164
% 1.61/0.56  % (29748)Time elapsed: 0.107 s
% 1.61/0.56  % (29748)Instructions burned: 51 (million)
% 1.61/0.56  % (29748)------------------------------
% 1.61/0.56  % (29748)------------------------------
% 1.61/0.56  % (29771)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.61/0.56  TRYING [1]
% 1.61/0.56  % (29743)First to succeed.
% 1.61/0.56  % (29753)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.77/0.58  TRYING [2]
% 1.77/0.58  % (29743)Refutation found. Thanks to Tanya!
% 1.77/0.58  % SZS status Theorem for theBenchmark
% 1.77/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.77/0.58  % (29743)------------------------------
% 1.77/0.58  % (29743)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.77/0.58  % (29743)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.77/0.58  % (29743)Termination reason: Refutation
% 1.77/0.58  
% 1.77/0.58  % (29743)Memory used [KB]: 6140
% 1.77/0.58  % (29743)Time elapsed: 0.165 s
% 1.77/0.58  % (29743)Instructions burned: 24 (million)
% 1.77/0.58  % (29743)------------------------------
% 1.77/0.58  % (29743)------------------------------
% 1.77/0.58  % (29741)Success in time 0.234 s
%------------------------------------------------------------------------------