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

View Problem - Process Solution

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

% Computer : n019.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:43:44 EDT 2022

% Result   : Theorem 2.12s 0.68s
% Output   : Refutation 2.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   92 (  23 unt;   0 def)
%            Number of atoms       :  494 ( 181 equ)
%            Maximal formula atoms :   38 (   5 avg)
%            Number of connectives :  628 ( 226   ~; 235   |; 131   &)
%                                         (   4 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :  158 ( 114   !;  44   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1615,plain,
    $false,
    inference(subsumption_resolution,[],[f1614,f628]) ).

fof(f628,plain,
    ~ ssList(nil),
    inference(consistent_polarity_flipping,[],[f513]) ).

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

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

fof(f1614,plain,
    ssList(nil),
    inference(subsumption_resolution,[],[f1613,f951]) ).

fof(f951,plain,
    nil != sK31,
    inference(subsumption_resolution,[],[f950,f822]) ).

fof(f822,plain,
    ~ ssItem(sK32),
    inference(resolution,[],[f680,f816]) ).

fof(f816,plain,
    ~ neq(sK31,nil),
    inference(duplicate_literal_removal,[],[f786]) ).

fof(f786,plain,
    ( ~ neq(sK31,nil)
    | ~ neq(sK31,nil) ),
    inference(consistent_polarity_flipping,[],[f568]) ).

fof(f568,plain,
    ( neq(sK31,nil)
    | neq(sK31,nil) ),
    inference(definition_unfolding,[],[f461,f467,f467]) ).

fof(f467,plain,
    sK29 = sK31,
    inference(cnf_transformation,[],[f297]) ).

fof(f297,plain,
    ( ssList(sK29)
    & ssList(sK30)
    & sK30 = sK28
    & sK29 = sK31
    & ssList(sK31)
    & ( ( ssItem(sK32)
        & app(cons(sK32,nil),sK30) = sK31
        & neq(sK29,nil)
        & ! [X5] :
            ( sK29 != X5
            | ! [X6] :
                ( app(X6,sK28) != X5
                | ! [X7] :
                    ( ~ neq(nil,sK29)
                    | cons(X7,nil) != X6
                    | ~ ssItem(X7)
                    | hd(sK29) != X7 )
                | ~ ssList(X6) )
            | ~ ssList(X5) ) )
      | ( neq(sK29,nil)
        & ~ neq(sK31,nil) ) )
    & ssList(sK28) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK28,sK29,sK30,sK31,sK32])],[f167,f296,f295,f294,f293,f292]) ).

fof(f292,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( X0 = X2
                    & X1 = X3
                    & ssList(X3)
                    & ( ( ? [X4] :
                            ( ssItem(X4)
                            & app(cons(X4,nil),X2) = X3 )
                        & neq(X1,nil)
                        & ! [X5] :
                            ( X1 != X5
                            | ! [X6] :
                                ( app(X6,X0) != X5
                                | ! [X7] :
                                    ( ~ neq(nil,X1)
                                    | cons(X7,nil) != X6
                                    | ~ ssItem(X7)
                                    | hd(X1) != X7 )
                                | ~ ssList(X6) )
                            | ~ ssList(X5) ) )
                      | ( neq(X1,nil)
                        & ~ neq(X3,nil) ) ) ) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( sK28 = X2
                  & X1 = X3
                  & ssList(X3)
                  & ( ( ? [X4] :
                          ( ssItem(X4)
                          & app(cons(X4,nil),X2) = X3 )
                      & neq(X1,nil)
                      & ! [X5] :
                          ( X1 != X5
                          | ! [X6] :
                              ( app(X6,sK28) != X5
                              | ! [X7] :
                                  ( ~ neq(nil,X1)
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7)
                                  | hd(X1) != X7 )
                              | ~ ssList(X6) )
                          | ~ ssList(X5) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) ) ) ) )
      & ssList(sK28) ) ),
    introduced(choice_axiom,[]) ).

fof(f293,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( sK28 = X2
                & X1 = X3
                & ssList(X3)
                & ( ( ? [X4] :
                        ( ssItem(X4)
                        & app(cons(X4,nil),X2) = X3 )
                    & neq(X1,nil)
                    & ! [X5] :
                        ( X1 != X5
                        | ! [X6] :
                            ( app(X6,sK28) != X5
                            | ! [X7] :
                                ( ~ neq(nil,X1)
                                | cons(X7,nil) != X6
                                | ~ ssItem(X7)
                                | hd(X1) != X7 )
                            | ~ ssList(X6) )
                        | ~ ssList(X5) ) )
                  | ( neq(X1,nil)
                    & ~ neq(X3,nil) ) ) ) ) )
   => ( ssList(sK29)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( sK28 = X2
              & sK29 = X3
              & ssList(X3)
              & ( ( ? [X4] :
                      ( ssItem(X4)
                      & app(cons(X4,nil),X2) = X3 )
                  & neq(sK29,nil)
                  & ! [X5] :
                      ( sK29 != X5
                      | ! [X6] :
                          ( app(X6,sK28) != X5
                          | ! [X7] :
                              ( ~ neq(nil,sK29)
                              | cons(X7,nil) != X6
                              | ~ ssItem(X7)
                              | hd(sK29) != X7 )
                          | ~ ssList(X6) )
                      | ~ ssList(X5) ) )
                | ( neq(sK29,nil)
                  & ~ neq(X3,nil) ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f294,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( sK28 = X2
            & sK29 = X3
            & ssList(X3)
            & ( ( ? [X4] :
                    ( ssItem(X4)
                    & app(cons(X4,nil),X2) = X3 )
                & neq(sK29,nil)
                & ! [X5] :
                    ( sK29 != X5
                    | ! [X6] :
                        ( app(X6,sK28) != X5
                        | ! [X7] :
                            ( ~ neq(nil,sK29)
                            | cons(X7,nil) != X6
                            | ~ ssItem(X7)
                            | hd(sK29) != X7 )
                        | ~ ssList(X6) )
                    | ~ ssList(X5) ) )
              | ( neq(sK29,nil)
                & ~ neq(X3,nil) ) ) ) )
   => ( ssList(sK30)
      & ? [X3] :
          ( sK30 = sK28
          & sK29 = X3
          & ssList(X3)
          & ( ( ? [X4] :
                  ( ssItem(X4)
                  & app(cons(X4,nil),sK30) = X3 )
              & neq(sK29,nil)
              & ! [X5] :
                  ( sK29 != X5
                  | ! [X6] :
                      ( app(X6,sK28) != X5
                      | ! [X7] :
                          ( ~ neq(nil,sK29)
                          | cons(X7,nil) != X6
                          | ~ ssItem(X7)
                          | hd(sK29) != X7 )
                      | ~ ssList(X6) )
                  | ~ ssList(X5) ) )
            | ( neq(sK29,nil)
              & ~ neq(X3,nil) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f295,plain,
    ( ? [X3] :
        ( sK30 = sK28
        & sK29 = X3
        & ssList(X3)
        & ( ( ? [X4] :
                ( ssItem(X4)
                & app(cons(X4,nil),sK30) = X3 )
            & neq(sK29,nil)
            & ! [X5] :
                ( sK29 != X5
                | ! [X6] :
                    ( app(X6,sK28) != X5
                    | ! [X7] :
                        ( ~ neq(nil,sK29)
                        | cons(X7,nil) != X6
                        | ~ ssItem(X7)
                        | hd(sK29) != X7 )
                    | ~ ssList(X6) )
                | ~ ssList(X5) ) )
          | ( neq(sK29,nil)
            & ~ neq(X3,nil) ) ) )
   => ( sK30 = sK28
      & sK29 = sK31
      & ssList(sK31)
      & ( ( ? [X4] :
              ( ssItem(X4)
              & app(cons(X4,nil),sK30) = sK31 )
          & neq(sK29,nil)
          & ! [X5] :
              ( sK29 != X5
              | ! [X6] :
                  ( app(X6,sK28) != X5
                  | ! [X7] :
                      ( ~ neq(nil,sK29)
                      | cons(X7,nil) != X6
                      | ~ ssItem(X7)
                      | hd(sK29) != X7 )
                  | ~ ssList(X6) )
              | ~ ssList(X5) ) )
        | ( neq(sK29,nil)
          & ~ neq(sK31,nil) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f296,plain,
    ( ? [X4] :
        ( ssItem(X4)
        & app(cons(X4,nil),sK30) = sK31 )
   => ( ssItem(sK32)
      & app(cons(sK32,nil),sK30) = sK31 ) ),
    introduced(choice_axiom,[]) ).

fof(f167,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( X0 = X2
                  & X1 = X3
                  & ssList(X3)
                  & ( ( ? [X4] :
                          ( ssItem(X4)
                          & app(cons(X4,nil),X2) = X3 )
                      & neq(X1,nil)
                      & ! [X5] :
                          ( X1 != X5
                          | ! [X6] :
                              ( app(X6,X0) != X5
                              | ! [X7] :
                                  ( ~ neq(nil,X1)
                                  | cons(X7,nil) != X6
                                  | ~ ssItem(X7)
                                  | hd(X1) != X7 )
                              | ~ ssList(X6) )
                          | ~ ssList(X5) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) ) ) ) )
      & ssList(X0) ),
    inference(flattening,[],[f166]) ).

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

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

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

fof(f461,plain,
    ( neq(sK29,nil)
    | neq(sK29,nil) ),
    inference(cnf_transformation,[],[f297]) ).

fof(f680,plain,
    ( neq(sK31,nil)
    | ~ ssItem(sK32) ),
    inference(consistent_polarity_flipping,[],[f464]) ).

fof(f464,plain,
    ( ~ neq(sK31,nil)
    | ssItem(sK32) ),
    inference(cnf_transformation,[],[f297]) ).

fof(f950,plain,
    ( ssItem(sK32)
    | nil != sK31 ),
    inference(subsumption_resolution,[],[f949,f628]) ).

fof(f949,plain,
    ( ssList(nil)
    | ssItem(sK32)
    | nil != sK31 ),
    inference(resolution,[],[f942,f619]) ).

fof(f619,plain,
    ! [X0,X1] :
      ( ~ ssList(cons(X1,X0))
      | ssItem(X1)
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f558]) ).

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

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

fof(f942,plain,
    ( ssList(cons(sK32,nil))
    | nil != sK31 ),
    inference(subsumption_resolution,[],[f941,f708]) ).

fof(f708,plain,
    ~ ssList(sK28),
    inference(consistent_polarity_flipping,[],[f564]) ).

fof(f564,plain,
    ssList(sK28),
    inference(definition_unfolding,[],[f469,f468]) ).

fof(f468,plain,
    sK30 = sK28,
    inference(cnf_transformation,[],[f297]) ).

fof(f469,plain,
    ssList(sK30),
    inference(cnf_transformation,[],[f297]) ).

fof(f941,plain,
    ( nil != sK31
    | ssList(sK28)
    | ssList(cons(sK32,nil)) ),
    inference(subsumption_resolution,[],[f935,f887]) ).

fof(f887,plain,
    nil != cons(sK32,nil),
    inference(resolution,[],[f853,f628]) ).

fof(f853,plain,
    ! [X4] :
      ( ssList(X4)
      | cons(sK32,X4) != X4 ),
    inference(resolution,[],[f778,f822]) ).

fof(f778,plain,
    ! [X0,X1] :
      ( ssList(X0)
      | ssItem(X1)
      | cons(X1,X0) != X0 ),
    inference(consistent_polarity_flipping,[],[f361]) ).

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

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

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

fof(f935,plain,
    ( nil != sK31
    | ssList(cons(sK32,nil))
    | nil = cons(sK32,nil)
    | ssList(sK28) ),
    inference(superposition,[],[f657,f818]) ).

fof(f818,plain,
    app(cons(sK32,nil),sK28) = sK31,
    inference(subsumption_resolution,[],[f651,f816]) ).

fof(f651,plain,
    ( neq(sK31,nil)
    | app(cons(sK32,nil),sK28) = sK31 ),
    inference(consistent_polarity_flipping,[],[f567]) ).

fof(f567,plain,
    ( ~ neq(sK31,nil)
    | app(cons(sK32,nil),sK28) = sK31 ),
    inference(definition_unfolding,[],[f462,f468]) ).

fof(f462,plain,
    ( app(cons(sK32,nil),sK30) = sK31
    | ~ neq(sK31,nil) ),
    inference(cnf_transformation,[],[f297]) ).

fof(f657,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | nil = X0
      | ssList(X0)
      | ssList(X1) ),
    inference(consistent_polarity_flipping,[],[f367]) ).

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

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

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

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

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

fof(f1613,plain,
    ( nil = sK31
    | ssList(nil) ),
    inference(subsumption_resolution,[],[f1611,f749]) ).

fof(f749,plain,
    ~ ssList(sK31),
    inference(consistent_polarity_flipping,[],[f563]) ).

fof(f563,plain,
    ssList(sK31),
    inference(definition_unfolding,[],[f470,f467]) ).

fof(f470,plain,
    ssList(sK29),
    inference(cnf_transformation,[],[f297]) ).

fof(f1611,plain,
    ( ssList(sK31)
    | nil = sK31
    | ssList(nil) ),
    inference(resolution,[],[f1577,f748]) ).

fof(f748,plain,
    ! [X0,X1] :
      ( ~ neq(X0,X1)
      | ssList(X0)
      | X0 = X1
      | ssList(X1) ),
    inference(consistent_polarity_flipping,[],[f409]) ).

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

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

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

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

fof(f1577,plain,
    neq(nil,sK31),
    inference(subsumption_resolution,[],[f1576,f822]) ).

fof(f1576,plain,
    ( neq(nil,sK31)
    | ssItem(sK32) ),
    inference(subsumption_resolution,[],[f1575,f628]) ).

fof(f1575,plain,
    ( ssList(nil)
    | neq(nil,sK31)
    | ssItem(sK32) ),
    inference(resolution,[],[f1366,f619]) ).

fof(f1366,plain,
    ( ssList(cons(sK32,nil))
    | neq(nil,sK31) ),
    inference(subsumption_resolution,[],[f1365,f822]) ).

fof(f1365,plain,
    ( neq(nil,sK31)
    | ssItem(sK32)
    | ssList(cons(sK32,nil)) ),
    inference(subsumption_resolution,[],[f1362,f818]) ).

fof(f1362,plain,
    ( app(cons(sK32,nil),sK28) != sK31
    | ssList(cons(sK32,nil))
    | ssItem(sK32)
    | neq(nil,sK31) ),
    inference(superposition,[],[f820,f1268]) ).

fof(f1268,plain,
    hd(sK31) = sK32,
    inference(superposition,[],[f1035,f1258]) ).

fof(f1258,plain,
    cons(sK32,sK28) = sK31,
    inference(forward_demodulation,[],[f1253,f818]) ).

fof(f1253,plain,
    cons(sK32,sK28) = app(cons(sK32,nil),sK28),
    inference(resolution,[],[f969,f822]) ).

fof(f969,plain,
    ! [X11] :
      ( ssItem(X11)
      | app(cons(X11,nil),sK28) = cons(X11,sK28) ),
    inference(resolution,[],[f776,f708]) ).

fof(f776,plain,
    ! [X0,X1] :
      ( ssList(X0)
      | ssItem(X1)
      | cons(X1,X0) = app(cons(X1,nil),X0) ),
    inference(consistent_polarity_flipping,[],[f411]) ).

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

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

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

fof(f1035,plain,
    hd(cons(sK32,sK28)) = sK32,
    inference(resolution,[],[f871,f822]) ).

fof(f871,plain,
    ! [X7] :
      ( ssItem(X7)
      | hd(cons(X7,sK28)) = X7 ),
    inference(resolution,[],[f758,f708]) ).

fof(f758,plain,
    ! [X0,X1] :
      ( ssList(X0)
      | ssItem(X1)
      | hd(cons(X1,X0)) = X1 ),
    inference(consistent_polarity_flipping,[],[f485]) ).

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

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

fof(f820,plain,
    ( app(cons(hd(sK31),nil),sK28) != sK31
    | ssItem(hd(sK31))
    | neq(nil,sK31)
    | ssList(cons(hd(sK31),nil)) ),
    inference(subsumption_resolution,[],[f819,f749]) ).

fof(f819,plain,
    ( app(cons(hd(sK31),nil),sK28) != sK31
    | ssItem(hd(sK31))
    | neq(nil,sK31)
    | ssList(sK31)
    | ssList(cons(hd(sK31),nil)) ),
    inference(subsumption_resolution,[],[f639,f816]) ).

fof(f639,plain,
    ( neq(nil,sK31)
    | ssItem(hd(sK31))
    | app(cons(hd(sK31),nil),sK28) != sK31
    | ssList(cons(hd(sK31),nil))
    | neq(sK31,nil)
    | ssList(sK31) ),
    inference(consistent_polarity_flipping,[],[f595]) ).

fof(f595,plain,
    ( app(cons(hd(sK31),nil),sK28) != sK31
    | ~ ssList(sK31)
    | ~ neq(nil,sK31)
    | ~ ssItem(hd(sK31))
    | ~ neq(sK31,nil)
    | ~ ssList(cons(hd(sK31),nil)) ),
    inference(equality_resolution,[],[f594]) ).

fof(f594,plain,
    ! [X7] :
      ( app(cons(X7,nil),sK28) != sK31
      | ~ neq(nil,sK31)
      | ~ ssItem(X7)
      | hd(sK31) != X7
      | ~ ssList(cons(X7,nil))
      | ~ ssList(sK31)
      | ~ neq(sK31,nil) ),
    inference(equality_resolution,[],[f593]) ).

fof(f593,plain,
    ! [X6,X7] :
      ( app(X6,sK28) != sK31
      | ~ neq(nil,sK31)
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | hd(sK31) != X7
      | ~ ssList(X6)
      | ~ ssList(sK31)
      | ~ neq(sK31,nil) ),
    inference(equality_resolution,[],[f571]) ).

fof(f571,plain,
    ! [X6,X7,X5] :
      ( sK31 != X5
      | app(X6,sK28) != X5
      | ~ neq(nil,sK31)
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | hd(sK31) != X7
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ neq(sK31,nil) ),
    inference(definition_unfolding,[],[f458,f467,f467,f467]) ).

fof(f458,plain,
    ! [X6,X7,X5] :
      ( sK29 != X5
      | app(X6,sK28) != X5
      | ~ neq(nil,sK29)
      | cons(X7,nil) != X6
      | ~ ssItem(X7)
      | hd(sK29) != X7
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ neq(sK31,nil) ),
    inference(cnf_transformation,[],[f297]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 18:57:50 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.53  % (4700)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.53  % (4708)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.53  % (4708)Instruction limit reached!
% 0.20/0.53  % (4708)------------------------------
% 0.20/0.53  % (4708)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (4708)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (4708)Termination reason: Unknown
% 0.20/0.53  % (4708)Termination phase: Preprocessing 2
% 0.20/0.53  
% 0.20/0.53  % (4708)Memory used [KB]: 1023
% 0.20/0.53  % (4708)Time elapsed: 0.002 s
% 0.20/0.53  % (4708)Instructions burned: 2 (million)
% 0.20/0.53  % (4708)------------------------------
% 0.20/0.53  % (4708)------------------------------
% 0.20/0.53  % (4702)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.54  % (4705)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.54  % (4723)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.54  % (4709)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.54  % (4716)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55  % (4704)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55  % (4703)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55  % (4711)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55  % (4725)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.55  % (4726)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.55  % (4722)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.55  % (4713)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55  % (4706)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55  % (4715)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.56  % (4712)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.56  % (4729)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.56  % (4717)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.56  % (4728)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.56  % (4701)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56  % (4707)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56  % (4710)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56  % (4727)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.56  % (4724)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.56  % (4720)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.57  TRYING [1]
% 0.20/0.57  % (4718)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.57  TRYING [1]
% 0.20/0.57  % (4714)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.57  % (4721)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.57  % (4719)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.57  TRYING [2]
% 0.20/0.59  % (4707)Instruction limit reached!
% 0.20/0.59  % (4707)------------------------------
% 0.20/0.59  % (4707)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59  % (4707)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59  % (4707)Termination reason: Unknown
% 0.20/0.59  % (4707)Termination phase: Property scanning
% 0.20/0.59  
% 0.20/0.59  % (4707)Memory used [KB]: 1279
% 0.20/0.59  % (4707)Time elapsed: 0.005 s
% 0.20/0.59  % (4707)Instructions burned: 7 (million)
% 0.20/0.59  % (4707)------------------------------
% 0.20/0.59  % (4707)------------------------------
% 0.20/0.59  TRYING [2]
% 0.20/0.59  % (4701)Refutation not found, incomplete strategy% (4701)------------------------------
% 0.20/0.59  % (4701)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59  % (4701)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59  % (4701)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.59  
% 0.20/0.59  % (4701)Memory used [KB]: 6140
% 0.20/0.59  % (4701)Time elapsed: 0.184 s
% 0.20/0.59  % (4701)Instructions burned: 26 (million)
% 0.20/0.59  % (4701)------------------------------
% 0.20/0.59  % (4701)------------------------------
% 1.79/0.60  TRYING [3]
% 1.79/0.61  TRYING [3]
% 1.79/0.61  TRYING [3]
% 1.79/0.61  % (4706)Instruction limit reached!
% 1.79/0.61  % (4706)------------------------------
% 1.79/0.61  % (4706)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.79/0.61  % (4706)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.79/0.61  % (4706)Termination reason: Unknown
% 1.79/0.61  % (4706)Termination phase: Finite model building constraint generation
% 1.79/0.61  
% 1.79/0.61  % (4706)Memory used [KB]: 7547
% 1.79/0.61  % (4706)Time elapsed: 0.162 s
% 1.79/0.61  % (4706)Instructions burned: 53 (million)
% 1.79/0.61  % (4706)------------------------------
% 1.79/0.61  % (4706)------------------------------
% 1.99/0.62  % (4702)Instruction limit reached!
% 1.99/0.62  % (4702)------------------------------
% 1.99/0.62  % (4702)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.99/0.62  % (4702)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.99/0.62  % (4702)Termination reason: Unknown
% 1.99/0.62  % (4702)Termination phase: Saturation
% 1.99/0.62  
% 1.99/0.62  % (4702)Memory used [KB]: 1663
% 1.99/0.62  % (4702)Time elapsed: 0.190 s
% 1.99/0.62  % (4702)Instructions burned: 37 (million)
% 1.99/0.62  % (4702)------------------------------
% 1.99/0.62  % (4702)------------------------------
% 1.99/0.62  % (4705)Instruction limit reached!
% 1.99/0.62  % (4705)------------------------------
% 1.99/0.62  % (4705)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.99/0.62  % (4705)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.99/0.62  % (4705)Termination reason: Unknown
% 1.99/0.62  % (4705)Termination phase: Saturation
% 1.99/0.62  
% 1.99/0.62  % (4705)Memory used [KB]: 6268
% 1.99/0.62  % (4705)Time elapsed: 0.192 s
% 1.99/0.62  % (4705)Instructions burned: 48 (million)
% 1.99/0.62  % (4705)------------------------------
% 1.99/0.62  % (4705)------------------------------
% 1.99/0.62  TRYING [1]
% 1.99/0.62  TRYING [2]
% 2.12/0.63  % (4703)Instruction limit reached!
% 2.12/0.63  % (4703)------------------------------
% 2.12/0.63  % (4703)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.63  % (4703)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.63  % (4703)Termination reason: Unknown
% 2.12/0.63  % (4703)Termination phase: Saturation
% 2.12/0.63  
% 2.12/0.63  % (4703)Memory used [KB]: 6652
% 2.12/0.63  % (4703)Time elapsed: 0.223 s
% 2.12/0.63  % (4703)Instructions burned: 51 (million)
% 2.12/0.63  % (4703)------------------------------
% 2.12/0.63  % (4703)------------------------------
% 2.12/0.63  % (4704)Instruction limit reached!
% 2.12/0.63  % (4704)------------------------------
% 2.12/0.63  % (4704)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.63  % (4704)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.63  % (4704)Termination reason: Unknown
% 2.12/0.63  % (4704)Termination phase: Saturation
% 2.12/0.63  
% 2.12/0.63  % (4704)Memory used [KB]: 6524
% 2.12/0.63  % (4704)Time elapsed: 0.223 s
% 2.12/0.63  % (4704)Instructions burned: 51 (million)
% 2.12/0.63  % (4704)------------------------------
% 2.12/0.63  % (4704)------------------------------
% 2.12/0.64  % (4709)Instruction limit reached!
% 2.12/0.64  % (4709)------------------------------
% 2.12/0.64  % (4709)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.64  % (4709)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.64  % (4709)Termination reason: Unknown
% 2.12/0.64  % (4709)Termination phase: Saturation
% 2.12/0.64  
% 2.12/0.64  % (4709)Memory used [KB]: 2174
% 2.12/0.64  % (4709)Time elapsed: 0.201 s
% 2.12/0.64  % (4709)Instructions burned: 52 (million)
% 2.12/0.64  % (4709)------------------------------
% 2.12/0.64  % (4709)------------------------------
% 2.12/0.65  % (4717)Instruction limit reached!
% 2.12/0.65  % (4717)------------------------------
% 2.12/0.65  % (4717)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.65  % (4717)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.65  % (4717)Termination reason: Unknown
% 2.12/0.65  % (4717)Termination phase: Finite model building constraint generation
% 2.12/0.65  
% 2.12/0.65  % (4717)Memory used [KB]: 7675
% 2.12/0.65  % (4717)Time elapsed: 0.224 s
% 2.12/0.65  % (4717)Instructions burned: 61 (million)
% 2.12/0.65  % (4717)------------------------------
% 2.12/0.65  % (4717)------------------------------
% 2.12/0.66  % (4714)Instruction limit reached!
% 2.12/0.66  % (4714)------------------------------
% 2.12/0.66  % (4714)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.66  % (4714)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.66  % (4714)Termination reason: Unknown
% 2.12/0.66  % (4714)Termination phase: Saturation
% 2.12/0.66  
% 2.12/0.66  % (4714)Memory used [KB]: 7036
% 2.12/0.66  % (4714)Time elapsed: 0.055 s
% 2.12/0.66  % (4714)Instructions burned: 68 (million)
% 2.12/0.66  % (4714)------------------------------
% 2.12/0.66  % (4714)------------------------------
% 2.12/0.66  % (4811)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/388Mi)
% 2.12/0.67  % (4710)Instruction limit reached!
% 2.12/0.67  % (4710)------------------------------
% 2.12/0.67  % (4710)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.67  % (4710)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.67  % (4710)Termination reason: Unknown
% 2.12/0.67  % (4710)Termination phase: Saturation
% 2.12/0.67  
% 2.12/0.67  % (4710)Memory used [KB]: 6524
% 2.12/0.67  % (4710)Time elapsed: 0.237 s
% 2.12/0.67  % (4710)Instructions burned: 51 (million)
% 2.12/0.67  % (4710)------------------------------
% 2.12/0.67  % (4710)------------------------------
% 2.12/0.67  % (4715)Instruction limit reached!
% 2.12/0.67  % (4715)------------------------------
% 2.12/0.67  % (4715)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.67  % (4715)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.67  % (4715)Termination reason: Unknown
% 2.12/0.67  % (4715)Termination phase: Saturation
% 2.12/0.67  
% 2.12/0.67  % (4715)Memory used [KB]: 2558
% 2.12/0.67  % (4715)Time elapsed: 0.216 s
% 2.12/0.67  % (4715)Instructions burned: 75 (million)
% 2.12/0.67  % (4715)------------------------------
% 2.12/0.67  % (4715)------------------------------
% 2.12/0.68  % (4719)First to succeed.
% 2.12/0.68  % (4719)Refutation found. Thanks to Tanya!
% 2.12/0.68  % SZS status Theorem for theBenchmark
% 2.12/0.68  % SZS output start Proof for theBenchmark
% See solution above
% 2.12/0.68  % (4719)------------------------------
% 2.12/0.68  % (4719)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.12/0.68  % (4719)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.12/0.68  % (4719)Termination reason: Refutation
% 2.12/0.68  
% 2.12/0.68  % (4719)Memory used [KB]: 2302
% 2.12/0.68  % (4719)Time elapsed: 0.252 s
% 2.12/0.68  % (4719)Instructions burned: 63 (million)
% 2.12/0.68  % (4719)------------------------------
% 2.12/0.68  % (4719)------------------------------
% 2.12/0.68  % (4699)Success in time 0.316 s
%------------------------------------------------------------------------------