TSTP Solution File: SWC228+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC228+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n007.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 May  1 04:00:44 EDT 2024

% Result   : Theorem 0.63s 0.83s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   86 (  10 unt;   0 def)
%            Number of atoms       :  700 ( 199 equ)
%            Maximal formula atoms :   56 (   8 avg)
%            Number of connectives :  998 ( 384   ~; 349   |; 225   &)
%                                         (   7 <=>;  33  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   8 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :  269 ( 192   !;  77   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f864,plain,
    $false,
    inference(avatar_sat_refutation,[],[f597,f610,f626,f628,f676,f717,f721,f863]) ).

fof(f863,plain,
    ( ~ spl53_11
    | spl53_2
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(avatar_split_clause,[],[f862,f719,f715,f593,f646]) ).

fof(f646,plain,
    ( spl53_11
  <=> ssList(sK49) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_11])]) ).

fof(f593,plain,
    ( spl53_2
  <=> nil = sK49 ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_2])]) ).

fof(f715,plain,
    ( spl53_22
  <=> ! [X0,X1] :
        ( ~ ssItem(X0)
        | memberP(nil,sK52(X0,nil,X1))
        | ~ ssList(X1)
        | sK49 != app(cons(X0,nil),X1) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_22])]) ).

fof(f719,plain,
    ( spl53_23
  <=> ! [X0,X1] :
        ( ~ ssItem(X0)
        | ssItem(sK52(X0,nil,X1))
        | ~ ssList(X1)
        | sK49 != app(cons(X0,nil),X1) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_23])]) ).

fof(f862,plain,
    ( nil = sK49
    | ~ ssList(sK49)
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(equality_resolution,[],[f843]) ).

fof(f843,plain,
    ( ! [X0] :
        ( sK49 != X0
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(duplicate_literal_removal,[],[f842]) ).

fof(f842,plain,
    ( ! [X0] :
        ( sK49 != X0
        | nil = X0
        | ~ ssList(X0)
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(resolution,[],[f841,f427]) ).

fof(f427,plain,
    ! [X0] :
      ( ssItem(sK44(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f308]) ).

fof(f308,plain,
    ! [X0] :
      ( ( cons(sK44(X0),sK43(X0)) = X0
        & ssItem(sK44(X0))
        & ssList(sK43(X0)) )
      | nil = X0
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44])],[f125,f307,f306]) ).

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

fof(f307,plain,
    ! [X0] :
      ( ? [X2] :
          ( cons(X2,sK43(X0)) = X0
          & ssItem(X2) )
     => ( cons(sK44(X0),sK43(X0)) = X0
        & ssItem(sK44(X0)) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f20,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( ? [X1] :
            ( ? [X2] :
                ( cons(X2,X1) = X0
                & ssItem(X2) )
            & ssList(X1) )
        | nil = X0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790',ax20) ).

fof(f841,plain,
    ( ! [X0] :
        ( ~ ssItem(sK44(X0))
        | sK49 != X0
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(duplicate_literal_removal,[],[f840]) ).

fof(f840,plain,
    ( ! [X0] :
        ( ~ ssItem(sK44(X0))
        | sK49 != X0
        | nil = X0
        | ~ ssList(X0)
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(resolution,[],[f830,f426]) ).

fof(f426,plain,
    ! [X0] :
      ( ssList(sK43(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f308]) ).

fof(f830,plain,
    ( ! [X0] :
        ( ~ ssList(sK43(X0))
        | ~ ssItem(sK44(X0))
        | sK49 != X0
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(superposition,[],[f829,f428]) ).

fof(f428,plain,
    ! [X0] :
      ( cons(sK44(X0),sK43(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f308]) ).

fof(f829,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sK49
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(duplicate_literal_removal,[],[f826]) ).

fof(f826,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sK49
        | ~ ssItem(X0)
        | cons(X0,X1) != sK49
        | ~ ssList(X1)
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(superposition,[],[f824,f510]) ).

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

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

fof(f81,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) = app(cons(X1,nil),X0) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790',ax81) ).

fof(f824,plain,
    ( ! [X0,X1] :
        ( app(cons(X1,nil),X0) != sK49
        | ~ ssItem(X1)
        | cons(X1,X0) != sK49
        | ~ ssList(X0) )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(duplicate_literal_removal,[],[f821]) ).

fof(f821,plain,
    ( ! [X0,X1] :
        ( ~ ssList(X0)
        | ~ ssItem(X1)
        | cons(X1,X0) != sK49
        | ~ ssItem(X1)
        | ~ ssList(X0)
        | app(cons(X1,nil),X0) != sK49 )
    | ~ spl53_22
    | ~ spl53_23 ),
    inference(resolution,[],[f820,f720]) ).

fof(f720,plain,
    ( ! [X0,X1] :
        ( ssItem(sK52(X0,nil,X1))
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | sK49 != app(cons(X0,nil),X1) )
    | ~ spl53_23 ),
    inference(avatar_component_clause,[],[f719]) ).

fof(f820,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(sK52(X0,nil,X1))
        | ~ ssList(X1)
        | ~ ssItem(X0)
        | cons(X0,X1) != sK49 )
    | ~ spl53_22 ),
    inference(duplicate_literal_removal,[],[f802]) ).

fof(f802,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sK49
        | ~ ssList(X1)
        | ~ ssItem(X0)
        | ~ ssItem(sK52(X0,nil,X1))
        | ~ ssItem(X0)
        | ~ ssList(X1) )
    | ~ spl53_22 ),
    inference(superposition,[],[f725,f510]) ).

fof(f725,plain,
    ( ! [X0,X1] :
        ( sK49 != app(cons(X0,nil),X1)
        | ~ ssList(X1)
        | ~ ssItem(X0)
        | ~ ssItem(sK52(X0,nil,X1)) )
    | ~ spl53_22 ),
    inference(resolution,[],[f716,f452]) ).

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

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

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790',ax38) ).

fof(f716,plain,
    ( ! [X0,X1] :
        ( memberP(nil,sK52(X0,nil,X1))
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | sK49 != app(cons(X0,nil),X1) )
    | ~ spl53_22 ),
    inference(avatar_component_clause,[],[f715]) ).

fof(f721,plain,
    ( ~ spl53_3
    | spl53_23
    | ~ spl53_8 ),
    inference(avatar_split_clause,[],[f697,f624,f719,f604]) ).

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

fof(f624,plain,
    ( spl53_8
  <=> ! [X0,X1] :
        ( sK49 != app(cons(X0,nil),X1)
        | ~ ssList(cons(X0,nil))
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | ssItem(sK52(X0,nil,X1)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_8])]) ).

fof(f697,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(nil)
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssList(X1)
        | ssItem(sK52(X0,nil,X1)) )
    | ~ spl53_8 ),
    inference(duplicate_literal_removal,[],[f696]) ).

fof(f696,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(nil)
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | ssItem(sK52(X0,nil,X1)) )
    | ~ spl53_8 ),
    inference(resolution,[],[f421,f625]) ).

fof(f625,plain,
    ( ! [X0,X1] :
        ( ~ ssList(cons(X0,nil))
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | ssItem(sK52(X0,nil,X1)) )
    | ~ spl53_8 ),
    inference(avatar_component_clause,[],[f624]) ).

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

fof(f120,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/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790',ax16) ).

fof(f717,plain,
    ( ~ spl53_3
    | spl53_22
    | ~ spl53_4 ),
    inference(avatar_split_clause,[],[f698,f608,f715,f604]) ).

fof(f608,plain,
    ( spl53_4
  <=> ! [X0,X1] :
        ( sK49 != app(cons(X0,nil),X1)
        | ~ ssList(cons(X0,nil))
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | memberP(nil,sK52(X0,nil,X1)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl53_4])]) ).

fof(f698,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(nil)
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssList(X1)
        | memberP(nil,sK52(X0,nil,X1)) )
    | ~ spl53_4 ),
    inference(duplicate_literal_removal,[],[f695]) ).

fof(f695,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | ~ ssList(nil)
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | memberP(nil,sK52(X0,nil,X1)) )
    | ~ spl53_4 ),
    inference(resolution,[],[f421,f609]) ).

fof(f609,plain,
    ( ! [X0,X1] :
        ( ~ ssList(cons(X0,nil))
        | sK49 != app(cons(X0,nil),X1)
        | ~ ssItem(X0)
        | ~ ssList(X1)
        | memberP(nil,sK52(X0,nil,X1)) )
    | ~ spl53_4 ),
    inference(avatar_component_clause,[],[f608]) ).

fof(f676,plain,
    spl53_11,
    inference(avatar_contradiction_clause,[],[f675]) ).

fof(f675,plain,
    ( $false
    | spl53_11 ),
    inference(resolution,[],[f648,f531]) ).

fof(f531,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f338]) ).

fof(f338,plain,
    ( ( nil != sK49
      | nil = sK50 )
    & ! [X5] :
        ( ! [X6] :
            ( ! [X7] :
                ( ! [X8] :
                    ( ~ lt(X7,X5)
                    | app(X8,cons(X7,nil)) != sK49
                    | ~ ssList(X8) )
                | ~ ssItem(X7) )
            | app(cons(X5,nil),X6) != sK51
            | ~ ssList(X6) )
        | ~ ssItem(X5) )
    & strictorderedP(sK49)
    & sK50 = app(sK49,sK51)
    & ssList(sK51)
    & ! [X9] :
        ( ! [X10] :
            ( ! [X11] :
                ( ( ~ leq(sK52(X9,X10,X11),X9)
                  & leq(X9,sK52(X9,X10,X11))
                  & memberP(X11,sK52(X9,X10,X11))
                  & memberP(X10,sK52(X9,X10,X11))
                  & ssItem(sK52(X9,X10,X11)) )
                | app(app(X10,cons(X9,nil)),X11) != sK47
                | ~ ssList(X11) )
            | ~ ssList(X10) )
        | ~ ssItem(X9) )
    & nil != sK47
    & sK47 = sK49
    & sK48 = sK50
    & ssList(sK50)
    & ssList(sK49)
    & ssList(sK48)
    & ssList(sK47) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51,sK52])],[f223,f337,f336,f335,f334,f333,f332]) ).

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

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

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

fof(f335,plain,
    ( ? [X3] :
        ( ( nil != sK49
          | nil = X3 )
        & ? [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( ! [X7] :
                        ( ! [X8] :
                            ( ~ lt(X7,X5)
                            | app(X8,cons(X7,nil)) != sK49
                            | ~ ssList(X8) )
                        | ~ ssItem(X7) )
                    | app(cons(X5,nil),X6) != X4
                    | ~ ssList(X6) )
                | ~ ssItem(X5) )
            & strictorderedP(sK49)
            & app(sK49,X4) = X3
            & ssList(X4) )
        & ! [X9] :
            ( ! [X10] :
                ( ! [X11] :
                    ( ? [X12] :
                        ( ~ leq(X12,X9)
                        & leq(X9,X12)
                        & memberP(X11,X12)
                        & memberP(X10,X12)
                        & ssItem(X12) )
                    | app(app(X10,cons(X9,nil)),X11) != sK47
                    | ~ ssList(X11) )
                | ~ ssList(X10) )
            | ~ ssItem(X9) )
        & nil != sK47
        & sK47 = sK49
        & sK48 = X3
        & ssList(X3) )
   => ( ( nil != sK49
        | nil = sK50 )
      & ? [X4] :
          ( ! [X5] :
              ( ! [X6] :
                  ( ! [X7] :
                      ( ! [X8] :
                          ( ~ lt(X7,X5)
                          | app(X8,cons(X7,nil)) != sK49
                          | ~ ssList(X8) )
                      | ~ ssItem(X7) )
                  | app(cons(X5,nil),X6) != X4
                  | ~ ssList(X6) )
              | ~ ssItem(X5) )
          & strictorderedP(sK49)
          & app(sK49,X4) = sK50
          & ssList(X4) )
      & ! [X9] :
          ( ! [X10] :
              ( ! [X11] :
                  ( ? [X12] :
                      ( ~ leq(X12,X9)
                      & leq(X9,X12)
                      & memberP(X11,X12)
                      & memberP(X10,X12)
                      & ssItem(X12) )
                  | app(app(X10,cons(X9,nil)),X11) != sK47
                  | ~ ssList(X11) )
              | ~ ssList(X10) )
          | ~ ssItem(X9) )
      & nil != sK47
      & sK47 = sK49
      & sK48 = sK50
      & ssList(sK50) ) ),
    introduced(choice_axiom,[]) ).

fof(f336,plain,
    ( ? [X4] :
        ( ! [X5] :
            ( ! [X6] :
                ( ! [X7] :
                    ( ! [X8] :
                        ( ~ lt(X7,X5)
                        | app(X8,cons(X7,nil)) != sK49
                        | ~ ssList(X8) )
                    | ~ ssItem(X7) )
                | app(cons(X5,nil),X6) != X4
                | ~ ssList(X6) )
            | ~ ssItem(X5) )
        & strictorderedP(sK49)
        & app(sK49,X4) = sK50
        & ssList(X4) )
   => ( ! [X5] :
          ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ~ lt(X7,X5)
                      | app(X8,cons(X7,nil)) != sK49
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | app(cons(X5,nil),X6) != sK51
              | ~ ssList(X6) )
          | ~ ssItem(X5) )
      & strictorderedP(sK49)
      & sK50 = app(sK49,sK51)
      & ssList(sK51) ) ),
    introduced(choice_axiom,[]) ).

fof(f337,plain,
    ! [X9,X10,X11] :
      ( ? [X12] :
          ( ~ leq(X12,X9)
          & leq(X9,X12)
          & memberP(X11,X12)
          & memberP(X10,X12)
          & ssItem(X12) )
     => ( ~ leq(sK52(X9,X10,X11),X9)
        & leq(X9,sK52(X9,X10,X11))
        & memberP(X11,sK52(X9,X10,X11))
        & memberP(X10,sK52(X9,X10,X11))
        & ssItem(sK52(X9,X10,X11)) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( nil != X2
                    | nil = X3 )
                  & ? [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( ! [X7] :
                                  ( ! [X8] :
                                      ( ~ lt(X7,X5)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ ssList(X8) )
                                  | ~ ssItem(X7) )
                              | app(cons(X5,nil),X6) != X4
                              | ~ ssList(X6) )
                          | ~ ssItem(X5) )
                      & strictorderedP(X2)
                      & app(X2,X4) = X3
                      & ssList(X4) )
                  & ! [X9] :
                      ( ! [X10] :
                          ( ! [X11] :
                              ( ? [X12] :
                                  ( ~ leq(X12,X9)
                                  & leq(X9,X12)
                                  & memberP(X11,X12)
                                  & memberP(X10,X12)
                                  & ssItem(X12) )
                              | app(app(X10,cons(X9,nil)),X11) != X0
                              | ~ ssList(X11) )
                          | ~ ssList(X10) )
                      | ~ ssItem(X9) )
                  & nil != X0
                  & X0 = X2
                  & X1 = X3
                  & 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)
                   => ( ( nil = X2
                        & nil != X3 )
                      | ! [X4] :
                          ( ssList(X4)
                         => ( ? [X5] :
                                ( ? [X6] :
                                    ( ? [X7] :
                                        ( ? [X8] :
                                            ( lt(X7,X5)
                                            & app(X8,cons(X7,nil)) = X2
                                            & ssList(X8) )
                                        & ssItem(X7) )
                                    & app(cons(X5,nil),X6) = X4
                                    & ssList(X6) )
                                & ssItem(X5) )
                            | ~ strictorderedP(X2)
                            | app(X2,X4) != X3 ) )
                      | ? [X9] :
                          ( ? [X10] :
                              ( ? [X11] :
                                  ( ! [X12] :
                                      ( ssItem(X12)
                                     => ( leq(X12,X9)
                                        | ~ leq(X9,X12)
                                        | ~ memberP(X11,X12)
                                        | ~ memberP(X10,X12) ) )
                                  & app(app(X10,cons(X9,nil)),X11) = X0
                                  & ssList(X11) )
                              & ssList(X10) )
                          & ssItem(X9) )
                      | nil = X0
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(rectify,[],[f97]) ).

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

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

fof(f648,plain,
    ( ~ ssList(sK49)
    | spl53_11 ),
    inference(avatar_component_clause,[],[f646]) ).

fof(f628,plain,
    spl53_3,
    inference(avatar_contradiction_clause,[],[f627]) ).

fof(f627,plain,
    ( $false
    | spl53_3 ),
    inference(resolution,[],[f606,f422]) ).

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

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790',ax17) ).

fof(f606,plain,
    ( ~ ssList(nil)
    | spl53_3 ),
    inference(avatar_component_clause,[],[f604]) ).

fof(f626,plain,
    ( ~ spl53_3
    | spl53_8 ),
    inference(avatar_split_clause,[],[f602,f624,f604]) ).

fof(f602,plain,
    ! [X0,X1] :
      ( sK49 != app(cons(X0,nil),X1)
      | ssItem(sK52(X0,nil,X1))
      | ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssItem(X0)
      | ~ ssList(cons(X0,nil)) ),
    inference(superposition,[],[f550,f436]) ).

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

fof(f135,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/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790',ax28) ).

fof(f550,plain,
    ! [X10,X11,X9] :
      ( app(app(X10,cons(X9,nil)),X11) != sK49
      | ssItem(sK52(X9,X10,X11))
      | ~ ssList(X11)
      | ~ ssList(X10)
      | ~ ssItem(X9) ),
    inference(definition_unfolding,[],[f536,f534]) ).

fof(f534,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f338]) ).

fof(f536,plain,
    ! [X10,X11,X9] :
      ( ssItem(sK52(X9,X10,X11))
      | app(app(X10,cons(X9,nil)),X11) != sK47
      | ~ ssList(X11)
      | ~ ssList(X10)
      | ~ ssItem(X9) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f610,plain,
    ( ~ spl53_3
    | spl53_4 ),
    inference(avatar_split_clause,[],[f598,f608,f604]) ).

fof(f598,plain,
    ! [X0,X1] :
      ( sK49 != app(cons(X0,nil),X1)
      | memberP(nil,sK52(X0,nil,X1))
      | ~ ssList(X1)
      | ~ ssList(nil)
      | ~ ssItem(X0)
      | ~ ssList(cons(X0,nil)) ),
    inference(superposition,[],[f549,f436]) ).

fof(f549,plain,
    ! [X10,X11,X9] :
      ( app(app(X10,cons(X9,nil)),X11) != sK49
      | memberP(X10,sK52(X9,X10,X11))
      | ~ ssList(X11)
      | ~ ssList(X10)
      | ~ ssItem(X9) ),
    inference(definition_unfolding,[],[f537,f534]) ).

fof(f537,plain,
    ! [X10,X11,X9] :
      ( memberP(X10,sK52(X9,X10,X11))
      | app(app(X10,cons(X9,nil)),X11) != sK47
      | ~ ssList(X11)
      | ~ ssList(X10)
      | ~ ssItem(X9) ),
    inference(cnf_transformation,[],[f338]) ).

fof(f597,plain,
    ~ spl53_2,
    inference(avatar_split_clause,[],[f551,f593]) ).

fof(f551,plain,
    nil != sK49,
    inference(definition_unfolding,[],[f535,f534]) ).

fof(f535,plain,
    nil != sK47,
    inference(cnf_transformation,[],[f338]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWC228+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35  % Computer : n007.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Apr 30 18:09:03 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.mb4CRtamsr/Vampire---4.8_22790
% 0.60/0.80  % (23008)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.80  % (23010)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.80  % (23003)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.80  % (23005)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.80  % (23004)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.80  % (23006)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.80  % (23007)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.80  % (23009)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.63/0.82  % (23008)Instruction limit reached!
% 0.63/0.82  % (23008)------------------------------
% 0.63/0.82  % (23008)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.82  % (23008)Termination reason: Unknown
% 0.63/0.82  % (23008)Termination phase: Saturation
% 0.63/0.82  
% 0.63/0.82  % (23008)Memory used [KB]: 1531
% 0.63/0.82  % (23008)Time elapsed: 0.026 s
% 0.63/0.82  % (23008)Instructions burned: 45 (million)
% 0.63/0.82  % (23008)------------------------------
% 0.63/0.82  % (23008)------------------------------
% 0.63/0.82  % (23012)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.63/0.83  % (23004)First to succeed.
% 0.63/0.83  % (23006)Instruction limit reached!
% 0.63/0.83  % (23006)------------------------------
% 0.63/0.83  % (23006)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.83  % (23006)Termination reason: Unknown
% 0.63/0.83  % (23007)Instruction limit reached!
% 0.63/0.83  % (23007)------------------------------
% 0.63/0.83  % (23007)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.83  % (23007)Termination reason: Unknown
% 0.63/0.83  % (23007)Termination phase: Saturation
% 0.63/0.83  
% 0.63/0.83  % (23007)Memory used [KB]: 1922
% 0.63/0.83  % (23007)Time elapsed: 0.033 s
% 0.63/0.83  % (23007)Instructions burned: 35 (million)
% 0.63/0.83  % (23007)------------------------------
% 0.63/0.83  % (23007)------------------------------
% 0.63/0.83  % (23006)Termination phase: Saturation
% 0.63/0.83  
% 0.63/0.83  % (23006)Memory used [KB]: 1736
% 0.63/0.83  % (23006)Time elapsed: 0.033 s
% 0.63/0.83  % (23006)Instructions burned: 33 (million)
% 0.63/0.83  % (23006)------------------------------
% 0.63/0.83  % (23006)------------------------------
% 0.63/0.83  % (23010)Instruction limit reached!
% 0.63/0.83  % (23010)------------------------------
% 0.63/0.83  % (23010)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.83  % (23010)Termination reason: Unknown
% 0.63/0.83  % (23010)Termination phase: Saturation
% 0.63/0.83  
% 0.63/0.83  % (23010)Memory used [KB]: 1663
% 0.63/0.83  % (23010)Time elapsed: 0.033 s
% 0.63/0.83  % (23010)Instructions burned: 57 (million)
% 0.63/0.83  % (23010)------------------------------
% 0.63/0.83  % (23010)------------------------------
% 0.63/0.83  % (23003)Instruction limit reached!
% 0.63/0.83  % (23003)------------------------------
% 0.63/0.83  % (23003)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.83  % (23003)Termination reason: Unknown
% 0.63/0.83  % (23003)Termination phase: Saturation
% 0.63/0.83  
% 0.63/0.83  % (23003)Memory used [KB]: 1542
% 0.63/0.83  % (23003)Time elapsed: 0.034 s
% 0.63/0.83  % (23003)Instructions burned: 35 (million)
% 0.63/0.83  % (23003)------------------------------
% 0.63/0.83  % (23003)------------------------------
% 0.63/0.83  % (23004)Refutation found. Thanks to Tanya!
% 0.63/0.83  % SZS status Theorem for Vampire---4
% 0.63/0.83  % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.83  % (23004)------------------------------
% 0.63/0.83  % (23004)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.83  % (23004)Termination reason: Refutation
% 0.63/0.83  
% 0.63/0.83  % (23004)Memory used [KB]: 1559
% 0.63/0.83  % (23004)Time elapsed: 0.033 s
% 0.63/0.83  % (23004)Instructions burned: 33 (million)
% 0.63/0.83  % (23004)------------------------------
% 0.63/0.83  % (23004)------------------------------
% 0.63/0.83  % (22980)Success in time 0.468 s
% 0.63/0.83  % Vampire---4.8 exiting
%------------------------------------------------------------------------------