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

View Problem - Process Solution

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

% Result   : Theorem 1.43s 0.56s
% Output   : Refutation 1.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   45 (  12 unt;   0 def)
%            Number of atoms       :  282 (  81 equ)
%            Maximal formula atoms :   19 (   6 avg)
%            Number of connectives :  330 (  93   ~;  80   |; 136   &)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   8 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :  164 ( 106   !;  58   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f376,plain,
    $false,
    inference(resolution,[],[f369,f225]) ).

fof(f225,plain,
    sP0(sK11,sK10,sK11,sK10),
    inference(subsumption_resolution,[],[f187,f198]) ).

fof(f198,plain,
    neq(sK11,nil),
    inference(subsumption_resolution,[],[f186,f164]) ).

fof(f164,plain,
    ! [X2,X3,X0,X1] :
      ( neq(X0,nil)
      | ~ sP0(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f135,plain,
    ! [X0,X1,X2,X3] :
      ( ( ! [X4] :
            ( ~ ssItem(X4)
            | ! [X5] :
                ( ~ ssList(X5)
                | ! [X6] :
                    ( app(app(X5,cons(X4,nil)),X6) != X0
                    | app(X5,X6) != X1
                    | ~ ssList(X6) ) ) )
        & ssList(sK6(X2,X3))
        & app(app(sK6(X2,X3),cons(sK5(X2,X3),nil)),sK7(X2,X3)) = X2
        & ssList(sK7(X2,X3))
        & app(sK6(X2,X3),sK7(X2,X3)) = X3
        & ssItem(sK5(X2,X3))
        & neq(X0,nil) )
      | ~ sP0(X0,X1,X2,X3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f131,f134,f133,f132]) ).

fof(f132,plain,
    ! [X2,X3] :
      ( ? [X7] :
          ( ? [X8] :
              ( ssList(X8)
              & ? [X9] :
                  ( app(app(X8,cons(X7,nil)),X9) = X2
                  & ssList(X9)
                  & app(X8,X9) = X3 ) )
          & ssItem(X7) )
     => ( ? [X8] :
            ( ssList(X8)
            & ? [X9] :
                ( app(app(X8,cons(sK5(X2,X3),nil)),X9) = X2
                & ssList(X9)
                & app(X8,X9) = X3 ) )
        & ssItem(sK5(X2,X3)) ) ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ! [X2,X3] :
      ( ? [X8] :
          ( ssList(X8)
          & ? [X9] :
              ( app(app(X8,cons(sK5(X2,X3),nil)),X9) = X2
              & ssList(X9)
              & app(X8,X9) = X3 ) )
     => ( ssList(sK6(X2,X3))
        & ? [X9] :
            ( app(app(sK6(X2,X3),cons(sK5(X2,X3),nil)),X9) = X2
            & ssList(X9)
            & app(sK6(X2,X3),X9) = X3 ) ) ),
    introduced(choice_axiom,[]) ).

fof(f134,plain,
    ! [X2,X3] :
      ( ? [X9] :
          ( app(app(sK6(X2,X3),cons(sK5(X2,X3),nil)),X9) = X2
          & ssList(X9)
          & app(sK6(X2,X3),X9) = X3 )
     => ( app(app(sK6(X2,X3),cons(sK5(X2,X3),nil)),sK7(X2,X3)) = X2
        & ssList(sK7(X2,X3))
        & app(sK6(X2,X3),sK7(X2,X3)) = X3 ) ),
    introduced(choice_axiom,[]) ).

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

fof(f130,plain,
    ! [X1,X0,X3,X2] :
      ( ( ! [X4] :
            ( ~ ssItem(X4)
            | ! [X5] :
                ( ~ ssList(X5)
                | ! [X6] :
                    ( app(app(X5,cons(X4,nil)),X6) != X1
                    | app(X5,X6) != X0
                    | ~ ssList(X6) ) ) )
        & ? [X7] :
            ( ? [X8] :
                ( ssList(X8)
                & ? [X9] :
                    ( app(app(X8,cons(X7,nil)),X9) = X3
                    & ssList(X9)
                    & app(X8,X9) = X2 ) )
            & ssItem(X7) )
        & neq(X1,nil) )
      | ~ sP0(X1,X0,X3,X2) ),
    inference(nnf_transformation,[],[f120]) ).

fof(f120,plain,
    ! [X1,X0,X3,X2] :
      ( ( ! [X4] :
            ( ~ ssItem(X4)
            | ! [X5] :
                ( ~ ssList(X5)
                | ! [X6] :
                    ( app(app(X5,cons(X4,nil)),X6) != X1
                    | app(X5,X6) != X0
                    | ~ ssList(X6) ) ) )
        & ? [X7] :
            ( ? [X8] :
                ( ssList(X8)
                & ? [X9] :
                    ( app(app(X8,cons(X7,nil)),X9) = X3
                    & ssList(X9)
                    & app(X8,X9) = X2 ) )
            & ssItem(X7) )
        & neq(X1,nil) )
      | ~ sP0(X1,X0,X3,X2) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f186,plain,
    ( sP0(sK11,sK10,sK11,sK10)
    | neq(sK11,nil) ),
    inference(definition_unfolding,[],[f177,f175,f174,f175]) ).

fof(f174,plain,
    sK8 = sK10,
    inference(cnf_transformation,[],[f140]) ).

fof(f140,plain,
    ( ssList(sK9)
    & ( sP0(sK9,sK8,sK11,sK10)
      | ( neq(sK9,nil)
        & ~ neq(sK11,nil) ) )
    & sK9 = sK11
    & sK8 = sK10
    & ssList(sK11)
    & ssList(sK10)
    & ssList(sK8) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f121,f139,f138,f137,f136]) ).

fof(f136,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ssList(X1)
            & ? [X2] :
                ( ? [X3] :
                    ( ( sP0(X1,X0,X3,X2)
                      | ( neq(X1,nil)
                        & ~ neq(X3,nil) ) )
                    & X1 = X3
                    & X0 = X2
                    & ssList(X3) )
                & ssList(X2) ) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( sP0(X1,sK8,X3,X2)
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & X1 = X3
                  & sK8 = X2
                  & ssList(X3) )
              & ssList(X2) ) )
      & ssList(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f137,plain,
    ( ? [X1] :
        ( ssList(X1)
        & ? [X2] :
            ( ? [X3] :
                ( ( sP0(X1,sK8,X3,X2)
                  | ( neq(X1,nil)
                    & ~ neq(X3,nil) ) )
                & X1 = X3
                & sK8 = X2
                & ssList(X3) )
            & ssList(X2) ) )
   => ( ssList(sK9)
      & ? [X2] :
          ( ? [X3] :
              ( ( sP0(sK9,sK8,X3,X2)
                | ( neq(sK9,nil)
                  & ~ neq(X3,nil) ) )
              & sK9 = X3
              & sK8 = X2
              & ssList(X3) )
          & ssList(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f138,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( sP0(sK9,sK8,X3,X2)
              | ( neq(sK9,nil)
                & ~ neq(X3,nil) ) )
            & sK9 = X3
            & sK8 = X2
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( sP0(sK9,sK8,X3,sK10)
            | ( neq(sK9,nil)
              & ~ neq(X3,nil) ) )
          & sK9 = X3
          & sK8 = sK10
          & ssList(X3) )
      & ssList(sK10) ) ),
    introduced(choice_axiom,[]) ).

fof(f139,plain,
    ( ? [X3] :
        ( ( sP0(sK9,sK8,X3,sK10)
          | ( neq(sK9,nil)
            & ~ neq(X3,nil) ) )
        & sK9 = X3
        & sK8 = sK10
        & ssList(X3) )
   => ( ( sP0(sK9,sK8,sK11,sK10)
        | ( neq(sK9,nil)
          & ~ neq(sK11,nil) ) )
      & sK9 = sK11
      & sK8 = sK10
      & ssList(sK11) ) ),
    introduced(choice_axiom,[]) ).

fof(f121,plain,
    ? [X0] :
      ( ? [X1] :
          ( ssList(X1)
          & ? [X2] :
              ( ? [X3] :
                  ( ( sP0(X1,X0,X3,X2)
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & X1 = X3
                  & X0 = X2
                  & ssList(X3) )
              & ssList(X2) ) )
      & ssList(X0) ),
    inference(definition_folding,[],[f105,f120]) ).

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

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

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

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

fof(f175,plain,
    sK9 = sK11,
    inference(cnf_transformation,[],[f140]) ).

fof(f177,plain,
    ( sP0(sK9,sK8,sK11,sK10)
    | neq(sK9,nil) ),
    inference(cnf_transformation,[],[f140]) ).

fof(f187,plain,
    ( ~ neq(sK11,nil)
    | sP0(sK11,sK10,sK11,sK10) ),
    inference(definition_unfolding,[],[f176,f175,f174]) ).

fof(f176,plain,
    ( sP0(sK9,sK8,sK11,sK10)
    | ~ neq(sK11,nil) ),
    inference(cnf_transformation,[],[f140]) ).

fof(f369,plain,
    ! [X0,X1] : ~ sP0(sK11,sK10,X0,X1),
    inference(forward_demodulation,[],[f368,f227]) ).

fof(f227,plain,
    sK10 = app(sK6(sK11,sK10),sK7(sK11,sK10)),
    inference(resolution,[],[f225,f166]) ).

fof(f166,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | app(sK6(X2,X3),sK7(X2,X3)) = X3 ),
    inference(cnf_transformation,[],[f135]) ).

fof(f368,plain,
    ! [X0,X1] : ~ sP0(sK11,app(sK6(sK11,sK10),sK7(sK11,sK10)),X0,X1),
    inference(subsumption_resolution,[],[f367,f228]) ).

fof(f228,plain,
    ssList(sK6(sK11,sK10)),
    inference(resolution,[],[f225,f169]) ).

fof(f169,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | ssList(sK6(X2,X3)) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f367,plain,
    ! [X0,X1] :
      ( ~ sP0(sK11,app(sK6(sK11,sK10),sK7(sK11,sK10)),X0,X1)
      | ~ ssList(sK6(sK11,sK10)) ),
    inference(subsumption_resolution,[],[f366,f229]) ).

fof(f229,plain,
    ssItem(sK5(sK11,sK10)),
    inference(resolution,[],[f225,f165]) ).

fof(f165,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | ssItem(sK5(X2,X3)) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f366,plain,
    ! [X0,X1] :
      ( ~ ssItem(sK5(sK11,sK10))
      | ~ sP0(sK11,app(sK6(sK11,sK10),sK7(sK11,sK10)),X0,X1)
      | ~ ssList(sK6(sK11,sK10)) ),
    inference(subsumption_resolution,[],[f356,f226]) ).

fof(f226,plain,
    ssList(sK7(sK11,sK10)),
    inference(resolution,[],[f225,f167]) ).

fof(f167,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | ssList(sK7(X2,X3)) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f356,plain,
    ! [X0,X1] :
      ( ~ sP0(sK11,app(sK6(sK11,sK10),sK7(sK11,sK10)),X0,X1)
      | ~ ssList(sK7(sK11,sK10))
      | ~ ssList(sK6(sK11,sK10))
      | ~ ssItem(sK5(sK11,sK10)) ),
    inference(superposition,[],[f192,f230]) ).

fof(f230,plain,
    app(app(sK6(sK11,sK10),cons(sK5(sK11,sK10),nil)),sK7(sK11,sK10)) = sK11,
    inference(resolution,[],[f225,f168]) ).

fof(f168,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP0(X0,X1,X2,X3)
      | app(app(sK6(X2,X3),cons(sK5(X2,X3),nil)),sK7(X2,X3)) = X2 ),
    inference(cnf_transformation,[],[f135]) ).

fof(f192,plain,
    ! [X2,X3,X6,X4,X5] :
      ( ~ sP0(app(app(X5,cons(X4,nil)),X6),app(X5,X6),X2,X3)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ ssList(X6) ),
    inference(equality_resolution,[],[f191]) ).

fof(f191,plain,
    ! [X2,X3,X1,X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | app(X5,X6) != X1
      | ~ ssList(X6)
      | ~ sP0(app(app(X5,cons(X4,nil)),X6),X1,X2,X3) ),
    inference(equality_resolution,[],[f170]) ).

fof(f170,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | app(app(X5,cons(X4,nil)),X6) != X0
      | app(X5,X6) != X1
      | ~ ssList(X6)
      | ~ sP0(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWC011+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.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 17:58:50 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  % (20328)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52  % (20329)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52  % (20329)Instruction limit reached!
% 0.20/0.52  % (20329)------------------------------
% 0.20/0.52  % (20329)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.53  % (20344)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.32/0.53  % (20348)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.32/0.53  % (20352)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.32/0.53  % (20355)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.32/0.53  % (20329)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.53  % (20329)Termination reason: Unknown
% 1.32/0.53  % (20329)Termination phase: Preprocessing 3
% 1.32/0.53  
% 1.32/0.53  % (20329)Memory used [KB]: 1535
% 1.32/0.53  % (20329)Time elapsed: 0.004 s
% 1.32/0.53  % (20329)Instructions burned: 3 (million)
% 1.32/0.53  % (20329)------------------------------
% 1.32/0.53  % (20329)------------------------------
% 1.32/0.53  % (20350)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.32/0.53  % (20332)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.32/0.54  % (20330)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.32/0.54  % (20336)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.32/0.54  % (20344)Instruction limit reached!
% 1.32/0.54  % (20344)------------------------------
% 1.32/0.54  % (20344)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.54  % (20344)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.54  % (20344)Termination reason: Unknown
% 1.32/0.54  % (20344)Termination phase: Naming
% 1.32/0.54  
% 1.32/0.54  % (20344)Memory used [KB]: 1663
% 1.32/0.54  % (20344)Time elapsed: 0.004 s
% 1.32/0.54  % (20344)Instructions burned: 3 (million)
% 1.32/0.54  % (20344)------------------------------
% 1.32/0.54  % (20344)------------------------------
% 1.32/0.54  % (20340)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.32/0.54  % (20333)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.32/0.54  % (20338)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.32/0.54  % (20337)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.32/0.54  % (20332)First to succeed.
% 1.32/0.54  % (20335)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.32/0.54  % (20337)Refutation not found, incomplete strategy% (20337)------------------------------
% 1.32/0.54  % (20337)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.54  % (20337)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.54  % (20337)Termination reason: Refutation not found, incomplete strategy
% 1.32/0.54  
% 1.32/0.54  % (20337)Memory used [KB]: 6140
% 1.32/0.54  % (20337)Time elapsed: 0.132 s
% 1.32/0.54  % (20337)Instructions burned: 4 (million)
% 1.32/0.54  % (20337)------------------------------
% 1.32/0.54  % (20337)------------------------------
% 1.32/0.54  % (20341)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.32/0.54  % (20338)Instruction limit reached!
% 1.32/0.54  % (20338)------------------------------
% 1.32/0.54  % (20338)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.54  % (20338)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.54  % (20338)Termination reason: Unknown
% 1.32/0.54  % (20338)Termination phase: Saturation
% 1.32/0.54  
% 1.32/0.54  % (20338)Memory used [KB]: 6140
% 1.32/0.54  % (20338)Time elapsed: 0.132 s
% 1.32/0.54  % (20338)Instructions burned: 8 (million)
% 1.32/0.54  % (20338)------------------------------
% 1.32/0.54  % (20338)------------------------------
% 1.43/0.54  % (20341)Instruction limit reached!
% 1.43/0.54  % (20341)------------------------------
% 1.43/0.54  % (20341)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.54  % (20341)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.54  % (20341)Termination reason: Unknown
% 1.43/0.54  % (20341)Termination phase: Preprocessing 3
% 1.43/0.54  
% 1.43/0.54  % (20341)Memory used [KB]: 1663
% 1.43/0.54  % (20341)Time elapsed: 0.003 s
% 1.43/0.54  % (20341)Instructions burned: 4 (million)
% 1.43/0.54  % (20341)------------------------------
% 1.43/0.54  % (20341)------------------------------
% 1.43/0.54  % (20347)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.43/0.54  % (20349)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.43/0.54  % (20334)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.43/0.54  % (20345)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.43/0.54  % (20339)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.43/0.54  % (20327)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.43/0.55  % (20328)Instruction limit reached!
% 1.43/0.55  % (20328)------------------------------
% 1.43/0.55  % (20328)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.55  % (20343)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.43/0.55  % (20354)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.43/0.55  % (20351)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.43/0.55  % (20353)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.43/0.55  % (20346)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.43/0.55  % (20346)Refutation not found, incomplete strategy% (20346)------------------------------
% 1.43/0.55  % (20346)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.55  % (20346)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.55  % (20346)Termination reason: Refutation not found, incomplete strategy
% 1.43/0.55  
% 1.43/0.55  % (20346)Memory used [KB]: 6012
% 1.43/0.55  % (20346)Time elapsed: 0.146 s
% 1.43/0.55  % (20346)Instructions burned: 3 (million)
% 1.43/0.55  % (20346)------------------------------
% 1.43/0.55  % (20346)------------------------------
% 1.43/0.55  % (20331)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.43/0.56  % (20355)Instruction limit reached!
% 1.43/0.56  % (20355)------------------------------
% 1.43/0.56  % (20355)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.56  % (20355)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.56  % (20355)Termination reason: Unknown
% 1.43/0.56  % (20355)Termination phase: shuffling
% 1.43/0.56  
% 1.43/0.56  % (20355)Memory used [KB]: 1791
% 1.43/0.56  % (20355)Time elapsed: 0.006 s
% 1.43/0.56  % (20355)Instructions burned: 10 (million)
% 1.43/0.56  % (20355)------------------------------
% 1.43/0.56  % (20355)------------------------------
% 1.43/0.56  % (20328)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.56  % (20328)Termination reason: Unknown
% 1.43/0.56  % (20328)Termination phase: Saturation
% 1.43/0.56  
% 1.43/0.56  % (20328)Memory used [KB]: 6396
% 1.43/0.56  % (20328)Time elapsed: 0.132 s
% 1.43/0.56  % (20328)Instructions burned: 13 (million)
% 1.43/0.56  % (20328)------------------------------
% 1.43/0.56  % (20328)------------------------------
% 1.43/0.56  % (20345)Instruction limit reached!
% 1.43/0.56  % (20345)------------------------------
% 1.43/0.56  % (20345)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.56  % (20345)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.56  % (20345)Termination reason: Unknown
% 1.43/0.56  % (20345)Termination phase: Function definition elimination
% 1.43/0.56  
% 1.43/0.56  % (20345)Memory used [KB]: 1535
% 1.43/0.56  % (20345)Time elapsed: 0.005 s
% 1.43/0.56  % (20345)Instructions burned: 3 (million)
% 1.43/0.56  % (20345)------------------------------
% 1.43/0.56  % (20345)------------------------------
% 1.43/0.56  % (20339)Instruction limit reached!
% 1.43/0.56  % (20339)------------------------------
% 1.43/0.56  % (20339)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.56  % (20332)Refutation found. Thanks to Tanya!
% 1.43/0.56  % SZS status Theorem for theBenchmark
% 1.43/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 1.43/0.56  % (20332)------------------------------
% 1.43/0.56  % (20332)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.56  % (20332)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.56  % (20332)Termination reason: Refutation
% 1.43/0.56  
% 1.43/0.56  % (20332)Memory used [KB]: 1663
% 1.43/0.56  % (20332)Time elapsed: 0.138 s
% 1.43/0.56  % (20332)Instructions burned: 11 (million)
% 1.43/0.56  % (20332)------------------------------
% 1.43/0.56  % (20332)------------------------------
% 1.43/0.56  % (20326)Success in time 0.202 s
%------------------------------------------------------------------------------