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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC247+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 : n003.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:52 EDT 2022

% Result   : Theorem 1.71s 0.58s
% Output   : Refutation 1.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   97 (   6 unt;   0 def)
%            Number of atoms       :  655 ( 131 equ)
%            Maximal formula atoms :   46 (   6 avg)
%            Number of connectives :  888 ( 330   ~; 320   |; 202   &)
%                                         (   3 <=>;  33  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   4 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :  198 ( 136   !;  62   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f633,plain,
    $false,
    inference(avatar_sat_refutation,[],[f367,f606,f618,f632]) ).

fof(f632,plain,
    ( ~ spl20_1
    | ~ spl20_8
    | ~ spl20_9 ),
    inference(avatar_contradiction_clause,[],[f631]) ).

fof(f631,plain,
    ( $false
    | ~ spl20_1
    | ~ spl20_8
    | ~ spl20_9 ),
    inference(subsumption_resolution,[],[f630,f624]) ).

fof(f624,plain,
    ( ssItem(sK11(hd(sK7),nil,sK18(sK7)))
    | ~ spl20_9 ),
    inference(subsumption_resolution,[],[f623,f242]) ).

fof(f242,plain,
    ssList(sK7),
    inference(cnf_transformation,[],[f191]) ).

fof(f191,plain,
    ( ssList(sK8)
    & ! [X4] :
        ( ~ segmentP(X4,sK9)
        | ~ totalorderedP(X4)
        | ~ frontsegP(sK10,X4)
        | ~ ssList(X4)
        | ~ neq(sK9,X4) )
    & sK8 = sK10
    & ssList(sK10)
    & ! [X5] :
        ( ~ ssItem(X5)
        | ! [X6] :
            ( ! [X7] :
                ( app(app(X6,cons(X5,nil)),X7) != sK7
                | ( ssItem(sK11(X5,X6,X7))
                  & ~ leq(X5,sK11(X5,X6,X7))
                  & memberP(X6,sK11(X5,X6,X7))
                  & lt(X5,sK11(X5,X6,X7))
                  & memberP(X7,sK11(X5,X6,X7)) )
                | ~ ssList(X7) )
            | ~ ssList(X6) ) )
    & nil != sK7
    & sK9 = sK7
    & frontsegP(sK10,sK9)
    & totalorderedP(sK9)
    & ssList(sK9)
    & ssList(sK7) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11])],[f185,f190,f189,f188,f187,f186]) ).

fof(f186,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ! [X4] :
                        ( ~ segmentP(X4,X2)
                        | ~ totalorderedP(X4)
                        | ~ frontsegP(X3,X4)
                        | ~ ssList(X4)
                        | ~ neq(X2,X4) )
                    & X1 = X3
                    & ssList(X3)
                    & ! [X5] :
                        ( ~ ssItem(X5)
                        | ! [X6] :
                            ( ! [X7] :
                                ( app(app(X6,cons(X5,nil)),X7) != X0
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & ~ leq(X5,X8)
                                    & memberP(X6,X8)
                                    & lt(X5,X8)
                                    & memberP(X7,X8) )
                                | ~ ssList(X7) )
                            | ~ ssList(X6) ) )
                    & nil != X0
                    & X0 = X2
                    & frontsegP(X3,X2)
                    & totalorderedP(X2) )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ! [X4] :
                      ( ~ segmentP(X4,X2)
                      | ~ totalorderedP(X4)
                      | ~ frontsegP(X3,X4)
                      | ~ ssList(X4)
                      | ~ neq(X2,X4) )
                  & X1 = X3
                  & ssList(X3)
                  & ! [X5] :
                      ( ~ ssItem(X5)
                      | ! [X6] :
                          ( ! [X7] :
                              ( app(app(X6,cons(X5,nil)),X7) != sK7
                              | ? [X8] :
                                  ( ssItem(X8)
                                  & ~ leq(X5,X8)
                                  & memberP(X6,X8)
                                  & lt(X5,X8)
                                  & memberP(X7,X8) )
                              | ~ ssList(X7) )
                          | ~ ssList(X6) ) )
                  & nil != sK7
                  & sK7 = X2
                  & frontsegP(X3,X2)
                  & totalorderedP(X2) )
              & ssList(X2) ) )
      & ssList(sK7) ) ),
    introduced(choice_axiom,[]) ).

fof(f187,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ! [X4] :
                    ( ~ segmentP(X4,X2)
                    | ~ totalorderedP(X4)
                    | ~ frontsegP(X3,X4)
                    | ~ ssList(X4)
                    | ~ neq(X2,X4) )
                & X1 = X3
                & ssList(X3)
                & ! [X5] :
                    ( ~ ssItem(X5)
                    | ! [X6] :
                        ( ! [X7] :
                            ( app(app(X6,cons(X5,nil)),X7) != sK7
                            | ? [X8] :
                                ( ssItem(X8)
                                & ~ leq(X5,X8)
                                & memberP(X6,X8)
                                & lt(X5,X8)
                                & memberP(X7,X8) )
                            | ~ ssList(X7) )
                        | ~ ssList(X6) ) )
                & nil != sK7
                & sK7 = X2
                & frontsegP(X3,X2)
                & totalorderedP(X2) )
            & ssList(X2) ) )
   => ( ssList(sK8)
      & ? [X2] :
          ( ? [X3] :
              ( ! [X4] :
                  ( ~ segmentP(X4,X2)
                  | ~ totalorderedP(X4)
                  | ~ frontsegP(X3,X4)
                  | ~ ssList(X4)
                  | ~ neq(X2,X4) )
              & sK8 = X3
              & ssList(X3)
              & ! [X5] :
                  ( ~ ssItem(X5)
                  | ! [X6] :
                      ( ! [X7] :
                          ( app(app(X6,cons(X5,nil)),X7) != sK7
                          | ? [X8] :
                              ( ssItem(X8)
                              & ~ leq(X5,X8)
                              & memberP(X6,X8)
                              & lt(X5,X8)
                              & memberP(X7,X8) )
                          | ~ ssList(X7) )
                      | ~ ssList(X6) ) )
              & nil != sK7
              & sK7 = X2
              & frontsegP(X3,X2)
              & totalorderedP(X2) )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f188,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ! [X4] :
                ( ~ segmentP(X4,X2)
                | ~ totalorderedP(X4)
                | ~ frontsegP(X3,X4)
                | ~ ssList(X4)
                | ~ neq(X2,X4) )
            & sK8 = X3
            & ssList(X3)
            & ! [X5] :
                ( ~ ssItem(X5)
                | ! [X6] :
                    ( ! [X7] :
                        ( app(app(X6,cons(X5,nil)),X7) != sK7
                        | ? [X8] :
                            ( ssItem(X8)
                            & ~ leq(X5,X8)
                            & memberP(X6,X8)
                            & lt(X5,X8)
                            & memberP(X7,X8) )
                        | ~ ssList(X7) )
                    | ~ ssList(X6) ) )
            & nil != sK7
            & sK7 = X2
            & frontsegP(X3,X2)
            & totalorderedP(X2) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ! [X4] :
              ( ~ segmentP(X4,sK9)
              | ~ totalorderedP(X4)
              | ~ frontsegP(X3,X4)
              | ~ ssList(X4)
              | ~ neq(sK9,X4) )
          & sK8 = X3
          & ssList(X3)
          & ! [X5] :
              ( ~ ssItem(X5)
              | ! [X6] :
                  ( ! [X7] :
                      ( app(app(X6,cons(X5,nil)),X7) != sK7
                      | ? [X8] :
                          ( ssItem(X8)
                          & ~ leq(X5,X8)
                          & memberP(X6,X8)
                          & lt(X5,X8)
                          & memberP(X7,X8) )
                      | ~ ssList(X7) )
                  | ~ ssList(X6) ) )
          & nil != sK7
          & sK9 = sK7
          & frontsegP(X3,sK9)
          & totalorderedP(sK9) )
      & ssList(sK9) ) ),
    introduced(choice_axiom,[]) ).

fof(f189,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ segmentP(X4,sK9)
            | ~ totalorderedP(X4)
            | ~ frontsegP(X3,X4)
            | ~ ssList(X4)
            | ~ neq(sK9,X4) )
        & sK8 = X3
        & ssList(X3)
        & ! [X5] :
            ( ~ ssItem(X5)
            | ! [X6] :
                ( ! [X7] :
                    ( app(app(X6,cons(X5,nil)),X7) != sK7
                    | ? [X8] :
                        ( ssItem(X8)
                        & ~ leq(X5,X8)
                        & memberP(X6,X8)
                        & lt(X5,X8)
                        & memberP(X7,X8) )
                    | ~ ssList(X7) )
                | ~ ssList(X6) ) )
        & nil != sK7
        & sK9 = sK7
        & frontsegP(X3,sK9)
        & totalorderedP(sK9) )
   => ( ! [X4] :
          ( ~ segmentP(X4,sK9)
          | ~ totalorderedP(X4)
          | ~ frontsegP(sK10,X4)
          | ~ ssList(X4)
          | ~ neq(sK9,X4) )
      & sK8 = sK10
      & ssList(sK10)
      & ! [X5] :
          ( ~ ssItem(X5)
          | ! [X6] :
              ( ! [X7] :
                  ( app(app(X6,cons(X5,nil)),X7) != sK7
                  | ? [X8] :
                      ( ssItem(X8)
                      & ~ leq(X5,X8)
                      & memberP(X6,X8)
                      & lt(X5,X8)
                      & memberP(X7,X8) )
                  | ~ ssList(X7) )
              | ~ ssList(X6) ) )
      & nil != sK7
      & sK9 = sK7
      & frontsegP(sK10,sK9)
      & totalorderedP(sK9) ) ),
    introduced(choice_axiom,[]) ).

fof(f190,plain,
    ! [X5,X6,X7] :
      ( ? [X8] :
          ( ssItem(X8)
          & ~ leq(X5,X8)
          & memberP(X6,X8)
          & lt(X5,X8)
          & memberP(X7,X8) )
     => ( ssItem(sK11(X5,X6,X7))
        & ~ leq(X5,sK11(X5,X6,X7))
        & memberP(X6,sK11(X5,X6,X7))
        & lt(X5,sK11(X5,X6,X7))
        & memberP(X7,sK11(X5,X6,X7)) ) ),
    introduced(choice_axiom,[]) ).

fof(f185,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ! [X4] :
                      ( ~ segmentP(X4,X2)
                      | ~ totalorderedP(X4)
                      | ~ frontsegP(X3,X4)
                      | ~ ssList(X4)
                      | ~ neq(X2,X4) )
                  & X1 = X3
                  & ssList(X3)
                  & ! [X5] :
                      ( ~ ssItem(X5)
                      | ! [X6] :
                          ( ! [X7] :
                              ( app(app(X6,cons(X5,nil)),X7) != X0
                              | ? [X8] :
                                  ( ssItem(X8)
                                  & ~ leq(X5,X8)
                                  & memberP(X6,X8)
                                  & lt(X5,X8)
                                  & memberP(X7,X8) )
                              | ~ ssList(X7) )
                          | ~ ssList(X6) ) )
                  & nil != X0
                  & X0 = X2
                  & frontsegP(X3,X2)
                  & totalorderedP(X2) )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(rectify,[],[f164]) ).

fof(f164,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ! [X8] :
                      ( ~ segmentP(X8,X2)
                      | ~ totalorderedP(X8)
                      | ~ frontsegP(X3,X8)
                      | ~ ssList(X8)
                      | ~ neq(X2,X8) )
                  & X1 = X3
                  & ssList(X3)
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ! [X5] :
                          ( ! [X6] :
                              ( app(app(X5,cons(X4,nil)),X6) != X0
                              | ? [X7] :
                                  ( ssItem(X7)
                                  & ~ leq(X4,X7)
                                  & memberP(X5,X7)
                                  & lt(X4,X7)
                                  & memberP(X6,X7) )
                              | ~ ssList(X6) )
                          | ~ ssList(X5) ) )
                  & nil != X0
                  & X0 = X2
                  & frontsegP(X3,X2)
                  & totalorderedP(X2) )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(flattening,[],[f163]) ).

fof(f163,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X0 = X2
                  & totalorderedP(X2)
                  & ! [X8] :
                      ( ~ segmentP(X8,X2)
                      | ~ totalorderedP(X8)
                      | ~ frontsegP(X3,X8)
                      | ~ ssList(X8)
                      | ~ neq(X2,X8) )
                  & X1 = X3
                  & frontsegP(X3,X2)
                  & nil != X0
                  & ! [X4] :
                      ( ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(app(X5,cons(X4,nil)),X6) != X0
                              | ? [X7] :
                                  ( ~ leq(X4,X7)
                                  & lt(X4,X7)
                                  & memberP(X6,X7)
                                  & memberP(X5,X7)
                                  & ssItem(X7) ) ) )
                      | ~ ssItem(X4) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( X0 != X2
                      | ~ totalorderedP(X2)
                      | ? [X8] :
                          ( frontsegP(X3,X8)
                          & totalorderedP(X8)
                          & segmentP(X8,X2)
                          & ssList(X8)
                          & neq(X2,X8) )
                      | X1 != X3
                      | ~ frontsegP(X3,X2)
                      | nil = X0
                      | ? [X4] :
                          ( ? [X5] :
                              ( ssList(X5)
                              & ? [X6] :
                                  ( ssList(X6)
                                  & app(app(X5,cons(X4,nil)),X6) = X0
                                  & ! [X7] :
                                      ( ssItem(X7)
                                     => ( leq(X4,X7)
                                        | ~ lt(X4,X7)
                                        | ~ memberP(X6,X7)
                                        | ~ memberP(X5,X7) ) ) ) )
                          & ssItem(X4) ) ) ) ) ) ),
    inference(rectify,[],[f97]) ).

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

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

fof(f623,plain,
    ( ssItem(sK11(hd(sK7),nil,sK18(sK7)))
    | ~ ssList(sK7)
    | ~ spl20_9 ),
    inference(subsumption_resolution,[],[f622,f247]) ).

fof(f247,plain,
    nil != sK7,
    inference(cnf_transformation,[],[f191]) ).

fof(f622,plain,
    ( nil = sK7
    | ~ ssList(sK7)
    | ssItem(sK11(hd(sK7),nil,sK18(sK7)))
    | ~ spl20_9 ),
    inference(superposition,[],[f605,f479]) ).

fof(f479,plain,
    ! [X0] :
      ( hd(X0) = sK19(X0)
      | nil = X0
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f478,f322]) ).

fof(f322,plain,
    ! [X0] :
      ( ssItem(sK19(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f221,plain,
    ! [X0] :
      ( nil = X0
      | ( ssList(sK18(X0))
        & ssItem(sK19(X0))
        & cons(sK19(X0),sK18(X0)) = X0 )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19])],[f169,f220,f219]) ).

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

fof(f220,plain,
    ! [X0] :
      ( ? [X2] :
          ( ssItem(X2)
          & cons(X2,sK18(X0)) = X0 )
     => ( ssItem(sK19(X0))
        & cons(sK19(X0),sK18(X0)) = X0 ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f478,plain,
    ! [X0] :
      ( ~ ssItem(sK19(X0))
      | hd(X0) = sK19(X0)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(subsumption_resolution,[],[f473,f323]) ).

fof(f323,plain,
    ! [X0] :
      ( ssList(sK18(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f473,plain,
    ! [X0] :
      ( ~ ssList(sK18(X0))
      | ~ ssItem(sK19(X0))
      | nil = X0
      | ~ ssList(X0)
      | hd(X0) = sK19(X0) ),
    inference(superposition,[],[f232,f321]) ).

fof(f321,plain,
    ! [X0] :
      ( cons(sK19(X0),sK18(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f221]) ).

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

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

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

fof(f605,plain,
    ( ssItem(sK11(sK19(sK7),nil,sK18(sK7)))
    | ~ spl20_9 ),
    inference(avatar_component_clause,[],[f603]) ).

fof(f603,plain,
    ( spl20_9
  <=> ssItem(sK11(sK19(sK7),nil,sK18(sK7))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl20_9])]) ).

fof(f630,plain,
    ( ~ ssItem(sK11(hd(sK7),nil,sK18(sK7)))
    | ~ spl20_1
    | ~ spl20_8 ),
    inference(resolution,[],[f629,f310]) ).

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

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

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

fof(f629,plain,
    ( memberP(nil,sK11(hd(sK7),nil,sK18(sK7)))
    | ~ spl20_1
    | ~ spl20_8 ),
    inference(subsumption_resolution,[],[f628,f247]) ).

fof(f628,plain,
    ( memberP(nil,sK11(hd(sK7),nil,sK18(sK7)))
    | nil = sK7
    | ~ spl20_1
    | ~ spl20_8 ),
    inference(subsumption_resolution,[],[f627,f242]) ).

fof(f627,plain,
    ( ~ ssList(sK7)
    | memberP(nil,sK11(hd(sK7),nil,sK18(sK7)))
    | nil = sK7
    | ~ spl20_1
    | ~ spl20_8 ),
    inference(subsumption_resolution,[],[f626,f621]) ).

fof(f621,plain,
    ( ssList(cons(hd(sK7),nil))
    | ~ spl20_8 ),
    inference(subsumption_resolution,[],[f620,f247]) ).

fof(f620,plain,
    ( nil = sK7
    | ssList(cons(hd(sK7),nil))
    | ~ spl20_8 ),
    inference(subsumption_resolution,[],[f619,f242]) ).

fof(f619,plain,
    ( ~ ssList(sK7)
    | nil = sK7
    | ssList(cons(hd(sK7),nil))
    | ~ spl20_8 ),
    inference(superposition,[],[f600,f479]) ).

fof(f600,plain,
    ( ssList(cons(sK19(sK7),nil))
    | ~ spl20_8 ),
    inference(avatar_component_clause,[],[f599]) ).

fof(f599,plain,
    ( spl20_8
  <=> ssList(cons(sK19(sK7),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl20_8])]) ).

fof(f626,plain,
    ( ~ ssList(cons(hd(sK7),nil))
    | memberP(nil,sK11(hd(sK7),nil,sK18(sK7)))
    | ~ ssList(sK7)
    | nil = sK7
    | ~ spl20_1 ),
    inference(equality_resolution,[],[f586]) ).

fof(f586,plain,
    ( ! [X1] :
        ( sK7 != X1
        | memberP(nil,sK11(hd(X1),nil,sK18(X1)))
        | nil = X1
        | ~ ssList(cons(hd(X1),nil))
        | ~ ssList(X1) )
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f585,f323]) ).

fof(f585,plain,
    ( ! [X1] :
        ( nil = X1
        | memberP(nil,sK11(hd(X1),nil,sK18(X1)))
        | sK7 != X1
        | ~ ssList(cons(hd(X1),nil))
        | ~ ssList(X1)
        | ~ ssList(sK18(X1)) )
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f584,f288]) ).

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

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

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

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

fof(f584,plain,
    ( ! [X1] :
        ( ~ ssList(X1)
        | sK7 != X1
        | memberP(nil,sK11(hd(X1),nil,sK18(X1)))
        | ~ ssItem(hd(X1))
        | nil = X1
        | ~ ssList(sK18(X1))
        | ~ ssList(cons(hd(X1),nil)) )
    | ~ spl20_1 ),
    inference(superposition,[],[f555,f488]) ).

fof(f488,plain,
    ! [X1] :
      ( cons(hd(X1),sK18(X1)) = X1
      | nil = X1
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f486]) ).

fof(f486,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | nil = X1
      | nil = X1
      | cons(hd(X1),sK18(X1)) = X1
      | ~ ssList(X1) ),
    inference(superposition,[],[f321,f479]) ).

fof(f555,plain,
    ( ! [X6,X7] :
        ( cons(X6,X7) != sK7
        | memberP(nil,sK11(X6,nil,X7))
        | ~ ssItem(X6)
        | ~ ssList(X7)
        | ~ ssList(cons(X6,nil)) )
    | ~ spl20_1 ),
    inference(duplicate_literal_removal,[],[f537]) ).

fof(f537,plain,
    ( ! [X6,X7] :
        ( ~ ssList(cons(X6,nil))
        | ~ ssItem(X6)
        | ~ ssList(X7)
        | cons(X6,X7) != sK7
        | memberP(nil,sK11(X6,nil,X7))
        | ~ ssItem(X6)
        | ~ ssList(X7) )
    | ~ spl20_1 ),
    inference(superposition,[],[f395,f289]) ).

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

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

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

fof(f395,plain,
    ( ! [X2,X3] :
        ( app(cons(X2,nil),X3) != sK7
        | ~ ssList(cons(X2,nil))
        | ~ ssItem(X2)
        | ~ ssList(X3)
        | memberP(nil,sK11(X2,nil,X3)) )
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f390,f361]) ).

fof(f361,plain,
    ( ssList(nil)
    | ~ spl20_1 ),
    inference(avatar_component_clause,[],[f360]) ).

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

fof(f390,plain,
    ! [X2,X3] :
      ( ~ ssList(cons(X2,nil))
      | ~ ssList(nil)
      | memberP(nil,sK11(X2,nil,X3))
      | app(cons(X2,nil),X3) != sK7
      | ~ ssList(X3)
      | ~ ssItem(X2) ),
    inference(superposition,[],[f250,f275]) ).

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

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

fof(f250,plain,
    ! [X6,X7,X5] :
      ( app(app(X6,cons(X5,nil)),X7) != sK7
      | memberP(X6,sK11(X5,X6,X7))
      | ~ ssItem(X5)
      | ~ ssList(X7)
      | ~ ssList(X6) ),
    inference(cnf_transformation,[],[f191]) ).

fof(f618,plain,
    ( ~ spl20_1
    | spl20_8 ),
    inference(avatar_contradiction_clause,[],[f617]) ).

fof(f617,plain,
    ( $false
    | ~ spl20_1
    | spl20_8 ),
    inference(subsumption_resolution,[],[f616,f242]) ).

fof(f616,plain,
    ( ~ ssList(sK7)
    | ~ spl20_1
    | spl20_8 ),
    inference(subsumption_resolution,[],[f612,f247]) ).

fof(f612,plain,
    ( nil = sK7
    | ~ ssList(sK7)
    | ~ spl20_1
    | spl20_8 ),
    inference(resolution,[],[f611,f322]) ).

fof(f611,plain,
    ( ~ ssItem(sK19(sK7))
    | ~ spl20_1
    | spl20_8 ),
    inference(subsumption_resolution,[],[f607,f361]) ).

fof(f607,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sK19(sK7))
    | spl20_8 ),
    inference(resolution,[],[f601,f318]) ).

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

fof(f112,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) )
      | ~ 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(f601,plain,
    ( ~ ssList(cons(sK19(sK7),nil))
    | spl20_8 ),
    inference(avatar_component_clause,[],[f599]) ).

fof(f606,plain,
    ( ~ spl20_8
    | spl20_9
    | ~ spl20_1 ),
    inference(avatar_split_clause,[],[f597,f360,f603,f599]) ).

fof(f597,plain,
    ( ssItem(sK11(sK19(sK7),nil,sK18(sK7)))
    | ~ ssList(cons(sK19(sK7),nil))
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f596,f242]) ).

fof(f596,plain,
    ( ~ ssList(cons(sK19(sK7),nil))
    | ssItem(sK11(sK19(sK7),nil,sK18(sK7)))
    | ~ ssList(sK7)
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f595,f247]) ).

fof(f595,plain,
    ( ~ ssList(cons(sK19(sK7),nil))
    | nil = sK7
    | ssItem(sK11(sK19(sK7),nil,sK18(sK7)))
    | ~ ssList(sK7)
    | ~ spl20_1 ),
    inference(equality_resolution,[],[f568]) ).

fof(f568,plain,
    ( ! [X0] :
        ( sK7 != X0
        | ~ ssList(cons(sK19(X0),nil))
        | ssItem(sK11(sK19(X0),nil,sK18(X0)))
        | ~ ssList(X0)
        | nil = X0 )
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f567,f322]) ).

fof(f567,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | nil = X0
        | ssItem(sK11(sK19(X0),nil,sK18(X0)))
        | sK7 != X0
        | ~ ssList(cons(sK19(X0),nil))
        | ~ ssItem(sK19(X0)) )
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f565,f323]) ).

fof(f565,plain,
    ( ! [X0] :
        ( ssItem(sK11(sK19(X0),nil,sK18(X0)))
        | ~ ssList(X0)
        | nil = X0
        | ~ ssList(sK18(X0))
        | sK7 != X0
        | ~ ssItem(sK19(X0))
        | ~ ssList(cons(sK19(X0),nil)) )
    | ~ spl20_1 ),
    inference(superposition,[],[f558,f321]) ).

fof(f558,plain,
    ( ! [X8,X9] :
        ( cons(X8,X9) != sK7
        | ~ ssList(cons(X8,nil))
        | ~ ssItem(X8)
        | ~ ssList(X9)
        | ssItem(sK11(X8,nil,X9)) )
    | ~ spl20_1 ),
    inference(duplicate_literal_removal,[],[f538]) ).

fof(f538,plain,
    ( ! [X8,X9] :
        ( cons(X8,X9) != sK7
        | ~ ssItem(X8)
        | ~ ssItem(X8)
        | ~ ssList(X9)
        | ~ ssList(X9)
        | ~ ssList(cons(X8,nil))
        | ssItem(sK11(X8,nil,X9)) )
    | ~ spl20_1 ),
    inference(superposition,[],[f394,f289]) ).

fof(f394,plain,
    ( ! [X8,X9] :
        ( app(cons(X8,nil),X9) != sK7
        | ~ ssList(cons(X8,nil))
        | ssItem(sK11(X8,nil,X9))
        | ~ ssList(X9)
        | ~ ssItem(X8) )
    | ~ spl20_1 ),
    inference(subsumption_resolution,[],[f393,f361]) ).

fof(f393,plain,
    ! [X8,X9] :
      ( ~ ssList(X9)
      | ~ ssList(nil)
      | app(cons(X8,nil),X9) != sK7
      | ssItem(sK11(X8,nil,X9))
      | ~ ssList(cons(X8,nil))
      | ~ ssItem(X8) ),
    inference(superposition,[],[f252,f275]) ).

fof(f252,plain,
    ! [X6,X7,X5] :
      ( app(app(X6,cons(X5,nil)),X7) != sK7
      | ssItem(sK11(X5,X6,X7))
      | ~ ssItem(X5)
      | ~ ssList(X7)
      | ~ ssList(X6) ),
    inference(cnf_transformation,[],[f191]) ).

fof(f367,plain,
    spl20_1,
    inference(avatar_split_clause,[],[f290,f360]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC247+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/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.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 18:38:52 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.51  % (21873)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.51  % (21881)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51  % (21881)Instruction limit reached!
% 0.19/0.51  % (21881)------------------------------
% 0.19/0.51  % (21881)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (21881)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (21881)Termination reason: Unknown
% 0.19/0.51  % (21881)Termination phase: Naming
% 0.19/0.51  
% 0.19/0.51  % (21881)Memory used [KB]: 1535
% 0.19/0.51  % (21881)Time elapsed: 0.004 s
% 0.19/0.51  % (21881)Instructions burned: 3 (million)
% 0.19/0.51  % (21881)------------------------------
% 0.19/0.51  % (21881)------------------------------
% 0.19/0.51  % (21863)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  % (21883)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.52  % (21868)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  % (21889)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.52  % (21887)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.52  % (21891)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.52  % (21876)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.52  % (21867)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.52  % (21890)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.53  % (21869)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.53  % (21893)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.53  % (21870)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.53  % (21871)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.53  % (21866)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.53  % (21864)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  % (21866)Instruction limit reached!
% 0.19/0.53  % (21866)------------------------------
% 0.19/0.53  % (21866)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (21866)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (21866)Termination reason: Unknown
% 0.19/0.53  % (21866)Termination phase: Naming
% 0.19/0.53  
% 0.19/0.53  % (21866)Memory used [KB]: 1535
% 0.19/0.53  % (21866)Time elapsed: 0.002 s
% 0.19/0.53  % (21866)Instructions burned: 3 (million)
% 0.19/0.53  % (21866)------------------------------
% 0.19/0.53  % (21866)------------------------------
% 0.19/0.53  % (21892)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  % (21885)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.54  % (21882)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.54  % (21868)Instruction limit reached!
% 0.19/0.54  % (21868)------------------------------
% 0.19/0.54  % (21868)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (21868)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (21868)Termination reason: Unknown
% 0.19/0.54  % (21868)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (21868)Memory used [KB]: 6268
% 0.19/0.54  % (21868)Time elapsed: 0.145 s
% 0.19/0.54  % (21868)Instructions burned: 13 (million)
% 0.19/0.54  % (21868)------------------------------
% 0.19/0.54  % (21868)------------------------------
% 0.19/0.54  % (21886)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.54  % (21878)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.54  % (21879)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.54  % (21878)Instruction limit reached!
% 0.19/0.54  % (21878)------------------------------
% 0.19/0.54  % (21878)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (21878)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (21878)Termination reason: Unknown
% 0.19/0.54  % (21878)Termination phase: Preprocessing 3
% 0.19/0.54  
% 0.19/0.54  % (21878)Memory used [KB]: 1535
% 0.19/0.54  % (21878)Time elapsed: 0.003 s
% 0.19/0.54  % (21878)Instructions burned: 3 (million)
% 0.19/0.54  % (21878)------------------------------
% 0.19/0.54  % (21878)------------------------------
% 0.19/0.54  % (21880)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.54  % (21874)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.54  % (21883)Instruction limit reached!
% 0.19/0.54  % (21883)------------------------------
% 0.19/0.54  % (21883)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (21883)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (21883)Termination reason: Unknown
% 0.19/0.54  % (21883)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (21883)Memory used [KB]: 6396
% 0.19/0.54  % (21883)Time elapsed: 0.102 s
% 0.19/0.54  % (21883)Instructions burned: 12 (million)
% 0.19/0.54  % (21883)------------------------------
% 0.19/0.54  % (21883)------------------------------
% 0.19/0.54  % (21879)Instruction limit reached!
% 0.19/0.54  % (21879)------------------------------
% 0.19/0.54  % (21879)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (21879)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (21879)Termination reason: Unknown
% 0.19/0.54  % (21879)Termination phase: Property scanning
% 0.19/0.54  
% 0.19/0.54  % (21879)Memory used [KB]: 1791
% 0.19/0.54  % (21879)Time elapsed: 0.005 s
% 0.19/0.54  % (21879)Instructions burned: 9 (million)
% 0.19/0.54  % (21879)------------------------------
% 0.19/0.54  % (21879)------------------------------
% 0.19/0.54  % (21875)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.54  % (21875)Instruction limit reached!
% 0.19/0.54  % (21875)------------------------------
% 0.19/0.54  % (21875)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (21875)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (21875)Termination reason: Unknown
% 0.19/0.54  % (21875)Termination phase: Saturation
% 0.19/0.54  
% 0.19/0.54  % (21875)Memory used [KB]: 6140
% 0.19/0.54  % (21875)Time elapsed: 0.004 s
% 0.19/0.54  % (21875)Instructions burned: 7 (million)
% 0.19/0.54  % (21875)------------------------------
% 0.19/0.54  % (21875)------------------------------
% 0.19/0.54  % (21872)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.55  % (21877)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.55  % (21888)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.55  % (21869)Instruction limit reached!
% 0.19/0.55  % (21869)------------------------------
% 0.19/0.55  % (21869)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (21892)Instruction limit reached!
% 0.19/0.55  % (21892)------------------------------
% 0.19/0.55  % (21892)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (21869)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (21892)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (21869)Termination reason: Unknown
% 0.19/0.55  % (21892)Termination reason: Unknown
% 0.19/0.55  % (21869)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (21892)Termination phase: Function definition elimination
% 0.19/0.55  
% 0.19/0.55  % (21869)Memory used [KB]: 1791
% 0.19/0.55  % (21892)Memory used [KB]: 1791
% 0.19/0.55  % (21869)Time elapsed: 0.163 s
% 0.19/0.55  % (21892)Time elapsed: 0.005 s
% 0.19/0.55  % (21869)Instructions burned: 16 (million)
% 0.19/0.55  % (21892)Instructions burned: 8 (million)
% 0.19/0.55  % (21869)------------------------------
% 0.19/0.55  % (21869)------------------------------
% 0.19/0.55  % (21892)------------------------------
% 0.19/0.55  % (21892)------------------------------
% 0.19/0.55  % (21873)Instruction limit reached!
% 0.19/0.55  % (21873)------------------------------
% 0.19/0.55  % (21873)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (21873)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (21873)Termination reason: Unknown
% 0.19/0.55  % (21873)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (21873)Memory used [KB]: 6780
% 0.19/0.55  % (21873)Time elapsed: 0.151 s
% 0.19/0.55  % (21873)Instructions burned: 33 (million)
% 0.19/0.55  % (21873)------------------------------
% 0.19/0.55  % (21873)------------------------------
% 0.19/0.55  % (21864)Instruction limit reached!
% 0.19/0.55  % (21864)------------------------------
% 0.19/0.55  % (21864)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (21870)First to succeed.
% 0.19/0.55  % (21864)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (21864)Termination reason: Unknown
% 0.19/0.55  % (21864)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (21864)Memory used [KB]: 6396
% 0.19/0.55  % (21864)Time elapsed: 0.008 s
% 0.19/0.55  % (21864)Instructions burned: 13 (million)
% 0.19/0.55  % (21864)------------------------------
% 0.19/0.55  % (21864)------------------------------
% 0.19/0.56  % (21884)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.56  % (21882)Instruction limit reached!
% 0.19/0.56  % (21882)------------------------------
% 0.19/0.56  % (21882)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56  % (21882)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (21882)Termination reason: Unknown
% 0.19/0.56  % (21882)Termination phase: Preprocessing 3
% 0.19/0.56  
% 0.19/0.56  % (21882)Memory used [KB]: 1535
% 0.19/0.56  % (21882)Time elapsed: 0.003 s
% 0.19/0.56  % (21882)Instructions burned: 3 (million)
% 0.19/0.56  % (21882)------------------------------
% 0.19/0.56  % (21882)------------------------------
% 0.19/0.56  % (21874)Instruction limit reached!
% 0.19/0.56  % (21874)------------------------------
% 0.19/0.56  % (21874)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56  % (21874)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (21874)Termination reason: Unknown
% 0.19/0.56  % (21874)Termination phase: Saturation
% 0.19/0.56  
% 0.19/0.56  % (21874)Memory used [KB]: 6396
% 0.19/0.56  % (21874)Time elapsed: 0.159 s
% 0.19/0.56  % (21874)Instructions burned: 13 (million)
% 0.19/0.56  % (21874)------------------------------
% 0.19/0.56  % (21874)------------------------------
% 0.19/0.56  % (21876)Instruction limit reached!
% 0.19/0.56  % (21876)------------------------------
% 0.19/0.56  % (21876)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56  % (21876)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (21876)Termination reason: Unknown
% 0.19/0.56  % (21876)Termination phase: Saturation
% 0.19/0.56  
% 0.19/0.56  % (21876)Memory used [KB]: 2046
% 0.19/0.56  % (21876)Time elapsed: 0.159 s
% 0.19/0.56  % (21876)Instructions burned: 17 (million)
% 0.19/0.56  % (21876)------------------------------
% 0.19/0.56  % (21876)------------------------------
% 1.71/0.57  % (21893)Instruction limit reached!
% 1.71/0.57  % (21893)------------------------------
% 1.71/0.57  % (21893)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.57  % (21893)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.57  % (21893)Termination reason: Unknown
% 1.71/0.57  % (21893)Termination phase: Saturation
% 1.71/0.57  
% 1.71/0.57  % (21893)Memory used [KB]: 6396
% 1.71/0.57  % (21893)Time elapsed: 0.163 s
% 1.71/0.57  % (21893)Instructions burned: 24 (million)
% 1.71/0.57  % (21893)------------------------------
% 1.71/0.57  % (21893)------------------------------
% 1.71/0.57  % (21891)Instruction limit reached!
% 1.71/0.57  % (21891)------------------------------
% 1.71/0.57  % (21891)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.57  % (21891)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.57  % (21891)Termination reason: Unknown
% 1.71/0.57  % (21891)Termination phase: Saturation
% 1.71/0.57  
% 1.71/0.57  % (21891)Memory used [KB]: 6524
% 1.71/0.57  % (21891)Time elapsed: 0.166 s
% 1.71/0.57  % (21891)Instructions burned: 26 (million)
% 1.71/0.57  % (21891)------------------------------
% 1.71/0.57  % (21891)------------------------------
% 1.71/0.58  % (21870)Refutation found. Thanks to Tanya!
% 1.71/0.58  % SZS status Theorem for theBenchmark
% 1.71/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.71/0.58  % (21870)------------------------------
% 1.71/0.58  % (21870)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.58  % (21870)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.58  % (21870)Termination reason: Refutation
% 1.71/0.58  
% 1.71/0.58  % (21870)Memory used [KB]: 6396
% 1.71/0.58  % (21870)Time elapsed: 0.123 s
% 1.71/0.58  % (21870)Instructions burned: 19 (million)
% 1.71/0.58  % (21870)------------------------------
% 1.71/0.58  % (21870)------------------------------
% 1.71/0.58  % (21862)Success in time 0.226 s
%------------------------------------------------------------------------------