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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC223+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 : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:39:42 EDT 2022

% Result   : Theorem 1.71s 0.57s
% Output   : Refutation 1.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   81 (   8 unt;   0 def)
%            Number of atoms       :  588 ( 119 equ)
%            Maximal formula atoms :   50 (   7 avg)
%            Number of connectives :  823 ( 316   ~; 305   |; 175   &)
%                                         (   3 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :  210 ( 151   !;  59   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f383,plain,
    $false,
    inference(avatar_sat_refutation,[],[f224,f366,f372,f382]) ).

fof(f382,plain,
    ( ~ spl11_1
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(avatar_contradiction_clause,[],[f381]) ).

fof(f381,plain,
    ( $false
    | ~ spl11_1
    | ~ spl11_3
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f380,f361]) ).

fof(f361,plain,
    ( ssItem(sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_3 ),
    inference(avatar_component_clause,[],[f359]) ).

fof(f359,plain,
    ( spl11_3
  <=> ssItem(sK6(sK1(sK4),nil,sK0(sK4))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).

fof(f380,plain,
    ( ~ ssItem(sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_1
    | ~ spl11_4 ),
    inference(resolution,[],[f379,f191]) ).

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

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

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

fof(f379,plain,
    ( memberP(nil,sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_1
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f378,f176]) ).

fof(f176,plain,
    ssList(sK4),
    inference(cnf_transformation,[],[f139]) ).

fof(f139,plain,
    ( sK3 = sK5
    & nil != sK2
    & ssList(sK5)
    & sK2 = sK4
    & ! [X4] :
        ( ~ ssItem(X4)
        | ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( ( ssItem(sK6(X4,X5,X6))
                  & leq(X4,sK6(X4,X5,X6))
                  & memberP(X6,sK6(X4,X5,X6))
                  & memberP(X5,sK6(X4,X5,X6))
                  & ~ leq(sK6(X4,X5,X6),X4) )
                | ~ ssList(X6)
                | app(app(X5,cons(X4,nil)),X6) != sK2 ) ) )
    & ! [X8] :
        ( ! [X9] :
            ( ~ ssList(X9)
            | ! [X10] :
                ( ~ ssList(X10)
                | ! [X11] :
                    ( ( ( ~ memberP(X9,X11)
                        | leq(X11,X8) )
                      & ( leq(X8,X11)
                        | ~ memberP(X10,X11) ) )
                    | ~ ssItem(X11) )
                | app(app(X9,cons(X8,nil)),X10) != sK4 ) )
        | ~ ssItem(X8) )
    & ssList(sK4)
    & ssList(sK3)
    & ssList(sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f111,f138,f137,f136,f135,f134]) ).

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

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

fof(f136,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( sK3 = X3
            & nil != sK2
            & ssList(X3)
            & sK2 = X2
            & ! [X4] :
                ( ~ ssItem(X4)
                | ! [X5] :
                    ( ~ ssList(X5)
                    | ! [X6] :
                        ( ? [X7] :
                            ( ssItem(X7)
                            & leq(X4,X7)
                            & memberP(X6,X7)
                            & memberP(X5,X7)
                            & ~ leq(X7,X4) )
                        | ~ ssList(X6)
                        | app(app(X5,cons(X4,nil)),X6) != sK2 ) ) )
            & ! [X8] :
                ( ! [X9] :
                    ( ~ ssList(X9)
                    | ! [X10] :
                        ( ~ ssList(X10)
                        | ! [X11] :
                            ( ( ( ~ memberP(X9,X11)
                                | leq(X11,X8) )
                              & ( leq(X8,X11)
                                | ~ memberP(X10,X11) ) )
                            | ~ ssItem(X11) )
                        | app(app(X9,cons(X8,nil)),X10) != X2 ) )
                | ~ ssItem(X8) ) )
        & ssList(X2) )
   => ( ? [X3] :
          ( sK3 = X3
          & nil != sK2
          & ssList(X3)
          & sK2 = sK4
          & ! [X4] :
              ( ~ ssItem(X4)
              | ! [X5] :
                  ( ~ ssList(X5)
                  | ! [X6] :
                      ( ? [X7] :
                          ( ssItem(X7)
                          & leq(X4,X7)
                          & memberP(X6,X7)
                          & memberP(X5,X7)
                          & ~ leq(X7,X4) )
                      | ~ ssList(X6)
                      | app(app(X5,cons(X4,nil)),X6) != sK2 ) ) )
          & ! [X8] :
              ( ! [X9] :
                  ( ~ ssList(X9)
                  | ! [X10] :
                      ( ~ ssList(X10)
                      | ! [X11] :
                          ( ( ( ~ memberP(X9,X11)
                              | leq(X11,X8) )
                            & ( leq(X8,X11)
                              | ~ memberP(X10,X11) ) )
                          | ~ ssItem(X11) )
                      | app(app(X9,cons(X8,nil)),X10) != sK4 ) )
              | ~ ssItem(X8) ) )
      & ssList(sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f137,plain,
    ( ? [X3] :
        ( sK3 = X3
        & nil != sK2
        & ssList(X3)
        & sK2 = sK4
        & ! [X4] :
            ( ~ ssItem(X4)
            | ! [X5] :
                ( ~ ssList(X5)
                | ! [X6] :
                    ( ? [X7] :
                        ( ssItem(X7)
                        & leq(X4,X7)
                        & memberP(X6,X7)
                        & memberP(X5,X7)
                        & ~ leq(X7,X4) )
                    | ~ ssList(X6)
                    | app(app(X5,cons(X4,nil)),X6) != sK2 ) ) )
        & ! [X8] :
            ( ! [X9] :
                ( ~ ssList(X9)
                | ! [X10] :
                    ( ~ ssList(X10)
                    | ! [X11] :
                        ( ( ( ~ memberP(X9,X11)
                            | leq(X11,X8) )
                          & ( leq(X8,X11)
                            | ~ memberP(X10,X11) ) )
                        | ~ ssItem(X11) )
                    | app(app(X9,cons(X8,nil)),X10) != sK4 ) )
            | ~ ssItem(X8) ) )
   => ( sK3 = sK5
      & nil != sK2
      & ssList(sK5)
      & sK2 = sK4
      & ! [X4] :
          ( ~ ssItem(X4)
          | ! [X5] :
              ( ~ ssList(X5)
              | ! [X6] :
                  ( ? [X7] :
                      ( ssItem(X7)
                      & leq(X4,X7)
                      & memberP(X6,X7)
                      & memberP(X5,X7)
                      & ~ leq(X7,X4) )
                  | ~ ssList(X6)
                  | app(app(X5,cons(X4,nil)),X6) != sK2 ) ) )
      & ! [X8] :
          ( ! [X9] :
              ( ~ ssList(X9)
              | ! [X10] :
                  ( ~ ssList(X10)
                  | ! [X11] :
                      ( ( ( ~ memberP(X9,X11)
                          | leq(X11,X8) )
                        & ( leq(X8,X11)
                          | ~ memberP(X10,X11) ) )
                      | ~ ssItem(X11) )
                  | app(app(X9,cons(X8,nil)),X10) != sK4 ) )
          | ~ ssItem(X8) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f378,plain,
    ( ~ ssList(sK4)
    | memberP(nil,sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_1
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f377,f201]) ).

fof(f201,plain,
    nil != sK4,
    inference(definition_unfolding,[],[f186,f184]) ).

fof(f184,plain,
    sK2 = sK4,
    inference(cnf_transformation,[],[f139]) ).

fof(f186,plain,
    nil != sK2,
    inference(cnf_transformation,[],[f139]) ).

fof(f377,plain,
    ( memberP(nil,sK6(sK1(sK4),nil,sK0(sK4)))
    | nil = sK4
    | ~ ssList(sK4)
    | ~ spl11_1
    | ~ spl11_4 ),
    inference(subsumption_resolution,[],[f376,f364]) ).

fof(f364,plain,
    ( ssList(cons(sK1(sK4),nil))
    | ~ spl11_4 ),
    inference(avatar_component_clause,[],[f363]) ).

fof(f363,plain,
    ( spl11_4
  <=> ssList(cons(sK1(sK4),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).

fof(f376,plain,
    ( ~ ssList(cons(sK1(sK4),nil))
    | ~ ssList(sK4)
    | nil = sK4
    | memberP(nil,sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_1 ),
    inference(equality_resolution,[],[f348]) ).

fof(f348,plain,
    ( ! [X0] :
        ( sK4 != X0
        | ~ ssList(cons(sK1(X0),nil))
        | memberP(nil,sK6(sK1(X0),nil,sK0(X0)))
        | nil = X0
        | ~ ssList(X0) )
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f347,f166]) ).

fof(f166,plain,
    ! [X0] :
      ( ssItem(sK1(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f131]) ).

fof(f131,plain,
    ! [X0] :
      ( ( ssList(sK0(X0))
        & cons(sK1(X0),sK0(X0)) = X0
        & ssItem(sK1(X0)) )
      | nil = X0
      | ~ ssList(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f109,f130,f129]) ).

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

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

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

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

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

fof(f347,plain,
    ( ! [X0] :
        ( ~ ssList(cons(sK1(X0),nil))
        | ~ ssItem(sK1(X0))
        | ~ ssList(X0)
        | sK4 != X0
        | nil = X0
        | memberP(nil,sK6(sK1(X0),nil,sK0(X0))) )
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f346,f168]) ).

fof(f168,plain,
    ! [X0] :
      ( ssList(sK0(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f131]) ).

fof(f346,plain,
    ( ! [X0] :
        ( memberP(nil,sK6(sK1(X0),nil,sK0(X0)))
        | ~ ssList(sK0(X0))
        | nil = X0
        | sK4 != X0
        | ~ ssItem(sK1(X0))
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssList(X0) )
    | ~ spl11_1 ),
    inference(superposition,[],[f328,f167]) ).

fof(f167,plain,
    ! [X0] :
      ( cons(sK1(X0),sK0(X0)) = X0
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f131]) ).

fof(f328,plain,
    ( ! [X10,X9] :
        ( cons(X9,X10) != sK4
        | ~ ssList(X10)
        | memberP(nil,sK6(X9,nil,X10))
        | ~ ssItem(X9)
        | ~ ssList(cons(X9,nil)) )
    | ~ spl11_1 ),
    inference(duplicate_literal_removal,[],[f307]) ).

fof(f307,plain,
    ( ! [X10,X9] :
        ( ~ ssItem(X9)
        | memberP(nil,sK6(X9,nil,X10))
        | ~ ssList(cons(X9,nil))
        | ~ ssItem(X9)
        | ~ ssList(X10)
        | cons(X9,X10) != sK4
        | ~ ssList(X10) )
    | ~ spl11_1 ),
    inference(superposition,[],[f263,f152]) ).

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

fof(f116,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( cons(X1,X0) = app(cons(X1,nil),X0)
          | ~ ssItem(X1) ) ),
    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(f263,plain,
    ( ! [X12,X13] :
        ( app(cons(X12,nil),X13) != sK4
        | ~ ssList(cons(X12,nil))
        | ~ ssItem(X12)
        | ~ ssList(X13)
        | memberP(nil,sK6(X12,nil,X13)) )
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f243,f217]) ).

fof(f217,plain,
    ( ssList(nil)
    | ~ spl11_1 ),
    inference(avatar_component_clause,[],[f216]) ).

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

fof(f243,plain,
    ! [X12,X13] :
      ( memberP(nil,sK6(X12,nil,X13))
      | ~ ssItem(X12)
      | ~ ssList(nil)
      | ~ ssList(cons(X12,nil))
      | ~ ssList(X13)
      | app(cons(X12,nil),X13) != sK4 ),
    inference(superposition,[],[f205,f172]) ).

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

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

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

fof(f205,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK4
      | ~ ssItem(X4)
      | ~ ssList(X6)
      | memberP(X5,sK6(X4,X5,X6))
      | ~ ssList(X5) ),
    inference(definition_unfolding,[],[f180,f184]) ).

fof(f180,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | memberP(X5,sK6(X4,X5,X6))
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK2 ),
    inference(cnf_transformation,[],[f139]) ).

fof(f372,plain,
    ( ~ spl11_1
    | spl11_4 ),
    inference(avatar_contradiction_clause,[],[f371]) ).

fof(f371,plain,
    ( $false
    | ~ spl11_1
    | spl11_4 ),
    inference(subsumption_resolution,[],[f370,f176]) ).

fof(f370,plain,
    ( ~ ssList(sK4)
    | ~ spl11_1
    | spl11_4 ),
    inference(subsumption_resolution,[],[f369,f201]) ).

fof(f369,plain,
    ( nil = sK4
    | ~ ssList(sK4)
    | ~ spl11_1
    | spl11_4 ),
    inference(resolution,[],[f368,f166]) ).

fof(f368,plain,
    ( ~ ssItem(sK1(sK4))
    | ~ spl11_1
    | spl11_4 ),
    inference(subsumption_resolution,[],[f367,f217]) ).

fof(f367,plain,
    ( ~ ssList(nil)
    | ~ ssItem(sK1(sK4))
    | spl11_4 ),
    inference(resolution,[],[f365,f165]) ).

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

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

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

fof(f365,plain,
    ( ~ ssList(cons(sK1(sK4),nil))
    | spl11_4 ),
    inference(avatar_component_clause,[],[f363]) ).

fof(f366,plain,
    ( spl11_3
    | ~ spl11_4
    | ~ spl11_1 ),
    inference(avatar_split_clause,[],[f357,f216,f363,f359]) ).

fof(f357,plain,
    ( ~ ssList(cons(sK1(sK4),nil))
    | ssItem(sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f356,f201]) ).

fof(f356,plain,
    ( ssItem(sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ ssList(cons(sK1(sK4),nil))
    | nil = sK4
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f355,f176]) ).

fof(f355,plain,
    ( ~ ssList(sK4)
    | nil = sK4
    | ~ ssList(cons(sK1(sK4),nil))
    | ssItem(sK6(sK1(sK4),nil,sK0(sK4)))
    | ~ spl11_1 ),
    inference(equality_resolution,[],[f342]) ).

fof(f342,plain,
    ( ! [X0] :
        ( sK4 != X0
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssList(X0)
        | ssItem(sK6(sK1(X0),nil,sK0(X0)))
        | nil = X0 )
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f341,f166]) ).

fof(f341,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | ssItem(sK6(sK1(X0),nil,sK0(X0)))
        | nil = X0
        | ~ ssList(cons(sK1(X0),nil))
        | ~ ssItem(sK1(X0))
        | sK4 != X0 )
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f340,f168]) ).

fof(f340,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | ~ ssList(sK0(X0))
        | ~ ssList(cons(sK1(X0),nil))
        | sK4 != X0
        | nil = X0
        | ssItem(sK6(sK1(X0),nil,sK0(X0)))
        | ~ ssItem(sK1(X0)) )
    | ~ spl11_1 ),
    inference(superposition,[],[f329,f167]) ).

fof(f329,plain,
    ( ! [X11,X12] :
        ( cons(X11,X12) != sK4
        | ~ ssItem(X11)
        | ~ ssList(X12)
        | ~ ssList(cons(X11,nil))
        | ssItem(sK6(X11,nil,X12)) )
    | ~ spl11_1 ),
    inference(duplicate_literal_removal,[],[f308]) ).

fof(f308,plain,
    ( ! [X11,X12] :
        ( ~ ssList(X12)
        | cons(X11,X12) != sK4
        | ~ ssList(cons(X11,nil))
        | ~ ssItem(X11)
        | ~ ssItem(X11)
        | ~ ssList(X12)
        | ssItem(sK6(X11,nil,X12)) )
    | ~ spl11_1 ),
    inference(superposition,[],[f267,f152]) ).

fof(f267,plain,
    ( ! [X6,X7] :
        ( app(cons(X6,nil),X7) != sK4
        | ssItem(sK6(X6,nil,X7))
        | ~ ssItem(X6)
        | ~ ssList(cons(X6,nil))
        | ~ ssList(X7) )
    | ~ spl11_1 ),
    inference(subsumption_resolution,[],[f240,f217]) ).

fof(f240,plain,
    ! [X6,X7] :
      ( ~ ssList(cons(X6,nil))
      | ~ ssList(X7)
      | app(cons(X6,nil),X7) != sK4
      | ~ ssItem(X6)
      | ssItem(sK6(X6,nil,X7))
      | ~ ssList(nil) ),
    inference(superposition,[],[f202,f172]) ).

fof(f202,plain,
    ! [X6,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK4
      | ssItem(sK6(X4,X5,X6))
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssItem(X4) ),
    inference(definition_unfolding,[],[f183,f184]) ).

fof(f183,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | ssItem(sK6(X4,X5,X6))
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK2 ),
    inference(cnf_transformation,[],[f139]) ).

fof(f224,plain,
    spl11_1,
    inference(avatar_split_clause,[],[f159,f216]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : SWC223+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 18:58:46 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.49  % (25186)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.49  % (25206)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.50  % (25186)Instruction limit reached!
% 0.18/0.50  % (25186)------------------------------
% 0.18/0.50  % (25186)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (25198)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.50  % (25190)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.18/0.50  % (25189)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.50  % (25193)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.18/0.51  % (25195)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.18/0.51  % (25192)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.18/0.51  % (25203)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.51  % (25203)Instruction limit reached!
% 0.18/0.51  % (25203)------------------------------
% 0.18/0.51  % (25203)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (25203)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (25203)Termination reason: Unknown
% 0.18/0.51  % (25203)Termination phase: Preprocessing 3
% 0.18/0.51  
% 0.18/0.51  % (25203)Memory used [KB]: 1535
% 0.18/0.51  % (25203)Time elapsed: 0.004 s
% 0.18/0.51  % (25203)Instructions burned: 2 (million)
% 0.18/0.51  % (25203)------------------------------
% 0.18/0.51  % (25203)------------------------------
% 0.18/0.51  % (25207)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.18/0.51  % (25195)Refutation not found, incomplete strategy% (25195)------------------------------
% 0.18/0.51  % (25195)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (25195)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (25195)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.51  
% 0.18/0.51  % (25195)Memory used [KB]: 6140
% 0.18/0.51  % (25195)Time elapsed: 0.118 s
% 0.18/0.51  % (25195)Instructions burned: 7 (million)
% 0.18/0.51  % (25195)------------------------------
% 0.18/0.51  % (25195)------------------------------
% 0.18/0.52  % (25211)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.52  % (25186)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (25186)Termination reason: Unknown
% 0.18/0.52  % (25186)Termination phase: Saturation
% 0.18/0.52  
% 0.18/0.52  % (25186)Memory used [KB]: 6396
% 0.18/0.52  % (25186)Time elapsed: 0.009 s
% 0.18/0.52  % (25186)Instructions burned: 13 (million)
% 0.18/0.52  % (25186)------------------------------
% 0.18/0.52  % (25186)------------------------------
% 0.18/0.52  % (25185)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.18/0.52  % (25213)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.18/0.52  % (25212)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.18/0.52  % (25194)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.18/0.52  % (25214)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.18/0.52  % (25187)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.52  % (25187)Instruction limit reached!
% 0.18/0.52  % (25187)------------------------------
% 0.18/0.52  % (25187)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (25187)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (25187)Termination reason: Unknown
% 0.18/0.52  % (25187)Termination phase: Naming
% 0.18/0.52  
% 0.18/0.52  % (25187)Memory used [KB]: 1535
% 0.18/0.52  % (25187)Time elapsed: 0.002 s
% 0.18/0.52  % (25187)Instructions burned: 3 (million)
% 0.18/0.52  % (25187)------------------------------
% 0.18/0.52  % (25187)------------------------------
% 0.18/0.52  % (25213)Instruction limit reached!
% 0.18/0.52  % (25213)------------------------------
% 0.18/0.52  % (25213)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52  % (25213)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52  % (25213)Termination reason: Unknown
% 0.18/0.52  % (25213)Termination phase: Function definition elimination
% 0.18/0.52  
% 0.18/0.52  % (25213)Memory used [KB]: 1791
% 0.18/0.52  % (25213)Time elapsed: 0.004 s
% 0.18/0.52  % (25213)Instructions burned: 8 (million)
% 0.18/0.52  % (25213)------------------------------
% 0.18/0.52  % (25213)------------------------------
% 0.18/0.53  % (25191)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.18/0.53  % (25188)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.53  % (25209)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.53  % (25190)Instruction limit reached!
% 0.18/0.53  % (25190)------------------------------
% 0.18/0.53  % (25190)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (25190)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (25190)Termination reason: Unknown
% 0.18/0.53  % (25190)Termination phase: Saturation
% 0.18/0.53  
% 0.18/0.53  % (25190)Memory used [KB]: 1663
% 0.18/0.53  % (25190)Time elapsed: 0.138 s
% 0.18/0.53  % (25190)Instructions burned: 15 (million)
% 0.18/0.53  % (25190)------------------------------
% 0.18/0.53  % (25190)------------------------------
% 0.18/0.53  % (25189)Instruction limit reached!
% 0.18/0.53  % (25189)------------------------------
% 0.18/0.53  % (25189)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (25189)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (25189)Termination reason: Unknown
% 0.18/0.53  % (25189)Termination phase: Saturation
% 0.18/0.53  
% 0.18/0.53  % (25189)Memory used [KB]: 6268
% 0.18/0.53  % (25189)Time elapsed: 0.138 s
% 0.18/0.53  % (25189)Instructions burned: 14 (million)
% 0.18/0.53  % (25189)------------------------------
% 0.18/0.53  % (25189)------------------------------
% 0.18/0.53  % (25199)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.53  % (25205)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.18/0.53  % (25210)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.18/0.53  % (25199)Instruction limit reached!
% 0.18/0.53  % (25199)------------------------------
% 0.18/0.53  % (25199)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53  % (25199)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53  % (25199)Termination reason: Unknown
% 0.18/0.53  % (25199)Termination phase: Preprocessing 3
% 0.18/0.53  
% 0.18/0.53  % (25199)Memory used [KB]: 1663
% 0.18/0.53  % (25199)Time elapsed: 0.003 s
% 0.18/0.53  % (25199)Instructions burned: 4 (million)
% 0.18/0.53  % (25199)------------------------------
% 0.18/0.53  % (25199)------------------------------
% 0.18/0.53  % (25204)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.18/0.54  % (25208)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.18/0.54  % (25197)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.18/0.54  % (25196)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.54  % (25202)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.54  % (25202)Instruction limit reached!
% 0.18/0.54  % (25202)------------------------------
% 0.18/0.54  % (25202)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54  % (25202)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54  % (25202)Termination reason: Unknown
% 0.18/0.54  % (25202)Termination phase: Preprocessing 3
% 0.18/0.54  
% 0.18/0.54  % (25202)Memory used [KB]: 1663
% 0.18/0.54  % (25202)Time elapsed: 0.003 s
% 0.18/0.54  % (25202)Instructions burned: 5 (million)
% 0.18/0.54  % (25202)------------------------------
% 0.18/0.54  % (25202)------------------------------
% 0.18/0.54  % (25196)Instruction limit reached!
% 0.18/0.54  % (25196)------------------------------
% 0.18/0.54  % (25196)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54  % (25196)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54  % (25196)Termination reason: Unknown
% 0.18/0.54  % (25196)Termination phase: Saturation
% 0.18/0.54  
% 0.18/0.54  % (25196)Memory used [KB]: 6140
% 0.18/0.54  % (25196)Time elapsed: 0.149 s
% 0.18/0.54  % (25196)Instructions burned: 8 (million)
% 0.18/0.54  % (25196)------------------------------
% 0.18/0.54  % (25196)------------------------------
% 0.18/0.54  % (25200)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.54  % (25191)First to succeed.
% 0.18/0.54  % (25200)Instruction limit reached!
% 0.18/0.54  % (25200)------------------------------
% 0.18/0.54  % (25200)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54  % (25200)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54  % (25200)Termination reason: Unknown
% 0.18/0.54  % (25200)Termination phase: shuffling
% 0.18/0.54  
% 0.18/0.54  % (25200)Memory used [KB]: 1791
% 0.18/0.54  % (25200)Time elapsed: 0.005 s
% 0.18/0.54  % (25200)Instructions burned: 9 (million)
% 0.18/0.54  % (25200)------------------------------
% 0.18/0.54  % (25200)------------------------------
% 1.59/0.55  % (25201)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.59/0.55  % (25204)Instruction limit reached!
% 1.59/0.55  % (25204)------------------------------
% 1.59/0.55  % (25204)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.55  % (25204)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.55  % (25204)Termination reason: Unknown
% 1.59/0.55  % (25204)Termination phase: Saturation
% 1.59/0.55  
% 1.59/0.55  % (25204)Memory used [KB]: 6268
% 1.59/0.55  % (25204)Time elapsed: 0.149 s
% 1.59/0.55  % (25204)Instructions burned: 11 (million)
% 1.59/0.55  % (25204)------------------------------
% 1.59/0.55  % (25204)------------------------------
% 1.59/0.56  % (25197)Instruction limit reached!
% 1.59/0.56  % (25197)------------------------------
% 1.59/0.56  % (25197)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.59/0.56  % (25197)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.59/0.56  % (25197)Termination reason: Unknown
% 1.59/0.56  % (25197)Termination phase: Saturation
% 1.59/0.56  
% 1.59/0.56  % (25197)Memory used [KB]: 2046
% 1.59/0.56  % (25197)Time elapsed: 0.160 s
% 1.59/0.56  % (25197)Instructions burned: 16 (million)
% 1.59/0.56  % (25197)------------------------------
% 1.59/0.56  % (25197)------------------------------
% 1.71/0.57  % (25191)Refutation found. Thanks to Tanya!
% 1.71/0.57  % SZS status Theorem for theBenchmark
% 1.71/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 1.71/0.57  % (25191)------------------------------
% 1.71/0.57  % (25191)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.71/0.57  % (25191)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.71/0.57  % (25191)Termination reason: Refutation
% 1.71/0.57  
% 1.71/0.57  % (25191)Memory used [KB]: 6268
% 1.71/0.57  % (25191)Time elapsed: 0.108 s
% 1.71/0.57  % (25191)Instructions burned: 14 (million)
% 1.71/0.57  % (25191)------------------------------
% 1.71/0.57  % (25191)------------------------------
% 1.71/0.57  % (25184)Success in time 0.221 s
%------------------------------------------------------------------------------