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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWC421+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 : n025.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:41:06 EDT 2022

% Result   : Theorem 1.44s 0.59s
% Output   : Refutation 1.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   26
% Syntax   : Number of formulae    :  131 (   9 unt;   0 def)
%            Number of atoms       :  805 ( 255 equ)
%            Maximal formula atoms :   54 (   6 avg)
%            Number of connectives : 1152 ( 478   ~; 472   |; 157   &)
%                                         (  13 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   31 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   16 (  14 usr;  12 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :  218 ( 169   !;  49   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f529,plain,
    $false,
    inference(avatar_sat_refutation,[],[f254,f255,f278,f279,f314,f317,f338,f343,f379,f383,f407,f528]) ).

fof(f528,plain,
    ( ~ spl10_3
    | ~ spl10_7
    | spl10_9
    | spl10_13 ),
    inference(avatar_contradiction_clause,[],[f527]) ).

fof(f527,plain,
    ( $false
    | ~ spl10_3
    | ~ spl10_7
    | spl10_9
    | spl10_13 ),
    inference(subsumption_resolution,[],[f526,f262]) ).

fof(f262,plain,
    ( nil != sK6
    | spl10_9 ),
    inference(avatar_component_clause,[],[f261]) ).

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

fof(f526,plain,
    ( nil = sK6
    | ~ spl10_3
    | ~ spl10_7
    | spl10_13 ),
    inference(subsumption_resolution,[],[f525,f187]) ).

fof(f187,plain,
    ssList(sK6),
    inference(cnf_transformation,[],[f157]) ).

fof(f157,plain,
    ( ssList(sK7)
    & ssList(sK8)
    & neq(sK7,nil)
    & ssList(sK9)
    & ! [X4] :
        ( ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( app(app(X5,cons(X4,nil)),X6) != sK7
                | app(app(X6,cons(X4,nil)),X5) != sK6
                | ~ ssList(X6) ) )
        | ~ ssItem(X4) )
    & sK9 = sK7
    & ( nil = sK8
      | nil != sK9 )
    & sK8 = sK6
    & ( ( neq(sK8,nil)
        & ! [X7] :
            ( ~ ssList(X7)
            | ! [X8] :
                ( ~ ssList(X8)
                | ! [X9] :
                    ( app(X8,X9) != X7
                    | tl(sK8) != X8
                    | ! [X10] :
                        ( ~ ssItem(X10)
                        | cons(X10,nil) != X9
                        | ~ neq(nil,sK8)
                        | hd(sK8) != X10 )
                    | ~ ssList(X9)
                    | ~ neq(nil,sK8) ) )
            | sK9 = X7 ) )
      | ~ neq(sK9,nil) )
    & ssList(sK6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f152,f156,f155,f154,f153]) ).

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

fof(f154,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( neq(X1,nil)
                & ssList(X3)
                & ! [X4] :
                    ( ! [X5] :
                        ( ~ ssList(X5)
                        | ! [X6] :
                            ( app(app(X5,cons(X4,nil)),X6) != X1
                            | app(app(X6,cons(X4,nil)),X5) != sK6
                            | ~ ssList(X6) ) )
                    | ~ ssItem(X4) )
                & X1 = X3
                & ( nil = X2
                  | nil != X3 )
                & sK6 = X2
                & ( ( neq(X2,nil)
                    & ! [X7] :
                        ( ~ ssList(X7)
                        | ! [X8] :
                            ( ~ ssList(X8)
                            | ! [X9] :
                                ( app(X8,X9) != X7
                                | tl(X2) != X8
                                | ! [X10] :
                                    ( ~ ssItem(X10)
                                    | cons(X10,nil) != X9
                                    | ~ neq(nil,X2)
                                    | hd(X2) != X10 )
                                | ~ ssList(X9)
                                | ~ neq(nil,X2) ) )
                        | X3 = X7 ) )
                  | ~ neq(X3,nil) ) ) ) )
   => ( ssList(sK7)
      & ? [X2] :
          ( ssList(X2)
          & ? [X3] :
              ( neq(sK7,nil)
              & ssList(X3)
              & ! [X4] :
                  ( ! [X5] :
                      ( ~ ssList(X5)
                      | ! [X6] :
                          ( app(app(X5,cons(X4,nil)),X6) != sK7
                          | app(app(X6,cons(X4,nil)),X5) != sK6
                          | ~ ssList(X6) ) )
                  | ~ ssItem(X4) )
              & sK7 = X3
              & ( nil = X2
                | nil != X3 )
              & sK6 = X2
              & ( ( neq(X2,nil)
                  & ! [X7] :
                      ( ~ ssList(X7)
                      | ! [X8] :
                          ( ~ ssList(X8)
                          | ! [X9] :
                              ( app(X8,X9) != X7
                              | tl(X2) != X8
                              | ! [X10] :
                                  ( ~ ssItem(X10)
                                  | cons(X10,nil) != X9
                                  | ~ neq(nil,X2)
                                  | hd(X2) != X10 )
                              | ~ ssList(X9)
                              | ~ neq(nil,X2) ) )
                      | X3 = X7 ) )
                | ~ neq(X3,nil) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f155,plain,
    ( ? [X2] :
        ( ssList(X2)
        & ? [X3] :
            ( neq(sK7,nil)
            & ssList(X3)
            & ! [X4] :
                ( ! [X5] :
                    ( ~ ssList(X5)
                    | ! [X6] :
                        ( app(app(X5,cons(X4,nil)),X6) != sK7
                        | app(app(X6,cons(X4,nil)),X5) != sK6
                        | ~ ssList(X6) ) )
                | ~ ssItem(X4) )
            & sK7 = X3
            & ( nil = X2
              | nil != X3 )
            & sK6 = X2
            & ( ( neq(X2,nil)
                & ! [X7] :
                    ( ~ ssList(X7)
                    | ! [X8] :
                        ( ~ ssList(X8)
                        | ! [X9] :
                            ( app(X8,X9) != X7
                            | tl(X2) != X8
                            | ! [X10] :
                                ( ~ ssItem(X10)
                                | cons(X10,nil) != X9
                                | ~ neq(nil,X2)
                                | hd(X2) != X10 )
                            | ~ ssList(X9)
                            | ~ neq(nil,X2) ) )
                    | X3 = X7 ) )
              | ~ neq(X3,nil) ) ) )
   => ( ssList(sK8)
      & ? [X3] :
          ( neq(sK7,nil)
          & ssList(X3)
          & ! [X4] :
              ( ! [X5] :
                  ( ~ ssList(X5)
                  | ! [X6] :
                      ( app(app(X5,cons(X4,nil)),X6) != sK7
                      | app(app(X6,cons(X4,nil)),X5) != sK6
                      | ~ ssList(X6) ) )
              | ~ ssItem(X4) )
          & sK7 = X3
          & ( nil = sK8
            | nil != X3 )
          & sK8 = sK6
          & ( ( neq(sK8,nil)
              & ! [X7] :
                  ( ~ ssList(X7)
                  | ! [X8] :
                      ( ~ ssList(X8)
                      | ! [X9] :
                          ( app(X8,X9) != X7
                          | tl(sK8) != X8
                          | ! [X10] :
                              ( ~ ssItem(X10)
                              | cons(X10,nil) != X9
                              | ~ neq(nil,sK8)
                              | hd(sK8) != X10 )
                          | ~ ssList(X9)
                          | ~ neq(nil,sK8) ) )
                  | X3 = X7 ) )
            | ~ neq(X3,nil) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f156,plain,
    ( ? [X3] :
        ( neq(sK7,nil)
        & ssList(X3)
        & ! [X4] :
            ( ! [X5] :
                ( ~ ssList(X5)
                | ! [X6] :
                    ( app(app(X5,cons(X4,nil)),X6) != sK7
                    | app(app(X6,cons(X4,nil)),X5) != sK6
                    | ~ ssList(X6) ) )
            | ~ ssItem(X4) )
        & sK7 = X3
        & ( nil = sK8
          | nil != X3 )
        & sK8 = sK6
        & ( ( neq(sK8,nil)
            & ! [X7] :
                ( ~ ssList(X7)
                | ! [X8] :
                    ( ~ ssList(X8)
                    | ! [X9] :
                        ( app(X8,X9) != X7
                        | tl(sK8) != X8
                        | ! [X10] :
                            ( ~ ssItem(X10)
                            | cons(X10,nil) != X9
                            | ~ neq(nil,sK8)
                            | hd(sK8) != X10 )
                        | ~ ssList(X9)
                        | ~ neq(nil,sK8) ) )
                | X3 = X7 ) )
          | ~ neq(X3,nil) ) )
   => ( neq(sK7,nil)
      & ssList(sK9)
      & ! [X4] :
          ( ! [X5] :
              ( ~ ssList(X5)
              | ! [X6] :
                  ( app(app(X5,cons(X4,nil)),X6) != sK7
                  | app(app(X6,cons(X4,nil)),X5) != sK6
                  | ~ ssList(X6) ) )
          | ~ ssItem(X4) )
      & sK9 = sK7
      & ( nil = sK8
        | nil != sK9 )
      & sK8 = sK6
      & ( ( neq(sK8,nil)
          & ! [X7] :
              ( ~ ssList(X7)
              | ! [X8] :
                  ( ~ ssList(X8)
                  | ! [X9] :
                      ( app(X8,X9) != X7
                      | tl(sK8) != X8
                      | ! [X10] :
                          ( ~ ssItem(X10)
                          | cons(X10,nil) != X9
                          | ~ neq(nil,sK8)
                          | hd(sK8) != X10 )
                      | ~ ssList(X9)
                      | ~ neq(nil,sK8) ) )
              | sK9 = X7 ) )
        | ~ neq(sK9,nil) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f152,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ssList(X2)
              & ? [X3] :
                  ( neq(X1,nil)
                  & ssList(X3)
                  & ! [X4] :
                      ( ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( app(app(X5,cons(X4,nil)),X6) != X1
                              | app(app(X6,cons(X4,nil)),X5) != X0
                              | ~ ssList(X6) ) )
                      | ~ ssItem(X4) )
                  & X1 = X3
                  & ( nil = X2
                    | nil != X3 )
                  & X0 = X2
                  & ( ( neq(X2,nil)
                      & ! [X7] :
                          ( ~ ssList(X7)
                          | ! [X8] :
                              ( ~ ssList(X8)
                              | ! [X9] :
                                  ( app(X8,X9) != X7
                                  | tl(X2) != X8
                                  | ! [X10] :
                                      ( ~ ssItem(X10)
                                      | cons(X10,nil) != X9
                                      | ~ neq(nil,X2)
                                      | hd(X2) != X10 )
                                  | ~ ssList(X9)
                                  | ~ neq(nil,X2) ) )
                          | X3 = X7 ) )
                    | ~ neq(X3,nil) ) ) ) )
      & ssList(X0) ),
    inference(rectify,[],[f116]) ).

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

fof(f115,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( neq(X2,nil)
                      & ! [X4] :
                          ( ~ ssList(X4)
                          | ! [X5] :
                              ( ~ ssList(X5)
                              | ! [X6] :
                                  ( app(X5,X6) != X4
                                  | tl(X2) != X5
                                  | ! [X7] :
                                      ( ~ ssItem(X7)
                                      | cons(X7,nil) != X6
                                      | ~ neq(nil,X2)
                                      | hd(X2) != X7 )
                                  | ~ ssList(X6)
                                  | ~ neq(nil,X2) ) )
                          | X3 = X4 ) )
                    | ~ neq(X3,nil) )
                  & ! [X8] :
                      ( ! [X9] :
                          ( ~ ssList(X9)
                          | ! [X10] :
                              ( app(app(X9,cons(X8,nil)),X10) != X1
                              | app(app(X10,cons(X8,nil)),X9) != X0
                              | ~ ssList(X10) ) )
                      | ~ ssItem(X8) )
                  & neq(X1,nil)
                  & ( nil = X2
                    | nil != X3 )
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f98]) ).

fof(f98,plain,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( neq(X3,nil)
                        & ( ? [X4] :
                              ( ssList(X4)
                              & ? [X5] :
                                  ( ssList(X5)
                                  & ? [X6] :
                                      ( app(X5,X6) = X4
                                      & ssList(X6)
                                      & neq(nil,X2)
                                      & tl(X2) = X5
                                      & ? [X7] :
                                          ( cons(X7,nil) = X6
                                          & ssItem(X7)
                                          & neq(nil,X2)
                                          & hd(X2) = X7 ) ) )
                              & X3 != X4 )
                          | ~ neq(X2,nil) ) )
                      | ? [X8] :
                          ( ? [X9] :
                              ( ? [X10] :
                                  ( ssList(X10)
                                  & app(app(X10,cons(X8,nil)),X9) = X0
                                  & app(app(X9,cons(X8,nil)),X10) = X1 )
                              & ssList(X9) )
                          & ssItem(X8) )
                      | ~ neq(X1,nil)
                      | ( nil != X2
                        & nil = X3 )
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(rectify,[],[f97]) ).

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

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

fof(f525,plain,
    ( ~ ssList(sK6)
    | nil = sK6
    | ~ spl10_3
    | ~ spl10_7
    | spl10_13 ),
    inference(trivial_inequality_removal,[],[f524]) ).

fof(f524,plain,
    ( sK6 != sK6
    | ~ ssList(sK6)
    | nil = sK6
    | ~ spl10_3
    | ~ spl10_7
    | spl10_13 ),
    inference(superposition,[],[f519,f184]) ).

fof(f184,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f105]) ).

fof(f105,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(hd(X0),tl(X0)) = X0
      | nil = X0 ),
    inference(flattening,[],[f104]) ).

fof(f104,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).

fof(f519,plain,
    ( cons(hd(sK6),tl(sK6)) != sK6
    | ~ spl10_3
    | ~ spl10_7
    | spl10_13 ),
    inference(subsumption_resolution,[],[f518,f252]) ).

fof(f252,plain,
    ( ssItem(hd(sK6))
    | ~ spl10_7 ),
    inference(avatar_component_clause,[],[f251]) ).

fof(f251,plain,
    ( spl10_7
  <=> ssItem(hd(sK6)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).

fof(f518,plain,
    ( cons(hd(sK6),tl(sK6)) != sK6
    | ~ ssItem(hd(sK6))
    | ~ spl10_3
    | spl10_13 ),
    inference(subsumption_resolution,[],[f500,f236]) ).

fof(f236,plain,
    ( ssList(tl(sK6))
    | ~ spl10_3 ),
    inference(avatar_component_clause,[],[f235]) ).

fof(f235,plain,
    ( spl10_3
  <=> ssList(tl(sK6)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).

fof(f500,plain,
    ( ~ ssList(tl(sK6))
    | cons(hd(sK6),tl(sK6)) != sK6
    | ~ ssItem(hd(sK6))
    | spl10_13 ),
    inference(superposition,[],[f396,f202]) ).

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

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

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

fof(f396,plain,
    ( app(cons(hd(sK6),nil),tl(sK6)) != sK6
    | spl10_13 ),
    inference(avatar_component_clause,[],[f394]) ).

fof(f394,plain,
    ( spl10_13
  <=> app(cons(hd(sK6),nil),tl(sK6)) = sK6 ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_13])]) ).

fof(f407,plain,
    ( ~ spl10_13
    | ~ spl10_1
    | ~ spl10_2
    | ~ spl10_3
    | ~ spl10_7
    | ~ spl10_10 ),
    inference(avatar_split_clause,[],[f406,f266,f251,f235,f231,f227,f394]) ).

fof(f227,plain,
    ( spl10_1
  <=> sK7 = app(tl(sK6),cons(hd(sK6),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).

fof(f231,plain,
    ( spl10_2
  <=> ssList(cons(hd(sK6),nil)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).

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

fof(f406,plain,
    ( app(cons(hd(sK6),nil),tl(sK6)) != sK6
    | ~ spl10_1
    | ~ spl10_2
    | ~ spl10_3
    | ~ spl10_7
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f405,f252]) ).

fof(f405,plain,
    ( ~ ssItem(hd(sK6))
    | app(cons(hd(sK6),nil),tl(sK6)) != sK6
    | ~ spl10_1
    | ~ spl10_2
    | ~ spl10_3
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f404,f232]) ).

fof(f232,plain,
    ( ssList(cons(hd(sK6),nil))
    | ~ spl10_2 ),
    inference(avatar_component_clause,[],[f231]) ).

fof(f404,plain,
    ( app(cons(hd(sK6),nil),tl(sK6)) != sK6
    | ~ ssList(cons(hd(sK6),nil))
    | ~ ssItem(hd(sK6))
    | ~ spl10_1
    | ~ spl10_3
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f389,f236]) ).

fof(f389,plain,
    ( ~ ssList(tl(sK6))
    | ~ ssItem(hd(sK6))
    | ~ ssList(cons(hd(sK6),nil))
    | app(cons(hd(sK6),nil),tl(sK6)) != sK6
    | ~ spl10_1
    | ~ spl10_10 ),
    inference(trivial_inequality_removal,[],[f387]) ).

fof(f387,plain,
    ( sK7 != sK7
    | ~ ssList(tl(sK6))
    | app(cons(hd(sK6),nil),tl(sK6)) != sK6
    | ~ ssItem(hd(sK6))
    | ~ ssList(cons(hd(sK6),nil))
    | ~ spl10_1
    | ~ spl10_10 ),
    inference(superposition,[],[f339,f229]) ).

fof(f229,plain,
    ( sK7 = app(tl(sK6),cons(hd(sK6),nil))
    | ~ spl10_1 ),
    inference(avatar_component_clause,[],[f227]) ).

fof(f339,plain,
    ( ! [X2,X1] :
        ( sK7 != app(X1,cons(X2,nil))
        | ~ ssList(X1)
        | ~ ssItem(X2)
        | ~ ssList(cons(X2,nil))
        | sK6 != app(cons(X2,nil),X1) )
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f286,f161]) ).

fof(f161,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f118,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ! [X1] :
          ( ~ ssList(X1)
          | ssList(app(X0,X1)) ) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).

fof(f286,plain,
    ( ! [X2,X1] :
        ( sK7 != app(X1,cons(X2,nil))
        | ~ ssList(cons(X2,nil))
        | sK6 != app(cons(X2,nil),X1)
        | ~ ssItem(X2)
        | ~ ssList(X1)
        | ~ ssList(app(X1,cons(X2,nil))) )
    | ~ spl10_10 ),
    inference(superposition,[],[f281,f208]) ).

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

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

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

fof(f281,plain,
    ( ! [X0,X1] :
        ( sK7 != app(app(X1,cons(X0,nil)),nil)
        | ~ ssItem(X0)
        | app(cons(X0,nil),X1) != sK6
        | ~ ssList(X1)
        | ~ ssList(cons(X0,nil)) )
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f280,f267]) ).

fof(f267,plain,
    ( ssList(nil)
    | ~ spl10_10 ),
    inference(avatar_component_clause,[],[f266]) ).

fof(f280,plain,
    ! [X0,X1] :
      ( app(cons(X0,nil),X1) != sK6
      | ~ ssList(cons(X0,nil))
      | ~ ssList(X1)
      | sK7 != app(app(X1,cons(X0,nil)),nil)
      | ~ ssList(nil)
      | ~ ssItem(X0) ),
    inference(superposition,[],[f193,f204]) ).

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

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

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

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

fof(f383,plain,
    ( ~ spl10_2
    | ~ spl10_3
    | spl10_5 ),
    inference(avatar_contradiction_clause,[],[f382]) ).

fof(f382,plain,
    ( $false
    | ~ spl10_2
    | ~ spl10_3
    | spl10_5 ),
    inference(subsumption_resolution,[],[f381,f232]) ).

fof(f381,plain,
    ( ~ ssList(cons(hd(sK6),nil))
    | ~ spl10_3
    | spl10_5 ),
    inference(subsumption_resolution,[],[f380,f236]) ).

fof(f380,plain,
    ( ~ ssList(tl(sK6))
    | ~ ssList(cons(hd(sK6),nil))
    | spl10_5 ),
    inference(resolution,[],[f245,f161]) ).

fof(f245,plain,
    ( ~ ssList(app(tl(sK6),cons(hd(sK6),nil)))
    | spl10_5 ),
    inference(avatar_component_clause,[],[f243]) ).

fof(f243,plain,
    ( spl10_5
  <=> ssList(app(tl(sK6),cons(hd(sK6),nil))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).

fof(f379,plain,
    ( spl10_4
    | spl10_9
    | ~ spl10_10 ),
    inference(avatar_contradiction_clause,[],[f378]) ).

fof(f378,plain,
    ( $false
    | spl10_4
    | spl10_9
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f377,f267]) ).

fof(f377,plain,
    ( ~ ssList(nil)
    | spl10_4
    | spl10_9 ),
    inference(subsumption_resolution,[],[f376,f262]) ).

fof(f376,plain,
    ( nil = sK6
    | ~ ssList(nil)
    | spl10_4 ),
    inference(subsumption_resolution,[],[f373,f187]) ).

fof(f373,plain,
    ( ~ ssList(sK6)
    | nil = sK6
    | ~ ssList(nil)
    | spl10_4 ),
    inference(resolution,[],[f178,f241]) ).

fof(f241,plain,
    ( ~ neq(nil,sK6)
    | spl10_4 ),
    inference(avatar_component_clause,[],[f239]) ).

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

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

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

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

fof(f343,plain,
    ( spl10_9
    | spl10_3 ),
    inference(avatar_split_clause,[],[f342,f235,f261]) ).

fof(f342,plain,
    ( nil = sK6
    | spl10_3 ),
    inference(subsumption_resolution,[],[f341,f187]) ).

fof(f341,plain,
    ( ~ ssList(sK6)
    | nil = sK6
    | spl10_3 ),
    inference(resolution,[],[f237,f186]) ).

fof(f186,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(cnf_transformation,[],[f108]) ).

fof(f108,plain,
    ! [X0] :
      ( nil = X0
      | ~ ssList(X0)
      | ssList(tl(X0)) ),
    inference(flattening,[],[f107]) ).

fof(f107,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f24,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssList(tl(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).

fof(f237,plain,
    ( ~ ssList(tl(sK6))
    | spl10_3 ),
    inference(avatar_component_clause,[],[f235]) ).

fof(f338,plain,
    ( ~ spl10_9
    | ~ spl10_10
    | ~ spl10_12 ),
    inference(avatar_contradiction_clause,[],[f337]) ).

fof(f337,plain,
    ( $false
    | ~ spl10_9
    | ~ spl10_10
    | ~ spl10_12 ),
    inference(subsumption_resolution,[],[f336,f267]) ).

fof(f336,plain,
    ( ~ ssList(nil)
    | ~ spl10_9
    | ~ spl10_12 ),
    inference(resolution,[],[f322,f222]) ).

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

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

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

fof(f322,plain,
    ( neq(nil,nil)
    | ~ spl10_9
    | ~ spl10_12 ),
    inference(backward_demodulation,[],[f277,f263]) ).

fof(f263,plain,
    ( nil = sK6
    | ~ spl10_9 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f277,plain,
    ( neq(sK6,nil)
    | ~ spl10_12 ),
    inference(avatar_component_clause,[],[f275]) ).

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

fof(f317,plain,
    ( spl10_9
    | spl10_7 ),
    inference(avatar_split_clause,[],[f316,f251,f261]) ).

fof(f316,plain,
    ( nil = sK6
    | spl10_7 ),
    inference(subsumption_resolution,[],[f315,f187]) ).

fof(f315,plain,
    ( ~ ssList(sK6)
    | nil = sK6
    | spl10_7 ),
    inference(resolution,[],[f207,f253]) ).

fof(f253,plain,
    ( ~ ssItem(hd(sK6))
    | spl10_7 ),
    inference(avatar_component_clause,[],[f251]) ).

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

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

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

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

fof(f314,plain,
    ( ~ spl10_7
    | spl10_2
    | ~ spl10_10 ),
    inference(avatar_split_clause,[],[f313,f266,f231,f251]) ).

fof(f313,plain,
    ( ~ ssItem(hd(sK6))
    | spl10_2
    | ~ spl10_10 ),
    inference(subsumption_resolution,[],[f312,f267]) ).

fof(f312,plain,
    ( ~ ssList(nil)
    | ~ ssItem(hd(sK6))
    | spl10_2 ),
    inference(resolution,[],[f203,f233]) ).

fof(f233,plain,
    ( ~ ssList(cons(hd(sK6),nil))
    | spl10_2 ),
    inference(avatar_component_clause,[],[f231]) ).

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

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

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

fof(f279,plain,
    spl10_10,
    inference(avatar_split_clause,[],[f170,f266]) ).

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

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

fof(f278,plain,
    ( spl10_12
    | ~ spl10_6 ),
    inference(avatar_split_clause,[],[f212,f247,f275]) ).

fof(f247,plain,
    ( spl10_6
  <=> neq(sK7,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).

fof(f212,plain,
    ( ~ neq(sK7,nil)
    | neq(sK6,nil) ),
    inference(definition_unfolding,[],[f189,f190,f192]) ).

fof(f192,plain,
    sK9 = sK7,
    inference(cnf_transformation,[],[f157]) ).

fof(f190,plain,
    sK8 = sK6,
    inference(cnf_transformation,[],[f157]) ).

fof(f189,plain,
    ( neq(sK8,nil)
    | ~ neq(sK9,nil) ),
    inference(cnf_transformation,[],[f157]) ).

fof(f255,plain,
    spl10_6,
    inference(avatar_split_clause,[],[f195,f247]) ).

fof(f195,plain,
    neq(sK7,nil),
    inference(cnf_transformation,[],[f157]) ).

fof(f254,plain,
    ( spl10_1
    | ~ spl10_2
    | ~ spl10_3
    | ~ spl10_4
    | ~ spl10_5
    | ~ spl10_6
    | ~ spl10_7 ),
    inference(avatar_split_clause,[],[f225,f251,f247,f243,f239,f235,f231,f227]) ).

fof(f225,plain,
    ( ~ ssItem(hd(sK6))
    | ~ neq(sK7,nil)
    | ~ ssList(app(tl(sK6),cons(hd(sK6),nil)))
    | ~ neq(nil,sK6)
    | ~ ssList(tl(sK6))
    | ~ ssList(cons(hd(sK6),nil))
    | sK7 = app(tl(sK6),cons(hd(sK6),nil)) ),
    inference(duplicate_literal_removal,[],[f220]) ).

fof(f220,plain,
    ( ~ ssList(cons(hd(sK6),nil))
    | ~ neq(nil,sK6)
    | ~ neq(sK7,nil)
    | ~ ssItem(hd(sK6))
    | ~ ssList(app(tl(sK6),cons(hd(sK6),nil)))
    | ~ neq(nil,sK6)
    | sK7 = app(tl(sK6),cons(hd(sK6),nil))
    | ~ ssList(tl(sK6)) ),
    inference(equality_resolution,[],[f219]) ).

fof(f219,plain,
    ! [X10] :
      ( ~ ssList(app(tl(sK6),cons(X10,nil)))
      | ~ ssList(tl(sK6))
      | ~ ssItem(X10)
      | ~ neq(nil,sK6)
      | hd(sK6) != X10
      | ~ ssList(cons(X10,nil))
      | ~ neq(nil,sK6)
      | sK7 = app(tl(sK6),cons(X10,nil))
      | ~ neq(sK7,nil) ),
    inference(equality_resolution,[],[f218]) ).

fof(f218,plain,
    ! [X10,X9] :
      ( ~ ssList(app(tl(sK6),X9))
      | ~ ssList(tl(sK6))
      | ~ ssItem(X10)
      | cons(X10,nil) != X9
      | ~ neq(nil,sK6)
      | hd(sK6) != X10
      | ~ ssList(X9)
      | ~ neq(nil,sK6)
      | sK7 = app(tl(sK6),X9)
      | ~ neq(sK7,nil) ),
    inference(equality_resolution,[],[f217]) ).

fof(f217,plain,
    ! [X10,X8,X9] :
      ( ~ ssList(app(X8,X9))
      | ~ ssList(X8)
      | tl(sK6) != X8
      | ~ ssItem(X10)
      | cons(X10,nil) != X9
      | ~ neq(nil,sK6)
      | hd(sK6) != X10
      | ~ ssList(X9)
      | ~ neq(nil,sK6)
      | app(X8,X9) = sK7
      | ~ neq(sK7,nil) ),
    inference(equality_resolution,[],[f213]) ).

fof(f213,plain,
    ! [X10,X8,X9,X7] :
      ( ~ ssList(X7)
      | ~ ssList(X8)
      | app(X8,X9) != X7
      | tl(sK6) != X8
      | ~ ssItem(X10)
      | cons(X10,nil) != X9
      | ~ neq(nil,sK6)
      | hd(sK6) != X10
      | ~ ssList(X9)
      | ~ neq(nil,sK6)
      | sK7 = X7
      | ~ neq(sK7,nil) ),
    inference(definition_unfolding,[],[f188,f190,f190,f190,f190,f192,f192]) ).

fof(f188,plain,
    ! [X10,X8,X9,X7] :
      ( ~ ssList(X7)
      | ~ ssList(X8)
      | app(X8,X9) != X7
      | tl(sK8) != X8
      | ~ ssItem(X10)
      | cons(X10,nil) != X9
      | ~ neq(nil,sK8)
      | hd(sK8) != X10
      | ~ ssList(X9)
      | ~ neq(nil,sK8)
      | sK9 = X7
      | ~ neq(sK9,nil) ),
    inference(cnf_transformation,[],[f157]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC421+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 : n025.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:04:00 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 1.44/0.55  % (2043)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.44/0.55  % (2044)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)
% 1.44/0.56  % (2060)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)
% 1.44/0.56  % (2052)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.44/0.56  % (2039)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.44/0.56  % (2051)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.44/0.56  % (2051)Instruction limit reached!
% 1.44/0.56  % (2051)------------------------------
% 1.44/0.56  % (2051)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.56  % (2051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.56  % (2051)Termination reason: Unknown
% 1.44/0.56  % (2051)Termination phase: Preprocessing 3
% 1.44/0.56  
% 1.44/0.56  % (2051)Memory used [KB]: 1663
% 1.44/0.56  % (2051)Time elapsed: 0.004 s
% 1.44/0.56  % (2051)Instructions burned: 5 (million)
% 1.44/0.56  % (2051)------------------------------
% 1.44/0.56  % (2051)------------------------------
% 1.44/0.56  % (2039)Instruction limit reached!
% 1.44/0.56  % (2039)------------------------------
% 1.44/0.56  % (2039)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.56  % (2061)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.44/0.56  % (2042)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.44/0.56  % (2039)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.56  % (2039)Termination reason: Unknown
% 1.44/0.56  % (2039)Termination phase: Preprocessing 3
% 1.44/0.56  
% 1.44/0.56  % (2039)Memory used [KB]: 1663
% 1.44/0.56  % (2039)Time elapsed: 0.004 s
% 1.44/0.56  % (2039)Instructions burned: 4 (million)
% 1.44/0.56  % (2039)------------------------------
% 1.44/0.56  % (2039)------------------------------
% 1.44/0.56  % (2040)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.44/0.56  % (2059)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.44/0.56  % (2041)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.44/0.57  % (2037)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.44/0.57  % (2047)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.44/0.57  % (2055)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.44/0.57  % (2053)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.44/0.57  % (2058)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.44/0.57  % (2055)Instruction limit reached!
% 1.44/0.57  % (2055)------------------------------
% 1.44/0.57  % (2055)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.57  % (2055)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.57  % (2055)Termination reason: Unknown
% 1.44/0.57  % (2055)Termination phase: Clausification
% 1.44/0.57  
% 1.44/0.57  % (2055)Memory used [KB]: 1535
% 1.44/0.57  % (2055)Time elapsed: 0.003 s
% 1.44/0.57  % (2055)Instructions burned: 3 (million)
% 1.44/0.57  % (2055)------------------------------
% 1.44/0.57  % (2055)------------------------------
% 1.44/0.57  % (2056)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.44/0.57  % (2046)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)
% 1.44/0.57  % (2047)Refutation not found, incomplete strategy% (2047)------------------------------
% 1.44/0.57  % (2047)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.57  % (2057)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.44/0.57  % (2047)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.57  % (2047)Termination reason: Refutation not found, incomplete strategy
% 1.44/0.57  
% 1.44/0.57  % (2047)Memory used [KB]: 6140
% 1.44/0.57  % (2047)Time elapsed: 0.152 s
% 1.44/0.57  % (2047)Instructions burned: 8 (million)
% 1.44/0.57  % (2047)------------------------------
% 1.44/0.57  % (2047)------------------------------
% 1.44/0.57  % (2045)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.44/0.57  % (2064)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.44/0.58  % (2052)Instruction limit reached!
% 1.44/0.58  % (2052)------------------------------
% 1.44/0.58  % (2052)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.58  % (2052)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.58  % (2052)Termination reason: Unknown
% 1.44/0.58  % (2052)Termination phase: Function definition elimination
% 1.44/0.58  
% 1.44/0.58  % (2052)Memory used [KB]: 1791
% 1.44/0.58  % (2052)Time elapsed: 0.006 s
% 1.44/0.58  % (2052)Instructions burned: 8 (million)
% 1.44/0.58  % (2052)------------------------------
% 1.44/0.58  % (2052)------------------------------
% 1.44/0.58  % (2050)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.44/0.58  % (2063)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.44/0.58  % (2065)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.44/0.58  % (2054)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.44/0.58  % (2054)Instruction limit reached!
% 1.44/0.58  % (2054)------------------------------
% 1.44/0.58  % (2054)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.58  % (2054)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.58  % (2054)Termination reason: Unknown
% 1.44/0.58  % (2054)Termination phase: Preprocessing 3
% 1.44/0.58  
% 1.44/0.58  % (2054)Memory used [KB]: 1663
% 1.44/0.58  % (2054)Time elapsed: 0.003 s
% 1.44/0.58  % (2054)Instructions burned: 4 (million)
% 1.44/0.58  % (2054)------------------------------
% 1.44/0.58  % (2054)------------------------------
% 1.44/0.58  % (2065)Instruction limit reached!
% 1.44/0.58  % (2065)------------------------------
% 1.44/0.58  % (2065)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.58  % (2065)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.58  % (2065)Termination reason: Unknown
% 1.44/0.58  % (2065)Termination phase: Property scanning
% 1.44/0.58  
% 1.44/0.58  % (2065)Memory used [KB]: 1791
% 1.44/0.58  % (2065)Time elapsed: 0.005 s
% 1.44/0.58  % (2065)Instructions burned: 9 (million)
% 1.44/0.58  % (2065)------------------------------
% 1.44/0.58  % (2065)------------------------------
% 1.44/0.58  % (2066)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.44/0.58  % (2062)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)
% 1.44/0.58  % (2048)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.44/0.58  % (2043)First to succeed.
% 1.44/0.59  % (2049)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.44/0.59  % (2043)Refutation found. Thanks to Tanya!
% 1.44/0.59  % SZS status Theorem for theBenchmark
% 1.44/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 1.44/0.59  % (2043)------------------------------
% 1.44/0.59  % (2043)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.59  % (2043)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.59  % (2043)Termination reason: Refutation
% 1.44/0.59  
% 1.44/0.59  % (2043)Memory used [KB]: 6268
% 1.44/0.59  % (2043)Time elapsed: 0.155 s
% 1.44/0.59  % (2043)Instructions burned: 16 (million)
% 1.44/0.59  % (2043)------------------------------
% 1.44/0.59  % (2043)------------------------------
% 1.44/0.59  % (2036)Success in time 0.23 s
%------------------------------------------------------------------------------