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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC228+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:39:44 EDT 2022

% Result   : Theorem 1.59s 0.64s
% Output   : Refutation 1.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   85 (   9 unt;   0 def)
%            Number of atoms       :  659 ( 180 equ)
%            Maximal formula atoms :   56 (   7 avg)
%            Number of connectives :  916 ( 342   ~; 329   |; 214   &)
%                                         (   4 <=>;  27  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :  231 ( 161   !;  70   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f529,plain,
    $false,
    inference(avatar_sat_refutation,[],[f311,f312,f499,f509,f526]) ).

fof(f526,plain,
    ( spl18_1
    | ~ spl18_4
    | ~ spl18_6
    | ~ spl18_7 ),
    inference(avatar_contradiction_clause,[],[f525]) ).

fof(f525,plain,
    ( $false
    | spl18_1
    | ~ spl18_4
    | ~ spl18_6
    | ~ spl18_7 ),
    inference(subsumption_resolution,[],[f523,f494]) ).

fof(f494,plain,
    ( ssItem(sK9(sK12(sK7),nil,sK11(sK7)))
    | ~ spl18_6 ),
    inference(avatar_component_clause,[],[f492]) ).

fof(f492,plain,
    ( spl18_6
  <=> ssItem(sK9(sK12(sK7),nil,sK11(sK7))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_6])]) ).

fof(f523,plain,
    ( ~ ssItem(sK9(sK12(sK7),nil,sK11(sK7)))
    | spl18_1
    | ~ spl18_4
    | ~ spl18_7 ),
    inference(resolution,[],[f522,f267]) ).

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

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

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

fof(f522,plain,
    ( memberP(nil,sK9(sK12(sK7),nil,sK11(sK7)))
    | spl18_1
    | ~ spl18_4
    | ~ spl18_7 ),
    inference(subsumption_resolution,[],[f521,f497]) ).

fof(f497,plain,
    ( ssList(cons(sK12(sK7),nil))
    | ~ spl18_7 ),
    inference(avatar_component_clause,[],[f496]) ).

fof(f496,plain,
    ( spl18_7
  <=> ssList(cons(sK12(sK7),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_7])]) ).

fof(f521,plain,
    ( ~ ssList(cons(sK12(sK7),nil))
    | memberP(nil,sK9(sK12(sK7),nil,sK11(sK7)))
    | spl18_1
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f520,f292]) ).

fof(f292,plain,
    ( nil != sK7
    | spl18_1 ),
    inference(avatar_component_clause,[],[f290]) ).

fof(f290,plain,
    ( spl18_1
  <=> nil = sK7 ),
    introduced(avatar_definition,[new_symbols(naming,[spl18_1])]) ).

fof(f520,plain,
    ( nil = sK7
    | memberP(nil,sK9(sK12(sK7),nil,sK11(sK7)))
    | ~ ssList(cons(sK12(sK7),nil))
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f519,f250]) ).

fof(f250,plain,
    ssList(sK7),
    inference(cnf_transformation,[],[f174]) ).

fof(f174,plain,
    ( ssList(sK5)
    & ssList(sK7)
    & ! [X4] :
        ( ~ ssItem(X4)
        | ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( app(app(X5,cons(X4,nil)),X6) != sK5
                | ~ ssList(X6)
                | ( ~ leq(sK9(X4,X5,X6),X4)
                  & memberP(X6,sK9(X4,X5,X6))
                  & ssItem(sK9(X4,X5,X6))
                  & leq(X4,sK9(X4,X5,X6))
                  & memberP(X5,sK9(X4,X5,X6)) ) ) ) )
    & sK8 = sK6
    & nil != sK5
    & ssList(sK8)
    & sK5 = sK7
    & ( nil != sK7
      | nil = sK8 )
    & sK8 = app(sK7,sK10)
    & strictorderedP(sK7)
    & ssList(sK10)
    & ! [X9] :
        ( ! [X10] :
            ( ! [X11] :
                ( ! [X12] :
                    ( ~ ssList(X12)
                    | ~ lt(X11,X9)
                    | app(X12,cons(X11,nil)) != sK7 )
                | ~ ssItem(X11) )
            | ~ ssList(X10)
            | app(cons(X9,nil),X10) != sK10 )
        | ~ ssItem(X9) )
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9,sK10])],[f101,f173,f172,f171,f170,f169,f168]) ).

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

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

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

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

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

fof(f173,plain,
    ( ? [X8] :
        ( sK8 = app(sK7,X8)
        & strictorderedP(sK7)
        & ssList(X8)
        & ! [X9] :
            ( ! [X10] :
                ( ! [X11] :
                    ( ! [X12] :
                        ( ~ ssList(X12)
                        | ~ lt(X11,X9)
                        | app(X12,cons(X11,nil)) != sK7 )
                    | ~ ssItem(X11) )
                | ~ ssList(X10)
                | app(cons(X9,nil),X10) != X8 )
            | ~ ssItem(X9) ) )
   => ( sK8 = app(sK7,sK10)
      & strictorderedP(sK7)
      & ssList(sK10)
      & ! [X9] :
          ( ! [X10] :
              ( ! [X11] :
                  ( ! [X12] :
                      ( ~ ssList(X12)
                      | ~ lt(X11,X9)
                      | app(X12,cons(X11,nil)) != sK7 )
                  | ~ ssItem(X11) )
              | ~ ssList(X10)
              | app(cons(X9,nil),X10) != sK10 )
          | ~ ssItem(X9) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

fof(f519,plain,
    ( ~ ssList(sK7)
    | ~ ssList(cons(sK12(sK7),nil))
    | memberP(nil,sK9(sK12(sK7),nil,sK11(sK7)))
    | nil = sK7
    | ~ spl18_4 ),
    inference(equality_resolution,[],[f459]) ).

fof(f459,plain,
    ( ! [X0] :
        ( sK7 != X0
        | memberP(nil,sK9(sK12(X0),nil,sK11(X0)))
        | ~ ssList(cons(sK12(X0),nil))
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f458,f252]) ).

fof(f252,plain,
    ! [X0] :
      ( ssList(sK11(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f177]) ).

fof(f177,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ssItem(sK12(X0))
        & cons(sK12(X0),sK11(X0)) = X0
        & ssList(sK11(X0)) )
      | nil = X0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f144,f176,f175]) ).

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

fof(f176,plain,
    ! [X0] :
      ( ? [X2] :
          ( ssItem(X2)
          & cons(X2,sK11(X0)) = X0 )
     => ( ssItem(sK12(X0))
        & cons(sK12(X0),sK11(X0)) = X0 ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f458,plain,
    ( ! [X0] :
        ( sK7 != X0
        | memberP(nil,sK9(sK12(X0),nil,sK11(X0)))
        | nil = X0
        | ~ ssList(cons(sK12(X0),nil))
        | ~ ssList(X0)
        | ~ ssList(sK11(X0)) )
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f456,f254]) ).

fof(f254,plain,
    ! [X0] :
      ( ssItem(sK12(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f177]) ).

fof(f456,plain,
    ( ! [X0] :
        ( ~ ssList(cons(sK12(X0),nil))
        | ~ ssItem(sK12(X0))
        | ~ ssList(X0)
        | ~ ssList(sK11(X0))
        | sK7 != X0
        | nil = X0
        | memberP(nil,sK9(sK12(X0),nil,sK11(X0))) )
    | ~ spl18_4 ),
    inference(superposition,[],[f436,f253]) ).

fof(f253,plain,
    ! [X0] :
      ( cons(sK12(X0),sK11(X0)) = X0
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f177]) ).

fof(f436,plain,
    ( ! [X8,X9] :
        ( cons(X8,X9) != sK7
        | memberP(nil,sK9(X8,nil,X9))
        | ~ ssList(X9)
        | ~ ssList(cons(X8,nil))
        | ~ ssItem(X8) )
    | ~ spl18_4 ),
    inference(duplicate_literal_removal,[],[f419]) ).

fof(f419,plain,
    ( ! [X8,X9] :
        ( ~ ssItem(X8)
        | ~ ssList(X9)
        | ~ ssList(cons(X8,nil))
        | ~ ssItem(X8)
        | ~ ssList(X9)
        | memberP(nil,sK9(X8,nil,X9))
        | cons(X8,X9) != sK7 )
    | ~ spl18_4 ),
    inference(superposition,[],[f346,f196]) ).

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

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

fof(f346,plain,
    ( ! [X8,X9] :
        ( app(cons(X8,nil),X9) != sK7
        | ~ ssList(X9)
        | ~ ssItem(X8)
        | ~ ssList(cons(X8,nil))
        | memberP(nil,sK9(X8,nil,X9)) )
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f330,f304]) ).

fof(f304,plain,
    ( ssList(nil)
    | ~ spl18_4 ),
    inference(avatar_component_clause,[],[f303]) ).

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

fof(f330,plain,
    ! [X8,X9] :
      ( memberP(nil,sK9(X8,nil,X9))
      | ~ ssItem(X8)
      | ~ ssList(cons(X8,nil))
      | app(cons(X8,nil),X9) != sK7
      | ~ ssList(nil)
      | ~ ssList(X9) ),
    inference(superposition,[],[f273,f233]) ).

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

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

fof(f28,axiom,
    ! [X0] :
      ( ssList(X0)
     => app(nil,X0) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).

fof(f273,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK7
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ~ ssList(X5)
      | memberP(X5,sK9(X4,X5,X6)) ),
    inference(definition_unfolding,[],[f245,f241]) ).

fof(f241,plain,
    sK5 = sK7,
    inference(cnf_transformation,[],[f174]) ).

fof(f245,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | app(app(X5,cons(X4,nil)),X6) != sK5
      | ~ ssList(X6)
      | memberP(X5,sK9(X4,X5,X6)) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f509,plain,
    ( spl18_1
    | ~ spl18_4
    | spl18_7 ),
    inference(avatar_contradiction_clause,[],[f508]) ).

fof(f508,plain,
    ( $false
    | spl18_1
    | ~ spl18_4
    | spl18_7 ),
    inference(subsumption_resolution,[],[f507,f292]) ).

fof(f507,plain,
    ( nil = sK7
    | ~ spl18_4
    | spl18_7 ),
    inference(subsumption_resolution,[],[f505,f250]) ).

fof(f505,plain,
    ( ~ ssList(sK7)
    | nil = sK7
    | ~ spl18_4
    | spl18_7 ),
    inference(resolution,[],[f504,f254]) ).

fof(f504,plain,
    ( ~ ssItem(sK12(sK7))
    | ~ spl18_4
    | spl18_7 ),
    inference(subsumption_resolution,[],[f500,f304]) ).

fof(f500,plain,
    ( ~ ssItem(sK12(sK7))
    | ~ ssList(nil)
    | spl18_7 ),
    inference(resolution,[],[f498,f258]) ).

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

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

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

fof(f498,plain,
    ( ~ ssList(cons(sK12(sK7),nil))
    | spl18_7 ),
    inference(avatar_component_clause,[],[f496]) ).

fof(f499,plain,
    ( spl18_6
    | ~ spl18_7
    | spl18_1
    | ~ spl18_4 ),
    inference(avatar_split_clause,[],[f490,f303,f290,f496,f492]) ).

fof(f490,plain,
    ( ~ ssList(cons(sK12(sK7),nil))
    | ssItem(sK9(sK12(sK7),nil,sK11(sK7)))
    | spl18_1
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f489,f292]) ).

fof(f489,plain,
    ( ssItem(sK9(sK12(sK7),nil,sK11(sK7)))
    | ~ ssList(cons(sK12(sK7),nil))
    | nil = sK7
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f488,f250]) ).

fof(f488,plain,
    ( ssItem(sK9(sK12(sK7),nil,sK11(sK7)))
    | ~ ssList(sK7)
    | nil = sK7
    | ~ ssList(cons(sK12(sK7),nil))
    | ~ spl18_4 ),
    inference(equality_resolution,[],[f453]) ).

fof(f453,plain,
    ( ! [X0] :
        ( sK7 != X0
        | ssItem(sK9(sK12(X0),nil,sK11(X0)))
        | ~ ssList(cons(sK12(X0),nil))
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f452,f254]) ).

fof(f452,plain,
    ( ! [X0] :
        ( nil = X0
        | sK7 != X0
        | ~ ssList(cons(sK12(X0),nil))
        | ~ ssList(X0)
        | ~ ssItem(sK12(X0))
        | ssItem(sK9(sK12(X0),nil,sK11(X0))) )
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f450,f252]) ).

fof(f450,plain,
    ( ! [X0] :
        ( ~ ssList(cons(sK12(X0),nil))
        | ssItem(sK9(sK12(X0),nil,sK11(X0)))
        | sK7 != X0
        | ~ ssList(X0)
        | ~ ssList(sK11(X0))
        | ~ ssItem(sK12(X0))
        | nil = X0 )
    | ~ spl18_4 ),
    inference(superposition,[],[f437,f253]) ).

fof(f437,plain,
    ( ! [X4,X5] :
        ( sK7 != cons(X4,X5)
        | ~ ssList(cons(X4,nil))
        | ~ ssList(X5)
        | ~ ssItem(X4)
        | ssItem(sK9(X4,nil,X5)) )
    | ~ spl18_4 ),
    inference(duplicate_literal_removal,[],[f417]) ).

fof(f417,plain,
    ( ! [X4,X5] :
        ( ~ ssItem(X4)
        | ~ ssItem(X4)
        | ~ ssList(X5)
        | ssItem(sK9(X4,nil,X5))
        | ~ ssList(X5)
        | ~ ssList(cons(X4,nil))
        | sK7 != cons(X4,X5) )
    | ~ spl18_4 ),
    inference(superposition,[],[f343,f196]) ).

fof(f343,plain,
    ( ! [X4,X5] :
        ( app(cons(X4,nil),X5) != sK7
        | ~ ssList(X5)
        | ~ ssItem(X4)
        | ~ ssList(cons(X4,nil))
        | ssItem(sK9(X4,nil,X5)) )
    | ~ spl18_4 ),
    inference(subsumption_resolution,[],[f328,f304]) ).

fof(f328,plain,
    ! [X4,X5] :
      ( ~ ssList(X5)
      | ~ ssItem(X4)
      | ssItem(sK9(X4,nil,X5))
      | ~ ssList(cons(X4,nil))
      | ~ ssList(nil)
      | app(cons(X4,nil),X5) != sK7 ),
    inference(superposition,[],[f271,f233]) ).

fof(f271,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK7
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ssItem(sK9(X4,X5,X6))
      | ~ ssList(X5) ),
    inference(definition_unfolding,[],[f247,f241]) ).

fof(f247,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | app(app(X5,cons(X4,nil)),X6) != sK5
      | ~ ssList(X6)
      | ssItem(sK9(X4,X5,X6)) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f312,plain,
    spl18_4,
    inference(avatar_split_clause,[],[f203,f303]) ).

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

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

fof(f311,plain,
    ~ spl18_1,
    inference(avatar_split_clause,[],[f274,f290]) ).

fof(f274,plain,
    nil != sK7,
    inference(definition_unfolding,[],[f243,f241]) ).

fof(f243,plain,
    nil != sK5,
    inference(cnf_transformation,[],[f174]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC228+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 18:46:00 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.51  % (24018)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52  % (24008)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53  % (24010)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)
% 1.43/0.54  % (24018)Instruction limit reached!
% 1.43/0.54  % (24018)------------------------------
% 1.43/0.54  % (24018)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.54  % (24018)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.54  % (24018)Termination reason: Unknown
% 1.43/0.54  % (24018)Termination phase: Saturation
% 1.43/0.54  
% 1.43/0.54  % (24018)Memory used [KB]: 6140
% 1.43/0.54  % (24018)Time elapsed: 0.134 s
% 1.43/0.54  % (24018)Instructions burned: 8 (million)
% 1.43/0.54  % (24018)------------------------------
% 1.43/0.54  % (24018)------------------------------
% 1.43/0.54  % (24008)Instruction limit reached!
% 1.43/0.54  % (24008)------------------------------
% 1.43/0.54  % (24008)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.54  % (24008)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.54  % (24008)Termination reason: Unknown
% 1.43/0.54  % (24008)Termination phase: Saturation
% 1.43/0.54  
% 1.43/0.54  % (24008)Memory used [KB]: 6396
% 1.43/0.54  % (24008)Time elapsed: 0.014 s
% 1.43/0.54  % (24008)Instructions burned: 13 (million)
% 1.43/0.54  % (24008)------------------------------
% 1.43/0.54  % (24008)------------------------------
% 1.43/0.54  % (24016)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.59/0.58  % (24034)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.59/0.58  % (24013)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.59/0.58  % (24026)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.59/0.58  % (24016)Instruction limit reached!
% 1.59/0.58  % (24016)------------------------------
% 1.59/0.58  % (24016)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.58  % (24016)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.58  % (24016)Termination reason: Unknown
% 1.59/0.58  % (24016)Termination phase: Saturation
% 1.59/0.58  
% 1.59/0.58  % (24016)Memory used [KB]: 6780
% 1.59/0.58  % (24016)Time elapsed: 0.160 s
% 1.59/0.58  % (24016)Instructions burned: 34 (million)
% 1.59/0.58  % (24016)------------------------------
% 1.59/0.58  % (24016)------------------------------
% 1.59/0.59  % (24007)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.59/0.59  % (24019)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.59/0.59  % (24009)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)
% 1.59/0.59  % (24020)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)
% 1.59/0.59  % (24017)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.59/0.59  % (24022)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.59/0.60  % (24030)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.59/0.60  % (24011)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)
% 1.59/0.61  % (24026)Instruction limit reached!
% 1.59/0.61  % (24026)------------------------------
% 1.59/0.61  % (24026)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.61  % (24026)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.61  % (24026)Termination reason: Unknown
% 1.59/0.61  % (24026)Termination phase: Saturation
% 1.59/0.61  
% 1.59/0.61  % (24026)Memory used [KB]: 6268
% 1.59/0.61  % (24026)Time elapsed: 0.184 s
% 1.59/0.61  % (24026)Instructions burned: 12 (million)
% 1.59/0.61  % (24026)------------------------------
% 1.59/0.61  % (24026)------------------------------
% 1.59/0.61  % (24012)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)
% 1.59/0.61  % (24009)Instruction limit reached!
% 1.59/0.61  % (24009)------------------------------
% 1.59/0.61  % (24009)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.61  % (24009)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.61  % (24009)Termination reason: Unknown
% 1.59/0.61  % (24009)Termination phase: Naming
% 1.59/0.61  
% 1.59/0.61  % (24009)Memory used [KB]: 1535
% 1.59/0.61  % (24009)Time elapsed: 0.004 s
% 1.59/0.61  % (24009)Instructions burned: 3 (million)
% 1.59/0.61  % (24009)------------------------------
% 1.59/0.61  % (24009)------------------------------
% 1.59/0.61  % (24023)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)
% 1.59/0.61  % (24013)First to succeed.
% 1.59/0.61  % (24029)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)
% 1.59/0.61  % (24017)Instruction limit reached!
% 1.59/0.61  % (24017)------------------------------
% 1.59/0.61  % (24017)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.61  % (24017)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.61  % (24017)Termination reason: Unknown
% 1.59/0.61  % (24017)Termination phase: Saturation
% 1.59/0.61  
% 1.59/0.61  % (24017)Memory used [KB]: 6268
% 1.59/0.61  % (24017)Time elapsed: 0.179 s
% 1.59/0.61  % (24017)Instructions burned: 12 (million)
% 1.59/0.61  % (24017)------------------------------
% 1.59/0.61  % (24017)------------------------------
% 1.59/0.62  % (24022)Instruction limit reached!
% 1.59/0.62  % (24022)------------------------------
% 1.59/0.62  % (24022)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.62  % (24022)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.62  % (24022)Termination reason: Unknown
% 1.59/0.62  % (24022)Termination phase: Property scanning
% 1.59/0.62  
% 1.59/0.62  % (24022)Memory used [KB]: 1791
% 1.59/0.62  % (24022)Time elapsed: 0.008 s
% 1.59/0.62  % (24022)Instructions burned: 8 (million)
% 1.59/0.62  % (24022)------------------------------
% 1.59/0.62  % (24022)------------------------------
% 1.59/0.62  % (24019)Instruction limit reached!
% 1.59/0.62  % (24019)------------------------------
% 1.59/0.62  % (24019)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.62  % (24019)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.62  % (24019)Termination reason: Unknown
% 1.59/0.62  % (24019)Termination phase: Saturation
% 1.59/0.62  
% 1.59/0.62  % (24019)Memory used [KB]: 2046
% 1.59/0.62  % (24019)Time elapsed: 0.197 s
% 1.59/0.62  % (24019)Instructions burned: 16 (million)
% 1.59/0.62  % (24019)------------------------------
% 1.59/0.62  % (24019)------------------------------
% 1.59/0.62  % (24033)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.59/0.62  % (24035)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)
% 1.59/0.62  % (24031)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.59/0.62  % (24034)Instruction limit reached!
% 1.59/0.62  % (24034)------------------------------
% 1.59/0.62  % (24034)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.62  % (24034)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.62  % (24034)Termination reason: Unknown
% 1.59/0.62  % (24034)Termination phase: Saturation
% 1.59/0.62  
% 1.59/0.62  % (24034)Memory used [KB]: 6524
% 1.59/0.62  % (24034)Time elapsed: 0.185 s
% 1.59/0.62  % (24034)Instructions burned: 25 (million)
% 1.59/0.62  % (24034)------------------------------
% 1.59/0.62  % (24034)------------------------------
% 1.59/0.62  % (24032)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)
% 1.59/0.63  % (24025)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.59/0.63  % (24025)Instruction limit reached!
% 1.59/0.63  % (24025)------------------------------
% 1.59/0.63  % (24025)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.63  % (24025)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.63  % (24025)Termination reason: Unknown
% 1.59/0.63  % (24025)Termination phase: Preprocessing 2
% 1.59/0.63  
% 1.59/0.63  % (24025)Memory used [KB]: 1535
% 1.59/0.63  % (24025)Time elapsed: 0.003 s
% 1.59/0.63  % (24025)Instructions burned: 2 (million)
% 1.59/0.63  % (24025)------------------------------
% 1.59/0.63  % (24025)------------------------------
% 1.59/0.63  % (24014)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)
% 1.59/0.63  % (24036)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)
% 1.59/0.63  % (24011)Instruction limit reached!
% 1.59/0.63  % (24011)------------------------------
% 1.59/0.63  % (24011)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.63  % (24011)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.63  % (24011)Termination reason: Unknown
% 1.59/0.63  % (24011)Termination phase: Saturation
% 1.59/0.63  
% 1.59/0.63  % (24011)Memory used [KB]: 6268
% 1.59/0.63  % (24011)Time elapsed: 0.207 s
% 1.59/0.63  % (24011)Instructions burned: 13 (million)
% 1.59/0.63  % (24011)------------------------------
% 1.59/0.63  % (24011)------------------------------
% 1.59/0.63  % (24021)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)
% 1.59/0.63  % (24015)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)
% 1.59/0.63  % (24021)Instruction limit reached!
% 1.59/0.63  % (24021)------------------------------
% 1.59/0.63  % (24021)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.63  % (24021)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.63  % (24021)Termination reason: Unknown
% 1.59/0.63  % (24021)Termination phase: Preprocessing 3
% 1.59/0.63  
% 1.59/0.63  % (24021)Memory used [KB]: 1663
% 1.59/0.63  % (24021)Time elapsed: 0.004 s
% 1.59/0.63  % (24021)Instructions burned: 4 (million)
% 1.59/0.63  % (24021)------------------------------
% 1.59/0.63  % (24021)------------------------------
% 1.59/0.63  % (24010)Instruction limit reached!
% 1.59/0.63  % (24010)------------------------------
% 1.59/0.63  % (24010)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.63  % (24010)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.63  % (24010)Termination reason: Unknown
% 1.59/0.63  % (24010)Termination phase: Saturation
% 1.59/0.63  
% 1.59/0.63  % (24010)Memory used [KB]: 7164
% 1.59/0.63  % (24010)Time elapsed: 0.213 s
% 1.59/0.63  % (24010)Instructions burned: 51 (million)
% 1.59/0.63  % (24010)------------------------------
% 1.59/0.63  % (24010)------------------------------
% 1.59/0.63  % (24027)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)
% 1.59/0.63  % (24028)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.59/0.64  % (24013)Refutation found. Thanks to Tanya!
% 1.59/0.64  % SZS status Theorem for theBenchmark
% 1.59/0.64  % SZS output start Proof for theBenchmark
% See solution above
% 1.59/0.64  % (24013)------------------------------
% 1.59/0.64  % (24013)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.64  % (24013)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.64  % (24013)Termination reason: Refutation
% 1.59/0.64  
% 1.59/0.64  % (24013)Memory used [KB]: 6396
% 1.59/0.64  % (24013)Time elapsed: 0.201 s
% 1.59/0.64  % (24013)Instructions burned: 18 (million)
% 1.59/0.64  % (24013)------------------------------
% 1.59/0.64  % (24013)------------------------------
% 1.59/0.64  % (24006)Success in time 0.279 s
%------------------------------------------------------------------------------