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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC389+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 : n028.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:40:53 EDT 2022

% Result   : Theorem 1.54s 0.63s
% Output   : Refutation 1.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   32
% Syntax   : Number of formulae    :  121 (   8 unt;   0 def)
%            Number of atoms       :  642 ( 153 equ)
%            Maximal formula atoms :   44 (   5 avg)
%            Number of connectives :  794 ( 273   ~; 259   |; 211   &)
%                                         (  23 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   24 (  22 usr;  16 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-2 aty)
%            Number of variables   :  186 ( 109   !;  77   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3002,plain,
    $false,
    inference(avatar_sat_refutation,[],[f605,f614,f632,f637,f642,f653,f662,f676,f682,f685,f690,f691,f692,f693,f704,f711,f835,f940,f958,f2011,f2973]) ).

fof(f2973,plain,
    ( spl54_2
    | ~ spl54_10
    | ~ spl54_4
    | ~ spl54_28
    | ~ spl54_34
    | ~ spl54_7 ),
    inference(avatar_split_clause,[],[f2942,f625,f832,f776,f611,f639,f602]) ).

fof(f602,plain,
    ( spl54_2
  <=> segmentP(sK6,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_2])]) ).

fof(f639,plain,
    ( spl54_10
  <=> ssList(sK9) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_10])]) ).

fof(f611,plain,
    ( spl54_4
  <=> ssList(sK8) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_4])]) ).

fof(f776,plain,
    ( spl54_28
  <=> ssList(sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_28])]) ).

fof(f832,plain,
    ( spl54_34
  <=> ssList(sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_34])]) ).

fof(f625,plain,
    ( spl54_7
  <=> app(app(sK8,sK3),sK9) = sK6 ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_7])]) ).

fof(f2942,plain,
    ( ~ ssList(sK3)
    | ~ ssList(sK6)
    | ~ ssList(sK8)
    | ~ ssList(sK9)
    | segmentP(sK6,sK3)
    | ~ spl54_7 ),
    inference(superposition,[],[f578,f627]) ).

fof(f627,plain,
    ( app(app(sK8,sK3),sK9) = sK6
    | ~ spl54_7 ),
    inference(avatar_component_clause,[],[f625]) ).

fof(f578,plain,
    ! [X2,X3,X1] :
      ( segmentP(app(app(X2,X1),X3),X1)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(app(app(X2,X1),X3)) ),
    inference(equality_resolution,[],[f471]) ).

fof(f471,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(X1)
      | segmentP(X0,X1)
      | ~ ssList(X2)
      | app(app(X2,X1),X3) != X0
      | ~ ssList(X3)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f301]) ).

fof(f301,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) ) ) )
            & ( ( ssList(sK39(X0,X1))
                & app(app(sK39(X0,X1),X1),sK40(X0,X1)) = X0
                & ssList(sK40(X0,X1)) )
              | ~ segmentP(X0,X1) ) ) )
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK39,sK40])],[f298,f300,f299]) ).

fof(f299,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( ssList(X4)
          & ? [X5] :
              ( app(app(X4,X1),X5) = X0
              & ssList(X5) ) )
     => ( ssList(sK39(X0,X1))
        & ? [X5] :
            ( app(app(sK39(X0,X1),X1),X5) = X0
            & ssList(X5) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f300,plain,
    ! [X0,X1] :
      ( ? [X5] :
          ( app(app(sK39(X0,X1),X1),X5) = X0
          & ssList(X5) )
     => ( app(app(sK39(X0,X1),X1),sK40(X0,X1)) = X0
        & ssList(sK40(X0,X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f298,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) ) ) )
            & ( ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( app(app(X4,X1),X5) = X0
                      & ssList(X5) ) )
              | ~ segmentP(X0,X1) ) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f297]) ).

fof(f297,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( app(app(X2,X1),X3) != X0
                      | ~ ssList(X3) ) ) )
            & ( ? [X2] :
                  ( ssList(X2)
                  & ? [X3] :
                      ( app(app(X2,X1),X3) = X0
                      & ssList(X3) ) )
              | ~ segmentP(X0,X1) ) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f188]) ).

fof(f188,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ ssList(X1)
          | ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( app(app(X2,X1),X3) = X0
                    & ssList(X3) ) ) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( app(app(X2,X1),X3) = X0
                    & ssList(X3) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).

fof(f2011,plain,
    spl54_28,
    inference(avatar_split_clause,[],[f350,f776]) ).

fof(f350,plain,
    ssList(sK6),
    inference(cnf_transformation,[],[f239]) ).

fof(f239,plain,
    ( ssList(sK3)
    & ssList(sK4)
    & ssList(sK5)
    & ( ( ~ singletonP(sK3)
        & neq(sK4,nil) )
      | ~ segmentP(sK4,sK3) )
    & sK4 = sK6
    & sK5 = sK3
    & ( ( sK5 = cons(sK7,nil)
        & app(app(sK8,sK5),sK9) = sK6
        & ! [X7] :
            ( ~ memberP(sK8,X7)
            | ~ lt(sK7,X7)
            | ~ ssItem(X7) )
        & ! [X8] :
            ( ~ lt(X8,sK7)
            | ~ ssItem(X8)
            | ~ memberP(sK9,X8) )
        & ssList(sK9)
        & ssList(sK8)
        & ssItem(sK7) )
      | ( nil = sK6
        & nil = sK5 ) )
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9])],[f99,f238,f237,f236,f235,f234,f233,f232]) ).

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

fof(f233,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ( ( ~ singletonP(sK3)
                    & neq(X1,nil) )
                  | ~ segmentP(X1,sK3) )
                & X1 = X3
                & sK3 = X2
                & ( ? [X4] :
                      ( ? [X5] :
                          ( ? [X6] :
                              ( cons(X4,nil) = X2
                              & app(app(X5,X2),X6) = X3
                              & ! [X7] :
                                  ( ~ memberP(X5,X7)
                                  | ~ lt(X4,X7)
                                  | ~ ssItem(X7) )
                              & ! [X8] :
                                  ( ~ lt(X8,X4)
                                  | ~ ssItem(X8)
                                  | ~ memberP(X6,X8) )
                              & ssList(X6) )
                          & ssList(X5) )
                      & ssItem(X4) )
                  | ( nil = X3
                    & nil = X2 ) )
                & ssList(X3) ) ) )
   => ( ssList(sK4)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( ( ( ~ singletonP(sK3)
                  & neq(sK4,nil) )
                | ~ segmentP(sK4,sK3) )
              & sK4 = X3
              & sK3 = X2
              & ( ? [X4] :
                    ( ? [X5] :
                        ( ? [X6] :
                            ( cons(X4,nil) = X2
                            & app(app(X5,X2),X6) = X3
                            & ! [X7] :
                                ( ~ memberP(X5,X7)
                                | ~ lt(X4,X7)
                                | ~ ssItem(X7) )
                            & ! [X8] :
                                ( ~ lt(X8,X4)
                                | ~ ssItem(X8)
                                | ~ memberP(X6,X8) )
                            & ssList(X6) )
                        & ssList(X5) )
                    & ssItem(X4) )
                | ( nil = X3
                  & nil = X2 ) )
              & ssList(X3) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f234,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( ( ( ~ singletonP(sK3)
                & neq(sK4,nil) )
              | ~ segmentP(sK4,sK3) )
            & sK4 = X3
            & sK3 = X2
            & ( ? [X4] :
                  ( ? [X5] :
                      ( ? [X6] :
                          ( cons(X4,nil) = X2
                          & app(app(X5,X2),X6) = X3
                          & ! [X7] :
                              ( ~ memberP(X5,X7)
                              | ~ lt(X4,X7)
                              | ~ ssItem(X7) )
                          & ! [X8] :
                              ( ~ lt(X8,X4)
                              | ~ ssItem(X8)
                              | ~ memberP(X6,X8) )
                          & ssList(X6) )
                      & ssList(X5) )
                  & ssItem(X4) )
              | ( nil = X3
                & nil = X2 ) )
            & ssList(X3) ) )
   => ( ssList(sK5)
      & ? [X3] :
          ( ( ( ~ singletonP(sK3)
              & neq(sK4,nil) )
            | ~ segmentP(sK4,sK3) )
          & sK4 = X3
          & sK5 = sK3
          & ( ? [X4] :
                ( ? [X5] :
                    ( ? [X6] :
                        ( cons(X4,nil) = sK5
                        & app(app(X5,sK5),X6) = X3
                        & ! [X7] :
                            ( ~ memberP(X5,X7)
                            | ~ lt(X4,X7)
                            | ~ ssItem(X7) )
                        & ! [X8] :
                            ( ~ lt(X8,X4)
                            | ~ ssItem(X8)
                            | ~ memberP(X6,X8) )
                        & ssList(X6) )
                    & ssList(X5) )
                & ssItem(X4) )
            | ( nil = X3
              & nil = sK5 ) )
          & ssList(X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f235,plain,
    ( ? [X3] :
        ( ( ( ~ singletonP(sK3)
            & neq(sK4,nil) )
          | ~ segmentP(sK4,sK3) )
        & sK4 = X3
        & sK5 = sK3
        & ( ? [X4] :
              ( ? [X5] :
                  ( ? [X6] :
                      ( cons(X4,nil) = sK5
                      & app(app(X5,sK5),X6) = X3
                      & ! [X7] :
                          ( ~ memberP(X5,X7)
                          | ~ lt(X4,X7)
                          | ~ ssItem(X7) )
                      & ! [X8] :
                          ( ~ lt(X8,X4)
                          | ~ ssItem(X8)
                          | ~ memberP(X6,X8) )
                      & ssList(X6) )
                  & ssList(X5) )
              & ssItem(X4) )
          | ( nil = X3
            & nil = sK5 ) )
        & ssList(X3) )
   => ( ( ( ~ singletonP(sK3)
          & neq(sK4,nil) )
        | ~ segmentP(sK4,sK3) )
      & sK4 = sK6
      & sK5 = sK3
      & ( ? [X4] :
            ( ? [X5] :
                ( ? [X6] :
                    ( cons(X4,nil) = sK5
                    & app(app(X5,sK5),X6) = sK6
                    & ! [X7] :
                        ( ~ memberP(X5,X7)
                        | ~ lt(X4,X7)
                        | ~ ssItem(X7) )
                    & ! [X8] :
                        ( ~ lt(X8,X4)
                        | ~ ssItem(X8)
                        | ~ memberP(X6,X8) )
                    & ssList(X6) )
                & ssList(X5) )
            & ssItem(X4) )
        | ( nil = sK6
          & nil = sK5 ) )
      & ssList(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f236,plain,
    ( ? [X4] :
        ( ? [X5] :
            ( ? [X6] :
                ( cons(X4,nil) = sK5
                & app(app(X5,sK5),X6) = sK6
                & ! [X7] :
                    ( ~ memberP(X5,X7)
                    | ~ lt(X4,X7)
                    | ~ ssItem(X7) )
                & ! [X8] :
                    ( ~ lt(X8,X4)
                    | ~ ssItem(X8)
                    | ~ memberP(X6,X8) )
                & ssList(X6) )
            & ssList(X5) )
        & ssItem(X4) )
   => ( ? [X5] :
          ( ? [X6] :
              ( sK5 = cons(sK7,nil)
              & app(app(X5,sK5),X6) = sK6
              & ! [X7] :
                  ( ~ memberP(X5,X7)
                  | ~ lt(sK7,X7)
                  | ~ ssItem(X7) )
              & ! [X8] :
                  ( ~ lt(X8,sK7)
                  | ~ ssItem(X8)
                  | ~ memberP(X6,X8) )
              & ssList(X6) )
          & ssList(X5) )
      & ssItem(sK7) ) ),
    introduced(choice_axiom,[]) ).

fof(f237,plain,
    ( ? [X5] :
        ( ? [X6] :
            ( sK5 = cons(sK7,nil)
            & app(app(X5,sK5),X6) = sK6
            & ! [X7] :
                ( ~ memberP(X5,X7)
                | ~ lt(sK7,X7)
                | ~ ssItem(X7) )
            & ! [X8] :
                ( ~ lt(X8,sK7)
                | ~ ssItem(X8)
                | ~ memberP(X6,X8) )
            & ssList(X6) )
        & ssList(X5) )
   => ( ? [X6] :
          ( sK5 = cons(sK7,nil)
          & app(app(sK8,sK5),X6) = sK6
          & ! [X7] :
              ( ~ memberP(sK8,X7)
              | ~ lt(sK7,X7)
              | ~ ssItem(X7) )
          & ! [X8] :
              ( ~ lt(X8,sK7)
              | ~ ssItem(X8)
              | ~ memberP(X6,X8) )
          & ssList(X6) )
      & ssList(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f238,plain,
    ( ? [X6] :
        ( sK5 = cons(sK7,nil)
        & app(app(sK8,sK5),X6) = sK6
        & ! [X7] :
            ( ~ memberP(sK8,X7)
            | ~ lt(sK7,X7)
            | ~ ssItem(X7) )
        & ! [X8] :
            ( ~ lt(X8,sK7)
            | ~ ssItem(X8)
            | ~ memberP(X6,X8) )
        & ssList(X6) )
   => ( sK5 = cons(sK7,nil)
      & app(app(sK8,sK5),sK9) = sK6
      & ! [X7] :
          ( ~ memberP(sK8,X7)
          | ~ lt(sK7,X7)
          | ~ ssItem(X7) )
      & ! [X8] :
          ( ~ lt(X8,sK7)
          | ~ ssItem(X8)
          | ~ memberP(sK9,X8) )
      & ssList(sK9) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f958,plain,
    ( ~ spl54_19
    | spl54_1
    | ~ spl54_17
    | ~ spl54_46 ),
    inference(avatar_split_clause,[],[f956,f938,f673,f598,f687]) ).

fof(f687,plain,
    ( spl54_19
  <=> ssItem(sK7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_19])]) ).

fof(f598,plain,
    ( spl54_1
  <=> singletonP(sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_1])]) ).

fof(f673,plain,
    ( spl54_17
  <=> cons(sK7,nil) = sK3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_17])]) ).

fof(f938,plain,
    ( spl54_46
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | singletonP(cons(X0,nil)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_46])]) ).

fof(f956,plain,
    ( singletonP(sK3)
    | ~ ssItem(sK7)
    | ~ spl54_17
    | ~ spl54_46 ),
    inference(superposition,[],[f939,f675]) ).

fof(f675,plain,
    ( cons(sK7,nil) = sK3
    | ~ spl54_17 ),
    inference(avatar_component_clause,[],[f673]) ).

fof(f939,plain,
    ( ! [X0] :
        ( singletonP(cons(X0,nil))
        | ~ ssItem(X0) )
    | ~ spl54_46 ),
    inference(avatar_component_clause,[],[f938]) ).

fof(f940,plain,
    ( ~ spl54_5
    | spl54_46 ),
    inference(avatar_split_clause,[],[f934,f938,f616]) ).

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

fof(f934,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | singletonP(cons(X0,nil))
      | ~ ssList(nil) ),
    inference(duplicate_literal_removal,[],[f931]) ).

fof(f931,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ ssList(nil)
      | singletonP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(resolution,[],[f564,f538]) ).

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

fof(f149,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) ) ),
    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(f564,plain,
    ! [X1] :
      ( ~ ssList(cons(X1,nil))
      | ~ ssItem(X1)
      | singletonP(cons(X1,nil)) ),
    inference(equality_resolution,[],[f345]) ).

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

fof(f226,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ( ( singletonP(X0)
          | ! [X1] :
              ( ~ ssItem(X1)
              | cons(X1,nil) != X0 ) )
        & ( ( ssItem(sK0(X0))
            & cons(sK0(X0),nil) = X0 )
          | ~ singletonP(X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f224,f225]) ).

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

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

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

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

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

fof(f835,plain,
    ( ~ spl54_19
    | spl54_34
    | ~ spl54_5
    | ~ spl54_17 ),
    inference(avatar_split_clause,[],[f809,f673,f616,f832,f687]) ).

fof(f809,plain,
    ( ~ ssList(nil)
    | ssList(sK3)
    | ~ ssItem(sK7)
    | ~ spl54_17 ),
    inference(superposition,[],[f538,f675]) ).

fof(f711,plain,
    ( ~ spl54_5
    | ~ spl54_3
    | ~ spl54_14 ),
    inference(avatar_split_clause,[],[f710,f659,f607,f616]) ).

fof(f607,plain,
    ( spl54_3
  <=> nil = sK6 ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_3])]) ).

fof(f659,plain,
    ( spl54_14
  <=> neq(sK6,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_14])]) ).

fof(f710,plain,
    ( ~ ssList(nil)
    | ~ spl54_3
    | ~ spl54_14 ),
    inference(resolution,[],[f592,f709]) ).

fof(f709,plain,
    ( neq(nil,nil)
    | ~ spl54_3
    | ~ spl54_14 ),
    inference(forward_demodulation,[],[f661,f609]) ).

fof(f609,plain,
    ( nil = sK6
    | ~ spl54_3 ),
    inference(avatar_component_clause,[],[f607]) ).

fof(f661,plain,
    ( neq(sK6,nil)
    | ~ spl54_14 ),
    inference(avatar_component_clause,[],[f659]) ).

fof(f592,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f586]) ).

fof(f586,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f519]) ).

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

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

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

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

fof(f704,plain,
    ( ~ spl54_9
    | spl54_2
    | ~ spl54_3
    | ~ spl54_8 ),
    inference(avatar_split_clause,[],[f703,f629,f607,f602,f634]) ).

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

fof(f629,plain,
    ( spl54_8
  <=> nil = sK3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl54_8])]) ).

fof(f703,plain,
    ( ~ segmentP(nil,nil)
    | spl54_2
    | ~ spl54_3
    | ~ spl54_8 ),
    inference(forward_demodulation,[],[f694,f631]) ).

fof(f631,plain,
    ( nil = sK3
    | ~ spl54_8 ),
    inference(avatar_component_clause,[],[f629]) ).

fof(f694,plain,
    ( ~ segmentP(nil,sK3)
    | spl54_2
    | ~ spl54_3 ),
    inference(backward_demodulation,[],[f604,f609]) ).

fof(f604,plain,
    ( ~ segmentP(sK6,sK3)
    | spl54_2 ),
    inference(avatar_component_clause,[],[f602]) ).

fof(f693,plain,
    ( spl54_3
    | spl54_17 ),
    inference(avatar_split_clause,[],[f554,f673,f607]) ).

fof(f554,plain,
    ( cons(sK7,nil) = sK3
    | nil = sK6 ),
    inference(definition_unfolding,[],[f364,f365]) ).

fof(f365,plain,
    sK5 = sK3,
    inference(cnf_transformation,[],[f239]) ).

fof(f364,plain,
    ( sK5 = cons(sK7,nil)
    | nil = sK6 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f692,plain,
    ( spl54_3
    | spl54_7 ),
    inference(avatar_split_clause,[],[f556,f625,f607]) ).

fof(f556,plain,
    ( app(app(sK8,sK3),sK9) = sK6
    | nil = sK6 ),
    inference(definition_unfolding,[],[f362,f365]) ).

fof(f362,plain,
    ( app(app(sK8,sK5),sK9) = sK6
    | nil = sK6 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f691,plain,
    ( spl54_19
    | spl54_3 ),
    inference(avatar_split_clause,[],[f352,f607,f687]) ).

fof(f352,plain,
    ( nil = sK6
    | ssItem(sK7) ),
    inference(cnf_transformation,[],[f239]) ).

fof(f690,plain,
    ( spl54_8
    | spl54_19 ),
    inference(avatar_split_clause,[],[f562,f687,f629]) ).

fof(f562,plain,
    ( ssItem(sK7)
    | nil = sK3 ),
    inference(definition_unfolding,[],[f351,f365]) ).

fof(f351,plain,
    ( ssItem(sK7)
    | nil = sK5 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f685,plain,
    spl54_5,
    inference(avatar_split_clause,[],[f532,f616]) ).

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

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

fof(f682,plain,
    ( spl54_8
    | spl54_10 ),
    inference(avatar_split_clause,[],[f560,f639,f629]) ).

fof(f560,plain,
    ( ssList(sK9)
    | nil = sK3 ),
    inference(definition_unfolding,[],[f355,f365]) ).

fof(f355,plain,
    ( ssList(sK9)
    | nil = sK5 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f676,plain,
    ( spl54_8
    | spl54_17 ),
    inference(avatar_split_clause,[],[f555,f673,f629]) ).

fof(f555,plain,
    ( cons(sK7,nil) = sK3
    | nil = sK3 ),
    inference(definition_unfolding,[],[f363,f365,f365]) ).

fof(f363,plain,
    ( sK5 = cons(sK7,nil)
    | nil = sK5 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f662,plain,
    ( ~ spl54_2
    | spl54_14 ),
    inference(avatar_split_clause,[],[f553,f659,f602]) ).

fof(f553,plain,
    ( neq(sK6,nil)
    | ~ segmentP(sK6,sK3) ),
    inference(definition_unfolding,[],[f367,f366,f366]) ).

fof(f366,plain,
    sK4 = sK6,
    inference(cnf_transformation,[],[f239]) ).

fof(f367,plain,
    ( neq(sK4,nil)
    | ~ segmentP(sK4,sK3) ),
    inference(cnf_transformation,[],[f239]) ).

fof(f653,plain,
    ( spl54_4
    | spl54_8 ),
    inference(avatar_split_clause,[],[f561,f629,f611]) ).

fof(f561,plain,
    ( nil = sK3
    | ssList(sK8) ),
    inference(definition_unfolding,[],[f353,f365]) ).

fof(f353,plain,
    ( ssList(sK8)
    | nil = sK5 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f642,plain,
    ( spl54_10
    | spl54_3 ),
    inference(avatar_split_clause,[],[f356,f607,f639]) ).

fof(f356,plain,
    ( nil = sK6
    | ssList(sK9) ),
    inference(cnf_transformation,[],[f239]) ).

fof(f637,plain,
    ( ~ spl54_5
    | spl54_9 ),
    inference(avatar_split_clause,[],[f569,f634,f616]) ).

fof(f569,plain,
    ( segmentP(nil,nil)
    | ~ ssList(nil) ),
    inference(equality_resolution,[],[f415]) ).

fof(f415,plain,
    ! [X0] :
      ( segmentP(nil,X0)
      | nil != X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f264]) ).

fof(f264,plain,
    ! [X0] :
      ( ( ( nil = X0
          | ~ segmentP(nil,X0) )
        & ( segmentP(nil,X0)
          | nil != X0 ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f116]) ).

fof(f116,plain,
    ! [X0] :
      ( ( nil = X0
      <=> segmentP(nil,X0) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f58,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil = X0
      <=> segmentP(nil,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).

fof(f632,plain,
    ( spl54_7
    | spl54_8 ),
    inference(avatar_split_clause,[],[f557,f629,f625]) ).

fof(f557,plain,
    ( nil = sK3
    | app(app(sK8,sK3),sK9) = sK6 ),
    inference(definition_unfolding,[],[f361,f365,f365]) ).

fof(f361,plain,
    ( app(app(sK8,sK5),sK9) = sK6
    | nil = sK5 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f614,plain,
    ( spl54_3
    | spl54_4 ),
    inference(avatar_split_clause,[],[f354,f611,f607]) ).

fof(f354,plain,
    ( ssList(sK8)
    | nil = sK6 ),
    inference(cnf_transformation,[],[f239]) ).

fof(f605,plain,
    ( ~ spl54_1
    | ~ spl54_2 ),
    inference(avatar_split_clause,[],[f552,f602,f598]) ).

fof(f552,plain,
    ( ~ segmentP(sK6,sK3)
    | ~ singletonP(sK3) ),
    inference(definition_unfolding,[],[f368,f366]) ).

fof(f368,plain,
    ( ~ singletonP(sK3)
    | ~ segmentP(sK4,sK3) ),
    inference(cnf_transformation,[],[f239]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC389+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 19:01:49 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.53  % (6590)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.20/0.54  % (6606)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.20/0.55  % (6599)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.20/0.55  % (6597)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.29/0.55  % (6589)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.29/0.56  % (6597)Instruction limit reached!
% 1.29/0.56  % (6597)------------------------------
% 1.29/0.56  % (6597)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.56  % (6597)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.56  % (6597)Termination reason: Unknown
% 1.29/0.56  % (6597)Termination phase: shuffling
% 1.29/0.56  
% 1.29/0.56  % (6597)Memory used [KB]: 1535
% 1.29/0.56  % (6597)Time elapsed: 0.005 s
% 1.29/0.56  % (6597)Instructions burned: 3 (million)
% 1.29/0.56  % (6597)------------------------------
% 1.29/0.56  % (6597)------------------------------
% 1.29/0.56  % (6605)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 1.54/0.59  % (6583)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.54/0.60  % (6612)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.54/0.60  % (6602)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 1.54/0.60  % (6594)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)
% 1.54/0.60  % (6595)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.54/0.60  % (6607)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.54/0.60  % (6593)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.54/0.60  % (6596)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.54/0.61  % (6589)Instruction limit reached!
% 1.54/0.61  % (6589)------------------------------
% 1.54/0.61  % (6589)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.61  % (6589)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.61  % (6589)Termination reason: Unknown
% 1.54/0.61  % (6589)Termination phase: Saturation
% 1.54/0.61  
% 1.54/0.61  % (6589)Memory used [KB]: 6524
% 1.54/0.61  % (6589)Time elapsed: 0.168 s
% 1.54/0.61  % (6588)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.54/0.61  % (6589)Instructions burned: 39 (million)
% 1.54/0.61  % (6589)------------------------------
% 1.54/0.61  % (6589)------------------------------
% 1.54/0.61  % (6611)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 1.54/0.61  % (6610)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 1.54/0.61  % (6609)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.54/0.61  % (6587)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.54/0.61  % (6585)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.54/0.61  % (6586)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.54/0.61  % (6585)Instruction limit reached!
% 1.54/0.61  % (6585)------------------------------
% 1.54/0.61  % (6585)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.61  % (6585)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.61  % (6585)Termination reason: Unknown
% 1.54/0.61  % (6585)Termination phase: Preprocessing 3
% 1.54/0.61  
% 1.54/0.61  % (6585)Memory used [KB]: 1535
% 1.54/0.61  % (6585)Time elapsed: 0.005 s
% 1.54/0.61  % (6585)Instructions burned: 3 (million)
% 1.54/0.61  % (6585)------------------------------
% 1.54/0.61  % (6585)------------------------------
% 1.54/0.61  % (6601)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.54/0.62  % (6598)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.54/0.62  % (6601)Instruction limit reached!
% 1.54/0.62  % (6601)------------------------------
% 1.54/0.62  % (6601)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.62  % (6601)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.62  % (6601)Termination reason: Unknown
% 1.54/0.62  % (6601)Termination phase: Preprocessing 2
% 1.54/0.62  
% 1.54/0.62  % (6601)Memory used [KB]: 1535
% 1.54/0.62  % (6601)Time elapsed: 0.004 s
% 1.54/0.62  % (6601)Instructions burned: 2 (million)
% 1.54/0.62  % (6601)------------------------------
% 1.54/0.62  % (6601)------------------------------
% 1.54/0.62  % (6604)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.54/0.62  % (6603)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.54/0.62  % (6598)Instruction limit reached!
% 1.54/0.62  % (6598)------------------------------
% 1.54/0.62  % (6598)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.62  % (6598)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.62  % (6598)Termination reason: Unknown
% 1.54/0.62  % (6598)Termination phase: Property scanning
% 1.54/0.62  
% 1.54/0.62  % (6598)Memory used [KB]: 1791
% 1.54/0.62  % (6598)Time elapsed: 0.007 s
% 1.54/0.62  % (6598)Instructions burned: 7 (million)
% 1.54/0.62  % (6598)------------------------------
% 1.54/0.62  % (6598)------------------------------
% 1.54/0.62  % (6591)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.54/0.63  % (6605)First to succeed.
% 1.54/0.63  % (6594)Instruction limit reached!
% 1.54/0.63  % (6594)------------------------------
% 1.54/0.63  % (6594)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.63  % (6594)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.63  % (6594)Termination reason: Unknown
% 1.54/0.63  % (6594)Termination phase: Saturation
% 1.54/0.63  
% 1.54/0.63  % (6594)Memory used [KB]: 6140
% 1.54/0.63  % (6594)Time elapsed: 0.008 s
% 1.54/0.63  % (6594)Instructions burned: 7 (million)
% 1.54/0.63  % (6594)------------------------------
% 1.54/0.63  % (6594)------------------------------
% 1.54/0.63  % (6593)Instruction limit reached!
% 1.54/0.63  % (6593)------------------------------
% 1.54/0.63  % (6593)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.63  % (6593)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.63  % (6593)Termination reason: Unknown
% 1.54/0.63  % (6593)Termination phase: Saturation
% 1.54/0.63  
% 1.54/0.63  % (6593)Memory used [KB]: 6268
% 1.54/0.63  % (6593)Time elapsed: 0.197 s
% 1.54/0.63  % (6593)Instructions burned: 12 (million)
% 1.54/0.63  % (6593)------------------------------
% 1.54/0.63  % (6593)------------------------------
% 1.54/0.63  % (6590)Instruction limit reached!
% 1.54/0.63  % (6590)------------------------------
% 1.54/0.63  % (6590)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.63  % (6590)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.63  % (6590)Termination reason: Unknown
% 1.54/0.63  % (6590)Termination phase: Saturation
% 1.54/0.63  
% 1.54/0.63  % (6590)Memory used [KB]: 6652
% 1.54/0.63  % (6590)Time elapsed: 0.206 s
% 1.54/0.63  % (6590)Instructions burned: 40 (million)
% 1.54/0.63  % (6590)------------------------------
% 1.54/0.63  % (6590)------------------------------
% 1.54/0.63  % (6605)Refutation found. Thanks to Tanya!
% 1.54/0.63  % SZS status Theorem for theBenchmark
% 1.54/0.63  % SZS output start Proof for theBenchmark
% See solution above
% 1.54/0.63  % (6605)------------------------------
% 1.54/0.63  % (6605)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.63  % (6605)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.63  % (6605)Termination reason: Refutation
% 1.54/0.63  
% 1.54/0.63  % (6605)Memory used [KB]: 7931
% 1.54/0.63  % (6605)Time elapsed: 0.204 s
% 1.54/0.63  % (6605)Instructions burned: 59 (million)
% 1.54/0.63  % (6605)------------------------------
% 1.54/0.63  % (6605)------------------------------
% 1.54/0.63  % (6582)Success in time 0.271 s
%------------------------------------------------------------------------------