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

View Problem - Process Solution

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

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:43:11 EDT 2022

% Result   : Theorem 1.73s 0.61s
% Output   : Refutation 1.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   77 (   7 unt;   0 def)
%            Number of atoms       :  567 ( 223 equ)
%            Maximal formula atoms :   38 (   7 avg)
%            Number of connectives :  750 ( 260   ~; 238   |; 217   &)
%                                         (   3 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :  202 ( 121   !;  81   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1022,plain,
    $false,
    inference(avatar_sat_refutation,[],[f642,f647,f652,f962]) ).

fof(f962,plain,
    ~ spl62_6,
    inference(avatar_contradiction_clause,[],[f961]) ).

fof(f961,plain,
    ( $false
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f955,f712]) ).

fof(f712,plain,
    ( ssList(sK32(sK35,sK37))
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f711,f453]) ).

fof(f453,plain,
    equalelemsP(sK35),
    inference(cnf_transformation,[],[f303]) ).

fof(f303,plain,
    ( ssList(sK33)
    & ssList(sK34)
    & ( ( nil != sK34
        & nil = sK33 )
      | sP2(sK34,sK33) )
    & ( nil != sK35
      | nil = sK36 )
    & sK33 = sK35
    & ssList(sK36)
    & ! [X5] :
        ( ! [X6] :
            ( app(cons(X5,nil),X6) != sK37
            | ~ ssList(X6)
            | ! [X7] :
                ( ~ ssList(X7)
                | app(X7,cons(X5,nil)) != sK35 ) )
        | ~ ssItem(X5) )
    & ssList(sK37)
    & app(sK35,sK37) = sK36
    & equalelemsP(sK35)
    & sK34 = sK36
    & ssList(sK35) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK33,sK34,sK35,sK36,sK37])],[f297,f302,f301,f300,f299,f298]) ).

fof(f298,plain,
    ( ? [X0] :
        ( ssList(X0)
        & ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ( ( nil != X1
                        & nil = X0 )
                      | sP2(X1,X0) )
                    & ( nil != X2
                      | nil = X3 )
                    & X0 = X2
                    & ssList(X3)
                    & ? [X4] :
                        ( ! [X5] :
                            ( ! [X6] :
                                ( app(cons(X5,nil),X6) != X4
                                | ~ ssList(X6)
                                | ! [X7] :
                                    ( ~ ssList(X7)
                                    | app(X7,cons(X5,nil)) != X2 ) )
                            | ~ ssItem(X5) )
                        & ssList(X4)
                        & app(X2,X4) = X3
                        & equalelemsP(X2) )
                    & X1 = X3 )
                & ssList(X2) ) ) )
   => ( ssList(sK33)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( ( nil != X1
                      & nil = sK33 )
                    | sP2(X1,sK33) )
                  & ( nil != X2
                    | nil = X3 )
                  & sK33 = X2
                  & ssList(X3)
                  & ? [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(cons(X5,nil),X6) != X4
                              | ~ ssList(X6)
                              | ! [X7] :
                                  ( ~ ssList(X7)
                                  | app(X7,cons(X5,nil)) != X2 ) )
                          | ~ ssItem(X5) )
                      & ssList(X4)
                      & app(X2,X4) = X3
                      & equalelemsP(X2) )
                  & X1 = X3 )
              & ssList(X2) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f299,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ( ( nil != X1
                    & nil = sK33 )
                  | sP2(X1,sK33) )
                & ( nil != X2
                  | nil = X3 )
                & sK33 = X2
                & ssList(X3)
                & ? [X4] :
                    ( ! [X5] :
                        ( ! [X6] :
                            ( app(cons(X5,nil),X6) != X4
                            | ~ ssList(X6)
                            | ! [X7] :
                                ( ~ ssList(X7)
                                | app(X7,cons(X5,nil)) != X2 ) )
                        | ~ ssItem(X5) )
                    & ssList(X4)
                    & app(X2,X4) = X3
                    & equalelemsP(X2) )
                & X1 = X3 )
            & ssList(X2) ) )
   => ( ssList(sK34)
      & ? [X2] :
          ( ? [X3] :
              ( ( ( nil != sK34
                  & nil = sK33 )
                | sP2(sK34,sK33) )
              & ( nil != X2
                | nil = X3 )
              & sK33 = X2
              & ssList(X3)
              & ? [X4] :
                  ( ! [X5] :
                      ( ! [X6] :
                          ( app(cons(X5,nil),X6) != X4
                          | ~ ssList(X6)
                          | ! [X7] :
                              ( ~ ssList(X7)
                              | app(X7,cons(X5,nil)) != X2 ) )
                      | ~ ssItem(X5) )
                  & ssList(X4)
                  & app(X2,X4) = X3
                  & equalelemsP(X2) )
              & sK34 = X3 )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f300,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( nil != sK34
                & nil = sK33 )
              | sP2(sK34,sK33) )
            & ( nil != X2
              | nil = X3 )
            & sK33 = X2
            & ssList(X3)
            & ? [X4] :
                ( ! [X5] :
                    ( ! [X6] :
                        ( app(cons(X5,nil),X6) != X4
                        | ~ ssList(X6)
                        | ! [X7] :
                            ( ~ ssList(X7)
                            | app(X7,cons(X5,nil)) != X2 ) )
                    | ~ ssItem(X5) )
                & ssList(X4)
                & app(X2,X4) = X3
                & equalelemsP(X2) )
            & sK34 = X3 )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( nil != sK34
              & nil = sK33 )
            | sP2(sK34,sK33) )
          & ( nil != sK35
            | nil = X3 )
          & sK33 = sK35
          & ssList(X3)
          & ? [X4] :
              ( ! [X5] :
                  ( ! [X6] :
                      ( app(cons(X5,nil),X6) != X4
                      | ~ ssList(X6)
                      | ! [X7] :
                          ( ~ ssList(X7)
                          | app(X7,cons(X5,nil)) != sK35 ) )
                  | ~ ssItem(X5) )
              & ssList(X4)
              & app(sK35,X4) = X3
              & equalelemsP(sK35) )
          & sK34 = X3 )
      & ssList(sK35) ) ),
    introduced(choice_axiom,[]) ).

fof(f301,plain,
    ( ? [X3] :
        ( ( ( nil != sK34
            & nil = sK33 )
          | sP2(sK34,sK33) )
        & ( nil != sK35
          | nil = X3 )
        & sK33 = sK35
        & ssList(X3)
        & ? [X4] :
            ( ! [X5] :
                ( ! [X6] :
                    ( app(cons(X5,nil),X6) != X4
                    | ~ ssList(X6)
                    | ! [X7] :
                        ( ~ ssList(X7)
                        | app(X7,cons(X5,nil)) != sK35 ) )
                | ~ ssItem(X5) )
            & ssList(X4)
            & app(sK35,X4) = X3
            & equalelemsP(sK35) )
        & sK34 = X3 )
   => ( ( ( nil != sK34
          & nil = sK33 )
        | sP2(sK34,sK33) )
      & ( nil != sK35
        | nil = sK36 )
      & sK33 = sK35
      & ssList(sK36)
      & ? [X4] :
          ( ! [X5] :
              ( ! [X6] :
                  ( app(cons(X5,nil),X6) != X4
                  | ~ ssList(X6)
                  | ! [X7] :
                      ( ~ ssList(X7)
                      | app(X7,cons(X5,nil)) != sK35 ) )
              | ~ ssItem(X5) )
          & ssList(X4)
          & app(sK35,X4) = sK36
          & equalelemsP(sK35) )
      & sK34 = sK36 ) ),
    introduced(choice_axiom,[]) ).

fof(f302,plain,
    ( ? [X4] :
        ( ! [X5] :
            ( ! [X6] :
                ( app(cons(X5,nil),X6) != X4
                | ~ ssList(X6)
                | ! [X7] :
                    ( ~ ssList(X7)
                    | app(X7,cons(X5,nil)) != sK35 ) )
            | ~ ssItem(X5) )
        & ssList(X4)
        & app(sK35,X4) = sK36
        & equalelemsP(sK35) )
   => ( ! [X5] :
          ( ! [X6] :
              ( app(cons(X5,nil),X6) != sK37
              | ~ ssList(X6)
              | ! [X7] :
                  ( ~ ssList(X7)
                  | app(X7,cons(X5,nil)) != sK35 ) )
          | ~ ssItem(X5) )
      & ssList(sK37)
      & app(sK35,sK37) = sK36
      & equalelemsP(sK35) ) ),
    introduced(choice_axiom,[]) ).

fof(f297,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( ( nil != X1
                      & nil = X0 )
                    | sP2(X1,X0) )
                  & ( nil != X2
                    | nil = X3 )
                  & X0 = X2
                  & ssList(X3)
                  & ? [X4] :
                      ( ! [X5] :
                          ( ! [X6] :
                              ( app(cons(X5,nil),X6) != X4
                              | ~ ssList(X6)
                              | ! [X7] :
                                  ( ~ ssList(X7)
                                  | app(X7,cons(X5,nil)) != X2 ) )
                          | ~ ssItem(X5) )
                      & ssList(X4)
                      & app(X2,X4) = X3
                      & equalelemsP(X2) )
                  & X1 = X3 )
              & ssList(X2) ) ) ),
    inference(rectify,[],[f228]) ).

fof(f228,plain,
    ? [X0] :
      ( ssList(X0)
      & ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( ( nil != X1
                      & nil = X0 )
                    | sP2(X1,X0) )
                  & ( nil != X2
                    | nil = X3 )
                  & X0 = X2
                  & ssList(X3)
                  & ? [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( app(cons(X9,nil),X10) != X8
                              | ~ ssList(X10)
                              | ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(X11,cons(X9,nil)) != X2 ) )
                          | ~ ssItem(X9) )
                      & ssList(X8)
                      & app(X2,X8) = X3
                      & equalelemsP(X2) )
                  & X1 = X3 )
              & ssList(X2) ) ) ),
    inference(definition_folding,[],[f206,f227]) ).

fof(f227,plain,
    ! [X1,X0] :
      ( ! [X4] :
          ( app(X0,X4) != X1
          | ~ ssList(X4)
          | ~ equalelemsP(X0)
          | ? [X5] :
              ( ssItem(X5)
              & ? [X6] :
                  ( ssList(X6)
                  & app(cons(X5,nil),X6) = X4
                  & ? [X7] :
                      ( ssList(X7)
                      & app(X7,cons(X5,nil)) = X0 ) ) ) )
      | ~ sP2(X1,X0) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).

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

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

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

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

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

fof(f711,plain,
    ( ssList(sK32(sK35,sK37))
    | ~ equalelemsP(sK35)
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f710,f646]) ).

fof(f646,plain,
    ( sP2(sK36,sK35)
    | ~ spl62_6 ),
    inference(avatar_component_clause,[],[f644]) ).

fof(f644,plain,
    ( spl62_6
  <=> sP2(sK36,sK35) ),
    introduced(avatar_definition,[new_symbols(naming,[spl62_6])]) ).

fof(f710,plain,
    ( ssList(sK32(sK35,sK37))
    | ~ sP2(sK36,sK35)
    | ~ equalelemsP(sK35) ),
    inference(subsumption_resolution,[],[f708,f455]) ).

fof(f455,plain,
    ssList(sK37),
    inference(cnf_transformation,[],[f303]) ).

fof(f708,plain,
    ( ~ ssList(sK37)
    | ~ sP2(sK36,sK35)
    | ~ equalelemsP(sK35)
    | ssList(sK32(sK35,sK37)) ),
    inference(superposition,[],[f597,f454]) ).

fof(f454,plain,
    app(sK35,sK37) = sK36,
    inference(cnf_transformation,[],[f303]) ).

fof(f597,plain,
    ! [X2,X1] :
      ( ~ sP2(app(X1,X2),X1)
      | ~ equalelemsP(X1)
      | ~ ssList(X2)
      | ssList(sK32(X1,X2)) ),
    inference(equality_resolution,[],[f447]) ).

fof(f447,plain,
    ! [X2,X0,X1] :
      ( app(X1,X2) != X0
      | ~ ssList(X2)
      | ~ equalelemsP(X1)
      | ssList(sK32(X1,X2))
      | ~ sP2(X0,X1) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f296,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( app(X1,X2) != X0
          | ~ ssList(X2)
          | ~ equalelemsP(X1)
          | ( ssItem(sK30(X1,X2))
            & ssList(sK31(X1,X2))
            & app(cons(sK30(X1,X2),nil),sK31(X1,X2)) = X2
            & ssList(sK32(X1,X2))
            & app(sK32(X1,X2),cons(sK30(X1,X2),nil)) = X1 ) )
      | ~ sP2(X0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK30,sK31,sK32])],[f292,f295,f294,f293]) ).

fof(f293,plain,
    ! [X1,X2] :
      ( ? [X3] :
          ( ssItem(X3)
          & ? [X4] :
              ( ssList(X4)
              & app(cons(X3,nil),X4) = X2
              & ? [X5] :
                  ( ssList(X5)
                  & app(X5,cons(X3,nil)) = X1 ) ) )
     => ( ssItem(sK30(X1,X2))
        & ? [X4] :
            ( ssList(X4)
            & app(cons(sK30(X1,X2),nil),X4) = X2
            & ? [X5] :
                ( ssList(X5)
                & app(X5,cons(sK30(X1,X2),nil)) = X1 ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f294,plain,
    ! [X1,X2] :
      ( ? [X4] :
          ( ssList(X4)
          & app(cons(sK30(X1,X2),nil),X4) = X2
          & ? [X5] :
              ( ssList(X5)
              & app(X5,cons(sK30(X1,X2),nil)) = X1 ) )
     => ( ssList(sK31(X1,X2))
        & app(cons(sK30(X1,X2),nil),sK31(X1,X2)) = X2
        & ? [X5] :
            ( ssList(X5)
            & app(X5,cons(sK30(X1,X2),nil)) = X1 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f295,plain,
    ! [X1,X2] :
      ( ? [X5] :
          ( ssList(X5)
          & app(X5,cons(sK30(X1,X2),nil)) = X1 )
     => ( ssList(sK32(X1,X2))
        & app(sK32(X1,X2),cons(sK30(X1,X2),nil)) = X1 ) ),
    introduced(choice_axiom,[]) ).

fof(f292,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( app(X1,X2) != X0
          | ~ ssList(X2)
          | ~ equalelemsP(X1)
          | ? [X3] :
              ( ssItem(X3)
              & ? [X4] :
                  ( ssList(X4)
                  & app(cons(X3,nil),X4) = X2
                  & ? [X5] :
                      ( ssList(X5)
                      & app(X5,cons(X3,nil)) = X1 ) ) ) )
      | ~ sP2(X0,X1) ),
    inference(rectify,[],[f291]) ).

fof(f291,plain,
    ! [X1,X0] :
      ( ! [X4] :
          ( app(X0,X4) != X1
          | ~ ssList(X4)
          | ~ equalelemsP(X0)
          | ? [X5] :
              ( ssItem(X5)
              & ? [X6] :
                  ( ssList(X6)
                  & app(cons(X5,nil),X6) = X4
                  & ? [X7] :
                      ( ssList(X7)
                      & app(X7,cons(X5,nil)) = X0 ) ) ) )
      | ~ sP2(X1,X0) ),
    inference(nnf_transformation,[],[f227]) ).

fof(f955,plain,
    ( ~ ssList(sK32(sK35,sK37))
    | ~ spl62_6 ),
    inference(trivial_inequality_removal,[],[f930]) ).

fof(f930,plain,
    ( ~ ssList(sK32(sK35,sK37))
    | sK35 != sK35
    | ~ spl62_6 ),
    inference(superposition,[],[f854,f927]) ).

fof(f927,plain,
    ( app(sK32(sK35,sK37),cons(sK30(sK35,sK37),nil)) = sK35
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f926,f455]) ).

fof(f926,plain,
    ( ~ ssList(sK37)
    | app(sK32(sK35,sK37),cons(sK30(sK35,sK37),nil)) = sK35
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f925,f646]) ).

fof(f925,plain,
    ( ~ sP2(sK36,sK35)
    | app(sK32(sK35,sK37),cons(sK30(sK35,sK37),nil)) = sK35
    | ~ ssList(sK37) ),
    inference(subsumption_resolution,[],[f922,f453]) ).

fof(f922,plain,
    ( app(sK32(sK35,sK37),cons(sK30(sK35,sK37),nil)) = sK35
    | ~ equalelemsP(sK35)
    | ~ ssList(sK37)
    | ~ sP2(sK36,sK35) ),
    inference(superposition,[],[f598,f454]) ).

fof(f598,plain,
    ! [X2,X1] :
      ( ~ sP2(app(X1,X2),X1)
      | ~ equalelemsP(X1)
      | ~ ssList(X2)
      | app(sK32(X1,X2),cons(sK30(X1,X2),nil)) = X1 ),
    inference(equality_resolution,[],[f446]) ).

fof(f446,plain,
    ! [X2,X0,X1] :
      ( app(X1,X2) != X0
      | ~ ssList(X2)
      | ~ equalelemsP(X1)
      | app(sK32(X1,X2),cons(sK30(X1,X2),nil)) = X1
      | ~ sP2(X0,X1) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f854,plain,
    ( ! [X0] :
        ( app(X0,cons(sK30(sK35,sK37),nil)) != sK35
        | ~ ssList(X0) )
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f853,f684]) ).

fof(f684,plain,
    ( ssItem(sK30(sK35,sK37))
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f683,f646]) ).

fof(f683,plain,
    ( ssItem(sK30(sK35,sK37))
    | ~ sP2(sK36,sK35) ),
    inference(subsumption_resolution,[],[f682,f453]) ).

fof(f682,plain,
    ( ~ equalelemsP(sK35)
    | ssItem(sK30(sK35,sK37))
    | ~ sP2(sK36,sK35) ),
    inference(subsumption_resolution,[],[f680,f455]) ).

fof(f680,plain,
    ( ssItem(sK30(sK35,sK37))
    | ~ ssList(sK37)
    | ~ sP2(sK36,sK35)
    | ~ equalelemsP(sK35) ),
    inference(superposition,[],[f594,f454]) ).

fof(f594,plain,
    ! [X2,X1] :
      ( ~ sP2(app(X1,X2),X1)
      | ~ ssList(X2)
      | ssItem(sK30(X1,X2))
      | ~ equalelemsP(X1) ),
    inference(equality_resolution,[],[f450]) ).

fof(f450,plain,
    ! [X2,X0,X1] :
      ( app(X1,X2) != X0
      | ~ ssList(X2)
      | ~ equalelemsP(X1)
      | ssItem(sK30(X1,X2))
      | ~ sP2(X0,X1) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f853,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | app(X0,cons(sK30(sK35,sK37),nil)) != sK35
        | ~ ssItem(sK30(sK35,sK37)) )
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f802,f707]) ).

fof(f707,plain,
    ( ssList(sK31(sK35,sK37))
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f706,f453]) ).

fof(f706,plain,
    ( ~ equalelemsP(sK35)
    | ssList(sK31(sK35,sK37))
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f705,f455]) ).

fof(f705,plain,
    ( ssList(sK31(sK35,sK37))
    | ~ ssList(sK37)
    | ~ equalelemsP(sK35)
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f696,f646]) ).

fof(f696,plain,
    ( ssList(sK31(sK35,sK37))
    | ~ sP2(sK36,sK35)
    | ~ ssList(sK37)
    | ~ equalelemsP(sK35) ),
    inference(superposition,[],[f595,f454]) ).

fof(f595,plain,
    ! [X2,X1] :
      ( ~ sP2(app(X1,X2),X1)
      | ~ ssList(X2)
      | ~ equalelemsP(X1)
      | ssList(sK31(X1,X2)) ),
    inference(equality_resolution,[],[f449]) ).

fof(f449,plain,
    ! [X2,X0,X1] :
      ( app(X1,X2) != X0
      | ~ ssList(X2)
      | ~ equalelemsP(X1)
      | ssList(sK31(X1,X2))
      | ~ sP2(X0,X1) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f802,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | ~ ssList(sK31(sK35,sK37))
        | app(X0,cons(sK30(sK35,sK37),nil)) != sK35
        | ~ ssItem(sK30(sK35,sK37)) )
    | ~ spl62_6 ),
    inference(trivial_inequality_removal,[],[f781]) ).

fof(f781,plain,
    ( ! [X0] :
        ( app(X0,cons(sK30(sK35,sK37),nil)) != sK35
        | ~ ssList(X0)
        | sK37 != sK37
        | ~ ssItem(sK30(sK35,sK37))
        | ~ ssList(sK31(sK35,sK37)) )
    | ~ spl62_6 ),
    inference(superposition,[],[f456,f780]) ).

fof(f780,plain,
    ( app(cons(sK30(sK35,sK37),nil),sK31(sK35,sK37)) = sK37
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f779,f455]) ).

fof(f779,plain,
    ( ~ ssList(sK37)
    | app(cons(sK30(sK35,sK37),nil),sK31(sK35,sK37)) = sK37
    | ~ spl62_6 ),
    inference(subsumption_resolution,[],[f778,f646]) ).

fof(f778,plain,
    ( ~ sP2(sK36,sK35)
    | app(cons(sK30(sK35,sK37),nil),sK31(sK35,sK37)) = sK37
    | ~ ssList(sK37) ),
    inference(subsumption_resolution,[],[f776,f453]) ).

fof(f776,plain,
    ( ~ equalelemsP(sK35)
    | app(cons(sK30(sK35,sK37),nil),sK31(sK35,sK37)) = sK37
    | ~ sP2(sK36,sK35)
    | ~ ssList(sK37) ),
    inference(superposition,[],[f596,f454]) ).

fof(f596,plain,
    ! [X2,X1] :
      ( ~ sP2(app(X1,X2),X1)
      | app(cons(sK30(X1,X2),nil),sK31(X1,X2)) = X2
      | ~ ssList(X2)
      | ~ equalelemsP(X1) ),
    inference(equality_resolution,[],[f448]) ).

fof(f448,plain,
    ! [X2,X0,X1] :
      ( app(X1,X2) != X0
      | ~ ssList(X2)
      | ~ equalelemsP(X1)
      | app(cons(sK30(X1,X2),nil),sK31(X1,X2)) = X2
      | ~ sP2(X0,X1) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f456,plain,
    ! [X6,X7,X5] :
      ( app(cons(X5,nil),X6) != sK37
      | ~ ssList(X6)
      | ~ ssList(X7)
      | ~ ssItem(X5)
      | app(X7,cons(X5,nil)) != sK35 ),
    inference(cnf_transformation,[],[f303]) ).

fof(f652,plain,
    ( spl62_6
    | spl62_4 ),
    inference(avatar_split_clause,[],[f579,f635,f644]) ).

fof(f635,plain,
    ( spl62_4
  <=> nil = sK35 ),
    introduced(avatar_definition,[new_symbols(naming,[spl62_4])]) ).

fof(f579,plain,
    ( nil = sK35
    | sP2(sK36,sK35) ),
    inference(definition_unfolding,[],[f460,f458,f452,f458]) ).

fof(f452,plain,
    sK34 = sK36,
    inference(cnf_transformation,[],[f303]) ).

fof(f458,plain,
    sK33 = sK35,
    inference(cnf_transformation,[],[f303]) ).

fof(f460,plain,
    ( nil = sK33
    | sP2(sK34,sK33) ),
    inference(cnf_transformation,[],[f303]) ).

fof(f647,plain,
    ( spl62_6
    | ~ spl62_5 ),
    inference(avatar_split_clause,[],[f578,f639,f644]) ).

fof(f639,plain,
    ( spl62_5
  <=> nil = sK36 ),
    introduced(avatar_definition,[new_symbols(naming,[spl62_5])]) ).

fof(f578,plain,
    ( nil != sK36
    | sP2(sK36,sK35) ),
    inference(definition_unfolding,[],[f461,f452,f452,f458]) ).

fof(f461,plain,
    ( nil != sK34
    | sP2(sK34,sK33) ),
    inference(cnf_transformation,[],[f303]) ).

fof(f642,plain,
    ( ~ spl62_4
    | spl62_5 ),
    inference(avatar_split_clause,[],[f459,f639,f635]) ).

fof(f459,plain,
    ( nil = sK36
    | nil != sK35 ),
    inference(cnf_transformation,[],[f303]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC327+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 18:48:03 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.22/0.51  % (1717)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.52  % (1710)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.52  % (1719)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.22/0.52  % (1716)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.52  % (1712)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.22/0.52  % (1718)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.52  % (1737)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.22/0.52  % (1728)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.52  % (1727)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.22/0.53  % (1731)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.22/0.53  % (1711)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.53  % (1715)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.53  % (1722)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.22/0.53  % (1729)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.22/0.53  % (1715)Instruction limit reached!
% 0.22/0.53  % (1715)------------------------------
% 0.22/0.53  % (1715)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.53  % (1715)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.53  % (1715)Termination reason: Unknown
% 0.22/0.53  % (1715)Termination phase: Preprocessing 2
% 0.22/0.53  
% 0.22/0.53  % (1715)Memory used [KB]: 1023
% 0.22/0.53  % (1715)Time elapsed: 0.003 s
% 0.22/0.53  % (1715)Instructions burned: 2 (million)
% 0.22/0.53  % (1715)------------------------------
% 0.22/0.53  % (1715)------------------------------
% 0.22/0.53  % (1709)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.22/0.53  % (1733)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.22/0.53  % (1734)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.22/0.54  % (1725)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.54  % (1707)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.22/0.54  % (1708)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.22/0.54  % (1720)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.22/0.54  % (1713)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.54  % (1724)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.22/0.55  % (1732)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.22/0.55  % (1726)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.22/0.55  % (1735)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.22/0.55  % (1730)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.22/0.55  % (1736)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.22/0.55  % (1714)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.56  % (1714)Instruction limit reached!
% 0.22/0.56  % (1714)------------------------------
% 0.22/0.56  % (1714)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.56  % (1738)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.55/0.58  TRYING [1]
% 1.55/0.58  % (1714)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.55/0.58  % (1714)Termination reason: Unknown
% 1.55/0.58  % (1714)Termination phase: Function definition elimination
% 1.55/0.58  
% 1.55/0.58  % (1714)Memory used [KB]: 1279
% 1.55/0.58  % (1714)Time elapsed: 0.005 s
% 1.55/0.58  % (1714)Instructions burned: 8 (million)
% 1.55/0.58  % (1714)------------------------------
% 1.55/0.58  % (1714)------------------------------
% 1.55/0.58  TRYING [1]
% 1.55/0.58  % (1709)Instruction limit reached!
% 1.55/0.58  % (1709)------------------------------
% 1.55/0.58  % (1709)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.55/0.58  % (1709)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.55/0.58  % (1709)Termination reason: Unknown
% 1.55/0.58  % (1709)Termination phase: Saturation
% 1.55/0.58  
% 1.55/0.58  % (1709)Memory used [KB]: 1663
% 1.55/0.58  % (1709)Time elapsed: 0.163 s
% 1.55/0.58  % (1709)Instructions burned: 37 (million)
% 1.55/0.58  % (1709)------------------------------
% 1.55/0.58  % (1709)------------------------------
% 1.73/0.58  TRYING [2]
% 1.73/0.59  TRYING [1]
% 1.73/0.59  TRYING [2]
% 1.73/0.59  TRYING [2]
% 1.73/0.60  % (1717)Instruction limit reached!
% 1.73/0.60  % (1717)------------------------------
% 1.73/0.60  % (1717)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.60  TRYING [3]
% 1.73/0.61  % (1717)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.73/0.61  % (1717)Termination reason: Unknown
% 1.73/0.61  % (1717)Termination phase: Saturation
% 1.73/0.61  
% 1.73/0.61  % (1717)Memory used [KB]: 6652
% 1.73/0.61  % (1717)Time elapsed: 0.197 s
% 1.73/0.61  % (1717)Instructions burned: 50 (million)
% 1.73/0.61  % (1717)------------------------------
% 1.73/0.61  % (1717)------------------------------
% 1.73/0.61  % (1710)Instruction limit reached!
% 1.73/0.61  % (1710)------------------------------
% 1.73/0.61  % (1710)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.61  % (1710)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.73/0.61  % (1710)Termination reason: Unknown
% 1.73/0.61  % (1710)Termination phase: Saturation
% 1.73/0.61  
% 1.73/0.61  % (1710)Memory used [KB]: 6652
% 1.73/0.61  % (1710)Time elapsed: 0.205 s
% 1.73/0.61  % (1710)Instructions burned: 51 (million)
% 1.73/0.61  % (1710)------------------------------
% 1.73/0.61  % (1710)------------------------------
% 1.73/0.61  % (1726)Instruction limit reached!
% 1.73/0.61  % (1726)------------------------------
% 1.73/0.61  % (1726)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.61  % (1726)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.73/0.61  % (1726)Termination reason: Unknown
% 1.73/0.61  % (1726)Termination phase: Finite model building constraint generation
% 1.73/0.61  
% 1.73/0.61  % (1726)Memory used [KB]: 7547
% 1.73/0.61  % (1726)Time elapsed: 0.201 s
% 1.73/0.61  % (1726)Instructions burned: 60 (million)
% 1.73/0.61  % (1726)------------------------------
% 1.73/0.61  % (1726)------------------------------
% 1.73/0.61  % (1708)First to succeed.
% 1.73/0.61  % (1708)Refutation found. Thanks to Tanya!
% 1.73/0.61  % SZS status Theorem for theBenchmark
% 1.73/0.61  % SZS output start Proof for theBenchmark
% See solution above
% 1.73/0.62  % (1708)------------------------------
% 1.73/0.62  % (1708)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.73/0.62  % (1708)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.73/0.62  % (1708)Termination reason: Refutation
% 1.73/0.62  
% 1.73/0.62  % (1708)Memory used [KB]: 6524
% 1.73/0.62  % (1708)Time elapsed: 0.208 s
% 1.73/0.62  % (1708)Instructions burned: 35 (million)
% 1.73/0.62  % (1708)------------------------------
% 1.73/0.62  % (1708)------------------------------
% 1.73/0.62  % (1706)Success in time 0.251 s
%------------------------------------------------------------------------------