TSTP Solution File: SWW672_2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWW672_2 : TPTP v8.1.0. Released v6.1.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 : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 19:20:56 EDT 2022

% Result   : Theorem 4.41s 1.40s
% Output   : Refutation 4.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   91
% Syntax   : Number of formulae    :  135 (  12 unt;  75 typ;   0 def)
%            Number of atoms       :  635 ( 214 equ)
%            Maximal formula atoms :   60 (  10 avg)
%            Number of connectives :  776 ( 201   ~; 118   |; 354   &)
%                                         (  18 <=>;  85  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (  12 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number arithmetic     :  110 (  12 atm;  26 fun;  38 num;  34 var)
%            Number of types       :    8 (   6 usr;   1 ari)
%            Number of type conns  :  107 (  44   >;  63   *;   0   +;   0  <<)
%            Number of predicates  :   17 (  13 usr;   3 prp; 0-6 aty)
%            Number of functors    :   61 (  58 usr;  27 con; 0-4 aty)
%            Number of variables   :  382 ( 197   !; 185   ?; 382   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    uni: $tType ).

tff(type_def_6,type,
    ty: $tType ).

tff(type_def_7,type,
    bool1: $tType ).

tff(type_def_8,type,
    tuple02: $tType ).

tff(type_def_9,type,
    vertex1: $tType ).

tff(type_def_10,type,
    set_vertex: $tType ).

tff(func_def_0,type,
    witness1: ty > uni ).

tff(func_def_1,type,
    int: ty ).

tff(func_def_2,type,
    real: ty ).

tff(func_def_3,type,
    bool: ty ).

tff(func_def_4,type,
    true1: bool1 ).

tff(func_def_5,type,
    false1: bool1 ).

tff(func_def_6,type,
    match_bool1: ( ty * bool1 * uni * uni ) > uni ).

tff(func_def_7,type,
    tuple0: ty ).

tff(func_def_8,type,
    tuple03: tuple02 ).

tff(func_def_9,type,
    qtmark: ty ).

tff(func_def_12,type,
    set: ty > ty ).

tff(func_def_13,type,
    empty: ty > uni ).

tff(func_def_14,type,
    add: ( ty * uni * uni ) > uni ).

tff(func_def_15,type,
    remove: ( ty * uni * uni ) > uni ).

tff(func_def_16,type,
    union: ( ty * uni * uni ) > uni ).

tff(func_def_17,type,
    inter: ( ty * uni * uni ) > uni ).

tff(func_def_18,type,
    diff: ( ty * uni * uni ) > uni ).

tff(func_def_19,type,
    choose: ( ty * uni ) > uni ).

tff(func_def_20,type,
    cardinal1: ( ty * uni ) > $int ).

tff(func_def_23,type,
    vertex: ty ).

tff(func_def_24,type,
    succ1: vertex1 > set_vertex ).

tff(func_def_25,type,
    t2tb: set_vertex > uni ).

tff(func_def_26,type,
    tb2t: uni > set_vertex ).

tff(func_def_27,type,
    t2tb1: vertex1 > uni ).

tff(func_def_28,type,
    tb2t1: uni > vertex1 ).

tff(func_def_29,type,
    ref: ty > ty ).

tff(func_def_30,type,
    mk_ref: ( ty * uni ) > uni ).

tff(func_def_31,type,
    contents: ( ty * uni ) > uni ).

tff(func_def_33,type,
    sK2: set_vertex ).

tff(func_def_34,type,
    sK3: set_vertex ).

tff(func_def_35,type,
    sK4: vertex1 ).

tff(func_def_36,type,
    sK5: $int ).

tff(func_def_37,type,
    sK6: vertex1 ).

tff(func_def_38,type,
    sK7: set_vertex ).

tff(func_def_39,type,
    sK8: bool1 ).

tff(func_def_40,type,
    sK9: vertex1 ).

tff(func_def_41,type,
    sK10: set_vertex ).

tff(func_def_42,type,
    sK11: set_vertex ).

tff(func_def_43,type,
    sK12: set_vertex ).

tff(func_def_44,type,
    sK13: bool1 ).

tff(func_def_45,type,
    sK14: set_vertex ).

tff(func_def_46,type,
    sK15: set_vertex ).

tff(func_def_47,type,
    sK16: $int ).

tff(func_def_48,type,
    sK17: vertex1 ).

tff(func_def_49,type,
    sK18: ( set_vertex * vertex1 ) > vertex1 ).

tff(func_def_50,type,
    sK19: ( uni * ty ) > uni ).

tff(func_def_51,type,
    sK20: ( $int * vertex1 * vertex1 ) > $int ).

tff(func_def_52,type,
    sK21: ( uni * uni * ty ) > uni ).

tff(func_def_53,type,
    sK22: ( uni * ty * uni ) > uni ).

tff(func_def_54,type,
    sK23: ( vertex1 * vertex1 * $int ) > $int ).

tff(func_def_55,type,
    sK24: ( $int * vertex1 * vertex1 ) > vertex1 ).

tff(func_def_56,type,
    sK25: set_vertex > vertex1 ).

tff(func_def_57,type,
    sK26: set_vertex > vertex1 ).

tff(func_def_58,type,
    sK27: ( $int * vertex1 * vertex1 ) > vertex1 ).

tff(func_def_59,type,
    sK28: ( $int * vertex1 * vertex1 ) > vertex1 ).

tff(func_def_60,type,
    sK29: ( $int * vertex1 * vertex1 ) > $int ).

tff(func_def_61,type,
    sK30: ( $int * vertex1 * vertex1 ) > vertex1 ).

tff(func_def_62,type,
    sK31: ( $int * vertex1 * vertex1 ) > vertex1 ).

tff(pred_def_1,type,
    sort1: ( ty * uni ) > $o ).

tff(pred_def_3,type,
    mem: ( ty * uni * uni ) > $o ).

tff(pred_def_4,type,
    infix_eqeq: ( ty * uni * uni ) > $o ).

tff(pred_def_5,type,
    subset: ( ty * uni * uni ) > $o ).

tff(pred_def_6,type,
    is_empty: ( ty * uni ) > $o ).

tff(pred_def_7,type,
    path1: ( vertex1 * vertex1 * $int ) > $o ).

tff(pred_def_8,type,
    shortest_path1: ( vertex1 * vertex1 * $int ) > $o ).

tff(pred_def_10,type,
    inv1: ( vertex1 * vertex1 * set_vertex * set_vertex * set_vertex * $int ) > $o ).

tff(pred_def_11,type,
    closure1: ( set_vertex * set_vertex * set_vertex * vertex1 ) > $o ).

tff(pred_def_12,type,
    sP0: ( $int * vertex1 * set_vertex ) > $o ).

tff(pred_def_13,type,
    sP1: ( $int * vertex1 * vertex1 ) > $o ).

tff(f792,plain,
    $false,
    inference(avatar_sat_refutation,[],[f430,f433,f791]) ).

tff(f791,plain,
    ~ spl32_3,
    inference(avatar_contradiction_clause,[],[f790]) ).

tff(f790,plain,
    ( $false
    | ~ spl32_3 ),
    inference(subsumption_resolution,[],[f774,f537]) ).

tff(f537,plain,
    mem(vertex,t2tb1(sK18(sK12,sK17)),t2tb(succ1(sK17))),
    inference(unit_resulting_resolution,[],[f439,f313]) ).

tff(f313,plain,
    ! [X2: vertex1,X3: set_vertex,X0: set_vertex,X1: set_vertex] :
      ( closure1(X1,X0,X3,X2)
      | mem(vertex,t2tb1(sK18(X1,X2)),t2tb(succ1(X2))) ),
    inference(cnf_transformation,[],[f209]) ).

tff(f209,plain,
    ! [X0: set_vertex,X1: set_vertex,X2: vertex1,X3: set_vertex] :
      ( ( mem(vertex,t2tb1(X2),t2tb(X3))
        | ~ mem(vertex,t2tb1(X2),t2tb(X1))
        | mem(vertex,t2tb1(X2),t2tb(X0))
        | ! [X4: vertex1] :
            ( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X2)))
            | mem(vertex,t2tb1(X4),t2tb(X1)) )
        | ~ closure1(X1,X0,X3,X2) )
      & ( closure1(X1,X0,X3,X2)
        | ( ~ mem(vertex,t2tb1(X2),t2tb(X3))
          & mem(vertex,t2tb1(X2),t2tb(X1))
          & ~ mem(vertex,t2tb1(X2),t2tb(X0))
          & mem(vertex,t2tb1(sK18(X1,X2)),t2tb(succ1(X2)))
          & ~ mem(vertex,t2tb1(sK18(X1,X2)),t2tb(X1)) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18])],[f207,f208]) ).

tff(f208,plain,
    ! [X1: set_vertex,X2: vertex1] :
      ( ? [X5: vertex1] :
          ( mem(vertex,t2tb1(X5),t2tb(succ1(X2)))
          & ~ mem(vertex,t2tb1(X5),t2tb(X1)) )
     => ( mem(vertex,t2tb1(sK18(X1,X2)),t2tb(succ1(X2)))
        & ~ mem(vertex,t2tb1(sK18(X1,X2)),t2tb(X1)) ) ),
    introduced(choice_axiom,[]) ).

tff(f207,plain,
    ! [X0: set_vertex,X1: set_vertex,X2: vertex1,X3: set_vertex] :
      ( ( mem(vertex,t2tb1(X2),t2tb(X3))
        | ~ mem(vertex,t2tb1(X2),t2tb(X1))
        | mem(vertex,t2tb1(X2),t2tb(X0))
        | ! [X4: vertex1] :
            ( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X2)))
            | mem(vertex,t2tb1(X4),t2tb(X1)) )
        | ~ closure1(X1,X0,X3,X2) )
      & ( closure1(X1,X0,X3,X2)
        | ( ~ mem(vertex,t2tb1(X2),t2tb(X3))
          & mem(vertex,t2tb1(X2),t2tb(X1))
          & ~ mem(vertex,t2tb1(X2),t2tb(X0))
          & ? [X5: vertex1] :
              ( mem(vertex,t2tb1(X5),t2tb(succ1(X2)))
              & ~ mem(vertex,t2tb1(X5),t2tb(X1)) ) ) ) ),
    inference(rectify,[],[f206]) ).

tff(f206,plain,
    ! [X1: set_vertex,X2: set_vertex,X0: vertex1,X3: set_vertex] :
      ( ( mem(vertex,t2tb1(X0),t2tb(X3))
        | ~ mem(vertex,t2tb1(X0),t2tb(X2))
        | mem(vertex,t2tb1(X0),t2tb(X1))
        | ! [X4: vertex1] :
            ( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
            | mem(vertex,t2tb1(X4),t2tb(X2)) )
        | ~ closure1(X2,X1,X3,X0) )
      & ( closure1(X2,X1,X3,X0)
        | ( ~ mem(vertex,t2tb1(X0),t2tb(X3))
          & mem(vertex,t2tb1(X0),t2tb(X2))
          & ~ mem(vertex,t2tb1(X0),t2tb(X1))
          & ? [X4: vertex1] :
              ( mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
              & ~ mem(vertex,t2tb1(X4),t2tb(X2)) ) ) ) ),
    inference(flattening,[],[f205]) ).

tff(f205,plain,
    ! [X1: set_vertex,X2: set_vertex,X0: vertex1,X3: set_vertex] :
      ( ( mem(vertex,t2tb1(X0),t2tb(X3))
        | ~ mem(vertex,t2tb1(X0),t2tb(X2))
        | mem(vertex,t2tb1(X0),t2tb(X1))
        | ! [X4: vertex1] :
            ( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
            | mem(vertex,t2tb1(X4),t2tb(X2)) )
        | ~ closure1(X2,X1,X3,X0) )
      & ( closure1(X2,X1,X3,X0)
        | ( ~ mem(vertex,t2tb1(X0),t2tb(X3))
          & mem(vertex,t2tb1(X0),t2tb(X2))
          & ~ mem(vertex,t2tb1(X0),t2tb(X1))
          & ? [X4: vertex1] :
              ( mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
              & ~ mem(vertex,t2tb1(X4),t2tb(X2)) ) ) ) ),
    inference(nnf_transformation,[],[f158]) ).

tff(f158,plain,
    ! [X1: set_vertex,X2: set_vertex,X0: vertex1,X3: set_vertex] :
      ( ( mem(vertex,t2tb1(X0),t2tb(X3))
        | ~ mem(vertex,t2tb1(X0),t2tb(X2))
        | mem(vertex,t2tb1(X0),t2tb(X1))
        | ! [X4: vertex1] :
            ( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
            | mem(vertex,t2tb1(X4),t2tb(X2)) ) )
    <=> closure1(X2,X1,X3,X0) ),
    inference(flattening,[],[f157]) ).

tff(f157,plain,
    ! [X3: set_vertex,X1: set_vertex,X0: vertex1,X2: set_vertex] :
      ( closure1(X2,X1,X3,X0)
    <=> ( ! [X4: vertex1] :
            ( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
            | mem(vertex,t2tb1(X4),t2tb(X2)) )
        | mem(vertex,t2tb1(X0),t2tb(X3))
        | mem(vertex,t2tb1(X0),t2tb(X1))
        | ~ mem(vertex,t2tb1(X0),t2tb(X2)) ) ),
    inference(ennf_transformation,[],[f86]) ).

tff(f86,plain,
    ! [X3: set_vertex,X1: set_vertex,X0: vertex1,X2: set_vertex] :
      ( closure1(X2,X1,X3,X0)
    <=> ( mem(vertex,t2tb1(X0),t2tb(X2))
       => ( ~ mem(vertex,t2tb1(X0),t2tb(X1))
         => ( ~ mem(vertex,t2tb1(X0),t2tb(X3))
           => ! [X4: vertex1] :
                ( mem(vertex,t2tb1(X4),t2tb(succ1(X0)))
               => mem(vertex,t2tb1(X4),t2tb(X2)) ) ) ) ) ),
    inference(rectify,[],[f58]) ).

tff(f58,axiom,
    ! [X1: vertex1,X23: set_vertex,X22: set_vertex,X24: set_vertex] :
      ( closure1(X22,X23,X24,X1)
    <=> ( mem(vertex,t2tb1(X1),t2tb(X22))
       => ( ~ mem(vertex,t2tb1(X1),t2tb(X23))
         => ( ~ mem(vertex,t2tb1(X1),t2tb(X24))
           => ! [X7: vertex1] :
                ( mem(vertex,t2tb1(X7),t2tb(succ1(X1)))
               => mem(vertex,t2tb1(X7),t2tb(X22)) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_def) ).

tff(f439,plain,
    ~ closure1(sK12,sK11,sK15,sK17),
    inference(forward_demodulation,[],[f287,f286]) ).

tff(f286,plain,
    sK14 = sK11,
    inference(cnf_transformation,[],[f201]) ).

tff(f201,plain,
    ( ~ $less(sK5,0)
    & ( ( true1 = sK8 )
      | ~ is_empty(vertex,t2tb(sK3)) )
    & ( is_empty(vertex,t2tb(sK3))
      | ( true1 != sK8 ) )
    & ! [X9: vertex1] :
        ( closure1(sK2,sK10,sK7,X9)
        | ( sK9 = X9 ) )
    & inv1(sK6,sK4,sK2,sK10,sK7,sK5)
    & shortest_path1(sK6,sK9,sK5)
    & ( sK10 = tb2t(remove(vertex,t2tb1(sK9),t2tb(sK3))) )
    & ! [X12: vertex1] : closure1(sK12,sK10,sK11,X12)
    & subset(vertex,t2tb(succ1(sK9)),t2tb(sK12))
    & inv1(sK6,sK4,sK12,sK10,sK11,sK5)
    & ( true1 = sK13 )
    & ( tb2t(empty(vertex)) = sK15 )
    & ( sK16 = $sum(sK5,1) )
    & ~ closure1(sK12,sK14,sK15,sK17)
    & ( sK14 = sK11 )
    & ( ( true1 = sK13 )
      | ~ is_empty(vertex,t2tb(sK10)) )
    & ( is_empty(vertex,t2tb(sK10))
      | ( true1 != sK13 ) )
    & mem(vertex,t2tb1(sK9),t2tb(sK3))
    & ( sK4 != sK9 )
    & ~ is_empty(vertex,t2tb(sK3))
    & ( true1 != sK8 )
    & ! [X18: vertex1] : closure1(sK2,sK3,sK7,X18)
    & inv1(sK6,sK4,sK2,sK3,sK7,sK5)
    & ( is_empty(vertex,t2tb(sK7))
      | ~ is_empty(vertex,t2tb(sK3)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17])],[f191,f200,f199,f198,f197,f196,f195,f194,f193,f192]) ).

tff(f192,plain,
    ( ? [X0: set_vertex,X1: set_vertex,X2: vertex1,X3: $int,X4: vertex1,X5: set_vertex] :
        ( ~ $less(X3,0)
        & ? [X6: bool1] :
            ( ( ( true1 = X6 )
              | ~ is_empty(vertex,t2tb(X1)) )
            & ( is_empty(vertex,t2tb(X1))
              | ( true1 != X6 ) )
            & ? [X7: vertex1,X8: set_vertex] :
                ( ! [X9: vertex1] :
                    ( closure1(X0,X8,X5,X9)
                    | ( X7 = X9 ) )
                & inv1(X4,X2,X0,X8,X5,X3)
                & shortest_path1(X4,X7,X3)
                & ( tb2t(remove(vertex,t2tb1(X7),t2tb(X1))) = X8 )
                & ? [X10: set_vertex,X11: set_vertex] :
                    ( ! [X12: vertex1] : closure1(X11,X8,X10,X12)
                    & subset(vertex,t2tb(succ1(X7)),t2tb(X11))
                    & inv1(X4,X2,X11,X8,X10,X3)
                    & ? [X13: bool1] :
                        ( ( true1 = X13 )
                        & ? [X14: set_vertex] :
                            ( ? [X15: set_vertex] :
                                ( ( tb2t(empty(vertex)) = X15 )
                                & ? [X16: $int] :
                                    ( ( $sum(X3,1) = X16 )
                                    & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                            & ( X10 = X14 ) )
                        & ( ( true1 = X13 )
                          | ~ is_empty(vertex,t2tb(X8)) )
                        & ( is_empty(vertex,t2tb(X8))
                          | ( true1 != X13 ) ) ) )
                & mem(vertex,t2tb1(X7),t2tb(X1))
                & ( X2 != X7 ) )
            & ~ is_empty(vertex,t2tb(X1))
            & ( true1 != X6 ) )
        & ! [X18: vertex1] : closure1(X0,X1,X5,X18)
        & inv1(X4,X2,X0,X1,X5,X3)
        & ( is_empty(vertex,t2tb(X5))
          | ~ is_empty(vertex,t2tb(X1)) ) )
   => ( ~ $less(sK5,0)
      & ? [X6: bool1] :
          ( ( ( true1 = X6 )
            | ~ is_empty(vertex,t2tb(sK3)) )
          & ( is_empty(vertex,t2tb(sK3))
            | ( true1 != X6 ) )
          & ? [X8: set_vertex,X7: vertex1] :
              ( ! [X9: vertex1] :
                  ( closure1(sK2,X8,sK7,X9)
                  | ( X7 = X9 ) )
              & inv1(sK6,sK4,sK2,X8,sK7,sK5)
              & shortest_path1(sK6,X7,sK5)
              & ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK3))) = X8 )
              & ? [X11: set_vertex,X10: set_vertex] :
                  ( ! [X12: vertex1] : closure1(X11,X8,X10,X12)
                  & subset(vertex,t2tb(succ1(X7)),t2tb(X11))
                  & inv1(sK6,sK4,X11,X8,X10,sK5)
                  & ? [X13: bool1] :
                      ( ( true1 = X13 )
                      & ? [X14: set_vertex] :
                          ( ? [X15: set_vertex] :
                              ( ( tb2t(empty(vertex)) = X15 )
                              & ? [X16: $int] :
                                  ( ( $sum(sK5,1) = X16 )
                                  & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                          & ( X10 = X14 ) )
                      & ( ( true1 = X13 )
                        | ~ is_empty(vertex,t2tb(X8)) )
                      & ( is_empty(vertex,t2tb(X8))
                        | ( true1 != X13 ) ) ) )
              & mem(vertex,t2tb1(X7),t2tb(sK3))
              & ( sK4 != X7 ) )
          & ~ is_empty(vertex,t2tb(sK3))
          & ( true1 != X6 ) )
      & ! [X18: vertex1] : closure1(sK2,sK3,sK7,X18)
      & inv1(sK6,sK4,sK2,sK3,sK7,sK5)
      & ( is_empty(vertex,t2tb(sK7))
        | ~ is_empty(vertex,t2tb(sK3)) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f193,plain,
    ( ? [X6: bool1] :
        ( ( ( true1 = X6 )
          | ~ is_empty(vertex,t2tb(sK3)) )
        & ( is_empty(vertex,t2tb(sK3))
          | ( true1 != X6 ) )
        & ? [X8: set_vertex,X7: vertex1] :
            ( ! [X9: vertex1] :
                ( closure1(sK2,X8,sK7,X9)
                | ( X7 = X9 ) )
            & inv1(sK6,sK4,sK2,X8,sK7,sK5)
            & shortest_path1(sK6,X7,sK5)
            & ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK3))) = X8 )
            & ? [X11: set_vertex,X10: set_vertex] :
                ( ! [X12: vertex1] : closure1(X11,X8,X10,X12)
                & subset(vertex,t2tb(succ1(X7)),t2tb(X11))
                & inv1(sK6,sK4,X11,X8,X10,sK5)
                & ? [X13: bool1] :
                    ( ( true1 = X13 )
                    & ? [X14: set_vertex] :
                        ( ? [X15: set_vertex] :
                            ( ( tb2t(empty(vertex)) = X15 )
                            & ? [X16: $int] :
                                ( ( $sum(sK5,1) = X16 )
                                & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                        & ( X10 = X14 ) )
                    & ( ( true1 = X13 )
                      | ~ is_empty(vertex,t2tb(X8)) )
                    & ( is_empty(vertex,t2tb(X8))
                      | ( true1 != X13 ) ) ) )
            & mem(vertex,t2tb1(X7),t2tb(sK3))
            & ( sK4 != X7 ) )
        & ~ is_empty(vertex,t2tb(sK3))
        & ( true1 != X6 ) )
   => ( ( ( true1 = sK8 )
        | ~ is_empty(vertex,t2tb(sK3)) )
      & ( is_empty(vertex,t2tb(sK3))
        | ( true1 != sK8 ) )
      & ? [X8: set_vertex,X7: vertex1] :
          ( ! [X9: vertex1] :
              ( closure1(sK2,X8,sK7,X9)
              | ( X7 = X9 ) )
          & inv1(sK6,sK4,sK2,X8,sK7,sK5)
          & shortest_path1(sK6,X7,sK5)
          & ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK3))) = X8 )
          & ? [X11: set_vertex,X10: set_vertex] :
              ( ! [X12: vertex1] : closure1(X11,X8,X10,X12)
              & subset(vertex,t2tb(succ1(X7)),t2tb(X11))
              & inv1(sK6,sK4,X11,X8,X10,sK5)
              & ? [X13: bool1] :
                  ( ( true1 = X13 )
                  & ? [X14: set_vertex] :
                      ( ? [X15: set_vertex] :
                          ( ( tb2t(empty(vertex)) = X15 )
                          & ? [X16: $int] :
                              ( ( $sum(sK5,1) = X16 )
                              & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                      & ( X10 = X14 ) )
                  & ( ( true1 = X13 )
                    | ~ is_empty(vertex,t2tb(X8)) )
                  & ( is_empty(vertex,t2tb(X8))
                    | ( true1 != X13 ) ) ) )
          & mem(vertex,t2tb1(X7),t2tb(sK3))
          & ( sK4 != X7 ) )
      & ~ is_empty(vertex,t2tb(sK3))
      & ( true1 != sK8 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f194,plain,
    ( ? [X8: set_vertex,X7: vertex1] :
        ( ! [X9: vertex1] :
            ( closure1(sK2,X8,sK7,X9)
            | ( X7 = X9 ) )
        & inv1(sK6,sK4,sK2,X8,sK7,sK5)
        & shortest_path1(sK6,X7,sK5)
        & ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK3))) = X8 )
        & ? [X11: set_vertex,X10: set_vertex] :
            ( ! [X12: vertex1] : closure1(X11,X8,X10,X12)
            & subset(vertex,t2tb(succ1(X7)),t2tb(X11))
            & inv1(sK6,sK4,X11,X8,X10,sK5)
            & ? [X13: bool1] :
                ( ( true1 = X13 )
                & ? [X14: set_vertex] :
                    ( ? [X15: set_vertex] :
                        ( ( tb2t(empty(vertex)) = X15 )
                        & ? [X16: $int] :
                            ( ( $sum(sK5,1) = X16 )
                            & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                    & ( X10 = X14 ) )
                & ( ( true1 = X13 )
                  | ~ is_empty(vertex,t2tb(X8)) )
                & ( is_empty(vertex,t2tb(X8))
                  | ( true1 != X13 ) ) ) )
        & mem(vertex,t2tb1(X7),t2tb(sK3))
        & ( sK4 != X7 ) )
   => ( ! [X9: vertex1] :
          ( closure1(sK2,sK10,sK7,X9)
          | ( sK9 = X9 ) )
      & inv1(sK6,sK4,sK2,sK10,sK7,sK5)
      & shortest_path1(sK6,sK9,sK5)
      & ( sK10 = tb2t(remove(vertex,t2tb1(sK9),t2tb(sK3))) )
      & ? [X11: set_vertex,X10: set_vertex] :
          ( ! [X12: vertex1] : closure1(X11,sK10,X10,X12)
          & subset(vertex,t2tb(succ1(sK9)),t2tb(X11))
          & inv1(sK6,sK4,X11,sK10,X10,sK5)
          & ? [X13: bool1] :
              ( ( true1 = X13 )
              & ? [X14: set_vertex] :
                  ( ? [X15: set_vertex] :
                      ( ( tb2t(empty(vertex)) = X15 )
                      & ? [X16: $int] :
                          ( ( $sum(sK5,1) = X16 )
                          & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                  & ( X10 = X14 ) )
              & ( ( true1 = X13 )
                | ~ is_empty(vertex,t2tb(sK10)) )
              & ( is_empty(vertex,t2tb(sK10))
                | ( true1 != X13 ) ) ) )
      & mem(vertex,t2tb1(sK9),t2tb(sK3))
      & ( sK4 != sK9 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f195,plain,
    ( ? [X11: set_vertex,X10: set_vertex] :
        ( ! [X12: vertex1] : closure1(X11,sK10,X10,X12)
        & subset(vertex,t2tb(succ1(sK9)),t2tb(X11))
        & inv1(sK6,sK4,X11,sK10,X10,sK5)
        & ? [X13: bool1] :
            ( ( true1 = X13 )
            & ? [X14: set_vertex] :
                ( ? [X15: set_vertex] :
                    ( ( tb2t(empty(vertex)) = X15 )
                    & ? [X16: $int] :
                        ( ( $sum(sK5,1) = X16 )
                        & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                & ( X10 = X14 ) )
            & ( ( true1 = X13 )
              | ~ is_empty(vertex,t2tb(sK10)) )
            & ( is_empty(vertex,t2tb(sK10))
              | ( true1 != X13 ) ) ) )
   => ( ! [X12: vertex1] : closure1(sK12,sK10,sK11,X12)
      & subset(vertex,t2tb(succ1(sK9)),t2tb(sK12))
      & inv1(sK6,sK4,sK12,sK10,sK11,sK5)
      & ? [X13: bool1] :
          ( ( true1 = X13 )
          & ? [X14: set_vertex] :
              ( ? [X15: set_vertex] :
                  ( ( tb2t(empty(vertex)) = X15 )
                  & ? [X16: $int] :
                      ( ( $sum(sK5,1) = X16 )
                      & ? [X17: vertex1] : ~ closure1(sK12,X14,X15,X17) ) )
              & ( sK11 = X14 ) )
          & ( ( true1 = X13 )
            | ~ is_empty(vertex,t2tb(sK10)) )
          & ( is_empty(vertex,t2tb(sK10))
            | ( true1 != X13 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f196,plain,
    ( ? [X13: bool1] :
        ( ( true1 = X13 )
        & ? [X14: set_vertex] :
            ( ? [X15: set_vertex] :
                ( ( tb2t(empty(vertex)) = X15 )
                & ? [X16: $int] :
                    ( ( $sum(sK5,1) = X16 )
                    & ? [X17: vertex1] : ~ closure1(sK12,X14,X15,X17) ) )
            & ( sK11 = X14 ) )
        & ( ( true1 = X13 )
          | ~ is_empty(vertex,t2tb(sK10)) )
        & ( is_empty(vertex,t2tb(sK10))
          | ( true1 != X13 ) ) )
   => ( ( true1 = sK13 )
      & ? [X14: set_vertex] :
          ( ? [X15: set_vertex] :
              ( ( tb2t(empty(vertex)) = X15 )
              & ? [X16: $int] :
                  ( ( $sum(sK5,1) = X16 )
                  & ? [X17: vertex1] : ~ closure1(sK12,X14,X15,X17) ) )
          & ( sK11 = X14 ) )
      & ( ( true1 = sK13 )
        | ~ is_empty(vertex,t2tb(sK10)) )
      & ( is_empty(vertex,t2tb(sK10))
        | ( true1 != sK13 ) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f197,plain,
    ( ? [X14: set_vertex] :
        ( ? [X15: set_vertex] :
            ( ( tb2t(empty(vertex)) = X15 )
            & ? [X16: $int] :
                ( ( $sum(sK5,1) = X16 )
                & ? [X17: vertex1] : ~ closure1(sK12,X14,X15,X17) ) )
        & ( sK11 = X14 ) )
   => ( ? [X15: set_vertex] :
          ( ( tb2t(empty(vertex)) = X15 )
          & ? [X16: $int] :
              ( ( $sum(sK5,1) = X16 )
              & ? [X17: vertex1] : ~ closure1(sK12,sK14,X15,X17) ) )
      & ( sK14 = sK11 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f198,plain,
    ( ? [X15: set_vertex] :
        ( ( tb2t(empty(vertex)) = X15 )
        & ? [X16: $int] :
            ( ( $sum(sK5,1) = X16 )
            & ? [X17: vertex1] : ~ closure1(sK12,sK14,X15,X17) ) )
   => ( ( tb2t(empty(vertex)) = sK15 )
      & ? [X16: $int] :
          ( ( $sum(sK5,1) = X16 )
          & ? [X17: vertex1] : ~ closure1(sK12,sK14,sK15,X17) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f199,plain,
    ( ? [X16: $int] :
        ( ( $sum(sK5,1) = X16 )
        & ? [X17: vertex1] : ~ closure1(sK12,sK14,sK15,X17) )
   => ( ( sK16 = $sum(sK5,1) )
      & ? [X17: vertex1] : ~ closure1(sK12,sK14,sK15,X17) ) ),
    introduced(choice_axiom,[]) ).

tff(f200,plain,
    ( ? [X17: vertex1] : ~ closure1(sK12,sK14,sK15,X17)
   => ~ closure1(sK12,sK14,sK15,sK17) ),
    introduced(choice_axiom,[]) ).

tff(f191,plain,
    ? [X0: set_vertex,X1: set_vertex,X2: vertex1,X3: $int,X4: vertex1,X5: set_vertex] :
      ( ~ $less(X3,0)
      & ? [X6: bool1] :
          ( ( ( true1 = X6 )
            | ~ is_empty(vertex,t2tb(X1)) )
          & ( is_empty(vertex,t2tb(X1))
            | ( true1 != X6 ) )
          & ? [X7: vertex1,X8: set_vertex] :
              ( ! [X9: vertex1] :
                  ( closure1(X0,X8,X5,X9)
                  | ( X7 = X9 ) )
              & inv1(X4,X2,X0,X8,X5,X3)
              & shortest_path1(X4,X7,X3)
              & ( tb2t(remove(vertex,t2tb1(X7),t2tb(X1))) = X8 )
              & ? [X10: set_vertex,X11: set_vertex] :
                  ( ! [X12: vertex1] : closure1(X11,X8,X10,X12)
                  & subset(vertex,t2tb(succ1(X7)),t2tb(X11))
                  & inv1(X4,X2,X11,X8,X10,X3)
                  & ? [X13: bool1] :
                      ( ( true1 = X13 )
                      & ? [X14: set_vertex] :
                          ( ? [X15: set_vertex] :
                              ( ( tb2t(empty(vertex)) = X15 )
                              & ? [X16: $int] :
                                  ( ( $sum(X3,1) = X16 )
                                  & ? [X17: vertex1] : ~ closure1(X11,X14,X15,X17) ) )
                          & ( X10 = X14 ) )
                      & ( ( true1 = X13 )
                        | ~ is_empty(vertex,t2tb(X8)) )
                      & ( is_empty(vertex,t2tb(X8))
                        | ( true1 != X13 ) ) ) )
              & mem(vertex,t2tb1(X7),t2tb(X1))
              & ( X2 != X7 ) )
          & ~ is_empty(vertex,t2tb(X1))
          & ( true1 != X6 ) )
      & ! [X18: vertex1] : closure1(X0,X1,X5,X18)
      & inv1(X4,X2,X0,X1,X5,X3)
      & ( is_empty(vertex,t2tb(X5))
        | ~ is_empty(vertex,t2tb(X1)) ) ),
    inference(rectify,[],[f190]) ).

tff(f190,plain,
    ? [X5: set_vertex,X1: set_vertex,X4: vertex1,X0: $int,X2: vertex1,X3: set_vertex] :
      ( ~ $less(X0,0)
      & ? [X7: bool1] :
          ( ( ( true1 = X7 )
            | ~ is_empty(vertex,t2tb(X1)) )
          & ( is_empty(vertex,t2tb(X1))
            | ( true1 != X7 ) )
          & ? [X8: vertex1,X9: set_vertex] :
              ( ! [X10: vertex1] :
                  ( closure1(X5,X9,X3,X10)
                  | ( X8 = X10 ) )
              & inv1(X2,X4,X5,X9,X3,X0)
              & shortest_path1(X2,X8,X0)
              & ( tb2t(remove(vertex,t2tb1(X8),t2tb(X1))) = X9 )
              & ? [X11: set_vertex,X12: set_vertex] :
                  ( ! [X13: vertex1] : closure1(X12,X9,X11,X13)
                  & subset(vertex,t2tb(succ1(X8)),t2tb(X12))
                  & inv1(X2,X4,X12,X9,X11,X0)
                  & ? [X14: bool1] :
                      ( ( true1 = X14 )
                      & ? [X15: set_vertex] :
                          ( ? [X16: set_vertex] :
                              ( ( tb2t(empty(vertex)) = X16 )
                              & ? [X17: $int] :
                                  ( ( $sum(X0,1) = X17 )
                                  & ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18) ) )
                          & ( X11 = X15 ) )
                      & ( ( true1 = X14 )
                        | ~ is_empty(vertex,t2tb(X9)) )
                      & ( is_empty(vertex,t2tb(X9))
                        | ( true1 != X14 ) ) ) )
              & mem(vertex,t2tb1(X8),t2tb(X1))
              & ( X4 != X8 ) )
          & ~ is_empty(vertex,t2tb(X1))
          & ( true1 != X7 ) )
      & ! [X6: vertex1] : closure1(X5,X1,X3,X6)
      & inv1(X2,X4,X5,X1,X3,X0)
      & ( is_empty(vertex,t2tb(X3))
        | ~ is_empty(vertex,t2tb(X1)) ) ),
    inference(flattening,[],[f189]) ).

tff(f189,plain,
    ? [X5: set_vertex,X1: set_vertex,X4: vertex1,X0: $int,X2: vertex1,X3: set_vertex] :
      ( ~ $less(X0,0)
      & ? [X7: bool1] :
          ( ( ( true1 = X7 )
            | ~ is_empty(vertex,t2tb(X1)) )
          & ( is_empty(vertex,t2tb(X1))
            | ( true1 != X7 ) )
          & ? [X8: vertex1,X9: set_vertex] :
              ( ! [X10: vertex1] :
                  ( closure1(X5,X9,X3,X10)
                  | ( X8 = X10 ) )
              & inv1(X2,X4,X5,X9,X3,X0)
              & shortest_path1(X2,X8,X0)
              & ( tb2t(remove(vertex,t2tb1(X8),t2tb(X1))) = X9 )
              & ? [X11: set_vertex,X12: set_vertex] :
                  ( ! [X13: vertex1] : closure1(X12,X9,X11,X13)
                  & subset(vertex,t2tb(succ1(X8)),t2tb(X12))
                  & inv1(X2,X4,X12,X9,X11,X0)
                  & ? [X14: bool1] :
                      ( ( true1 = X14 )
                      & ? [X15: set_vertex] :
                          ( ? [X16: set_vertex] :
                              ( ( tb2t(empty(vertex)) = X16 )
                              & ? [X17: $int] :
                                  ( ( $sum(X0,1) = X17 )
                                  & ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18) ) )
                          & ( X11 = X15 ) )
                      & ( ( true1 = X14 )
                        | ~ is_empty(vertex,t2tb(X9)) )
                      & ( is_empty(vertex,t2tb(X9))
                        | ( true1 != X14 ) ) ) )
              & mem(vertex,t2tb1(X8),t2tb(X1))
              & ( X4 != X8 ) )
          & ~ is_empty(vertex,t2tb(X1))
          & ( true1 != X7 ) )
      & ! [X6: vertex1] : closure1(X5,X1,X3,X6)
      & inv1(X2,X4,X5,X1,X3,X0)
      & ( is_empty(vertex,t2tb(X3))
        | ~ is_empty(vertex,t2tb(X1)) ) ),
    inference(nnf_transformation,[],[f177]) ).

tff(f177,plain,
    ? [X5: set_vertex,X1: set_vertex,X4: vertex1,X0: $int,X2: vertex1,X3: set_vertex] :
      ( ~ $less(X0,0)
      & ? [X7: bool1] :
          ( ( ( true1 = X7 )
          <=> is_empty(vertex,t2tb(X1)) )
          & ? [X8: vertex1,X9: set_vertex] :
              ( ! [X10: vertex1] :
                  ( closure1(X5,X9,X3,X10)
                  | ( X8 = X10 ) )
              & inv1(X2,X4,X5,X9,X3,X0)
              & shortest_path1(X2,X8,X0)
              & ( tb2t(remove(vertex,t2tb1(X8),t2tb(X1))) = X9 )
              & ? [X11: set_vertex,X12: set_vertex] :
                  ( ! [X13: vertex1] : closure1(X12,X9,X11,X13)
                  & subset(vertex,t2tb(succ1(X8)),t2tb(X12))
                  & inv1(X2,X4,X12,X9,X11,X0)
                  & ? [X14: bool1] :
                      ( ( true1 = X14 )
                      & ? [X15: set_vertex] :
                          ( ? [X16: set_vertex] :
                              ( ( tb2t(empty(vertex)) = X16 )
                              & ? [X17: $int] :
                                  ( ( $sum(X0,1) = X17 )
                                  & ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18) ) )
                          & ( X11 = X15 ) )
                      & ( ( true1 = X14 )
                      <=> is_empty(vertex,t2tb(X9)) ) ) )
              & mem(vertex,t2tb1(X8),t2tb(X1))
              & ( X4 != X8 ) )
          & ~ is_empty(vertex,t2tb(X1))
          & ( true1 != X7 ) )
      & ! [X6: vertex1] : closure1(X5,X1,X3,X6)
      & inv1(X2,X4,X5,X1,X3,X0)
      & ( is_empty(vertex,t2tb(X3))
        | ~ is_empty(vertex,t2tb(X1)) ) ),
    inference(flattening,[],[f176]) ).

tff(f176,plain,
    ? [X5: set_vertex,X4: vertex1,X2: vertex1,X0: $int,X1: set_vertex,X3: set_vertex] :
      ( ? [X7: bool1] :
          ( ? [X9: set_vertex,X8: vertex1] :
              ( ? [X12: set_vertex,X11: set_vertex] :
                  ( ? [X14: bool1] :
                      ( ? [X15: set_vertex] :
                          ( ? [X16: set_vertex] :
                              ( ( tb2t(empty(vertex)) = X16 )
                              & ? [X17: $int] :
                                  ( ( $sum(X0,1) = X17 )
                                  & ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18) ) )
                          & ( X11 = X15 ) )
                      & ( true1 = X14 )
                      & ( ( true1 = X14 )
                      <=> is_empty(vertex,t2tb(X9)) ) )
                  & subset(vertex,t2tb(succ1(X8)),t2tb(X12))
                  & inv1(X2,X4,X12,X9,X11,X0)
                  & ! [X13: vertex1] : closure1(X12,X9,X11,X13) )
              & inv1(X2,X4,X5,X9,X3,X0)
              & ! [X10: vertex1] :
                  ( closure1(X5,X9,X3,X10)
                  | ( X8 = X10 ) )
              & shortest_path1(X2,X8,X0)
              & ( X4 != X8 )
              & ( tb2t(remove(vertex,t2tb1(X8),t2tb(X1))) = X9 )
              & mem(vertex,t2tb1(X8),t2tb(X1)) )
          & ~ is_empty(vertex,t2tb(X1))
          & ( true1 != X7 )
          & ( ( true1 = X7 )
          <=> is_empty(vertex,t2tb(X1)) ) )
      & ~ $less(X0,0)
      & inv1(X2,X4,X5,X1,X3,X0)
      & ( is_empty(vertex,t2tb(X3))
        | ~ is_empty(vertex,t2tb(X1)) )
      & ! [X6: vertex1] : closure1(X5,X1,X3,X6) ),
    inference(ennf_transformation,[],[f96]) ).

tff(f96,plain,
    ~ ! [X5: set_vertex,X4: vertex1,X2: vertex1,X0: $int,X1: set_vertex,X3: set_vertex] :
        ( ( ~ $less(X0,0)
          & inv1(X2,X4,X5,X1,X3,X0)
          & ( is_empty(vertex,t2tb(X1))
           => is_empty(vertex,t2tb(X3)) )
          & ! [X6: vertex1] : closure1(X5,X1,X3,X6) )
       => ! [X7: bool1] :
            ( ( ( true1 = X7 )
            <=> is_empty(vertex,t2tb(X1)) )
           => ( ( true1 != X7 )
             => ( ~ is_empty(vertex,t2tb(X1))
               => ! [X9: set_vertex,X8: vertex1] :
                    ( ( ( tb2t(remove(vertex,t2tb1(X8),t2tb(X1))) = X9 )
                      & mem(vertex,t2tb1(X8),t2tb(X1)) )
                   => ( ( X4 != X8 )
                     => ( ( inv1(X2,X4,X5,X9,X3,X0)
                          & ! [X10: vertex1] :
                              ( ( X8 != X10 )
                             => closure1(X5,X9,X3,X10) )
                          & shortest_path1(X2,X8,X0) )
                       => ! [X12: set_vertex,X11: set_vertex] :
                            ( ( subset(vertex,t2tb(succ1(X8)),t2tb(X12))
                              & inv1(X2,X4,X12,X9,X11,X0)
                              & ! [X13: vertex1] : closure1(X12,X9,X11,X13) )
                           => ! [X14: bool1] :
                                ( ( ( true1 = X14 )
                                <=> is_empty(vertex,t2tb(X9)) )
                               => ( ( true1 = X14 )
                                 => ! [X15: set_vertex] :
                                      ( ( X11 = X15 )
                                     => ! [X16: set_vertex] :
                                          ( ( tb2t(empty(vertex)) = X16 )
                                         => ! [X17: $int] :
                                              ( ( $sum(X0,1) = X17 )
                                             => ! [X18: vertex1] : closure1(X12,X15,X16,X18) ) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(rectify,[],[f61]) ).

tff(f61,plain,
    ~ ! [X25: $int,X23: set_vertex,X10: vertex1,X24: set_vertex,X21: vertex1,X22: set_vertex] :
        ( ( ( is_empty(vertex,t2tb(X23))
           => is_empty(vertex,t2tb(X24)) )
          & inv1(X10,X21,X22,X23,X24,X25)
          & ! [X1: vertex1] : closure1(X22,X23,X24,X1)
          & ~ $less(X25,0) )
       => ! [X26: bool1] :
            ( ( ( true1 = X26 )
            <=> is_empty(vertex,t2tb(X23)) )
           => ( ( true1 != X26 )
             => ( ~ is_empty(vertex,t2tb(X23))
               => ! [X12: vertex1,X27: set_vertex] :
                    ( ( ( tb2t(remove(vertex,t2tb1(X12),t2tb(X23))) = X27 )
                      & mem(vertex,t2tb1(X12),t2tb(X23)) )
                   => ( ( X12 != X21 )
                     => ( ( ! [X1: vertex1] :
                              ( ( X1 != X12 )
                             => closure1(X22,X27,X24,X1) )
                          & inv1(X10,X21,X22,X27,X24,X25)
                          & shortest_path1(X10,X12,X25) )
                       => ! [X28: set_vertex,X29: set_vertex] :
                            ( ( subset(vertex,t2tb(succ1(X12)),t2tb(X29))
                              & ! [X1: vertex1] : closure1(X29,X27,X28,X1)
                              & inv1(X10,X21,X29,X27,X28,X25) )
                           => ! [X30: bool1] :
                                ( ( is_empty(vertex,t2tb(X27))
                                <=> ( true1 = X30 ) )
                               => ( ( true1 = X30 )
                                 => ! [X31: set_vertex] :
                                      ( ( X28 = X31 )
                                     => ! [X32: set_vertex] :
                                          ( ( tb2t(empty(vertex)) = X32 )
                                         => ! [X33: $int] :
                                              ( ( $sum(X25,1) = X33 )
                                             => ! [X1: vertex1] : closure1(X29,X31,X32,X1) ) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(theory_normalization,[],[f60]) ).

tff(f60,negated_conjecture,
    ~ ! [X25: $int,X23: set_vertex,X10: vertex1,X24: set_vertex,X21: vertex1,X22: set_vertex] :
        ( ( ( is_empty(vertex,t2tb(X23))
           => is_empty(vertex,t2tb(X24)) )
          & inv1(X10,X21,X22,X23,X24,X25)
          & ! [X1: vertex1] : closure1(X22,X23,X24,X1)
          & $lesseq(0,X25) )
       => ! [X26: bool1] :
            ( ( ( true1 = X26 )
            <=> is_empty(vertex,t2tb(X23)) )
           => ( ( true1 != X26 )
             => ( ~ is_empty(vertex,t2tb(X23))
               => ! [X12: vertex1,X27: set_vertex] :
                    ( ( ( tb2t(remove(vertex,t2tb1(X12),t2tb(X23))) = X27 )
                      & mem(vertex,t2tb1(X12),t2tb(X23)) )
                   => ( ( X12 != X21 )
                     => ( ( ! [X1: vertex1] :
                              ( ( X1 != X12 )
                             => closure1(X22,X27,X24,X1) )
                          & inv1(X10,X21,X22,X27,X24,X25)
                          & shortest_path1(X10,X12,X25) )
                       => ! [X28: set_vertex,X29: set_vertex] :
                            ( ( subset(vertex,t2tb(succ1(X12)),t2tb(X29))
                              & ! [X1: vertex1] : closure1(X29,X27,X28,X1)
                              & inv1(X10,X21,X29,X27,X28,X25) )
                           => ! [X30: bool1] :
                                ( ( is_empty(vertex,t2tb(X27))
                                <=> ( true1 = X30 ) )
                               => ( ( true1 = X30 )
                                 => ! [X31: set_vertex] :
                                      ( ( X28 = X31 )
                                     => ! [X32: set_vertex] :
                                          ( ( tb2t(empty(vertex)) = X32 )
                                         => ! [X33: $int] :
                                              ( ( $sum(X25,1) = X33 )
                                             => ! [X1: vertex1] : closure1(X29,X31,X32,X1) ) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(negated_conjecture,[],[f59]) ).

tff(f59,conjecture,
    ! [X25: $int,X23: set_vertex,X10: vertex1,X24: set_vertex,X21: vertex1,X22: set_vertex] :
      ( ( ( is_empty(vertex,t2tb(X23))
         => is_empty(vertex,t2tb(X24)) )
        & inv1(X10,X21,X22,X23,X24,X25)
        & ! [X1: vertex1] : closure1(X22,X23,X24,X1)
        & $lesseq(0,X25) )
     => ! [X26: bool1] :
          ( ( ( true1 = X26 )
          <=> is_empty(vertex,t2tb(X23)) )
         => ( ( true1 != X26 )
           => ( ~ is_empty(vertex,t2tb(X23))
             => ! [X12: vertex1,X27: set_vertex] :
                  ( ( ( tb2t(remove(vertex,t2tb1(X12),t2tb(X23))) = X27 )
                    & mem(vertex,t2tb1(X12),t2tb(X23)) )
                 => ( ( X12 != X21 )
                   => ( ( ! [X1: vertex1] :
                            ( ( X1 != X12 )
                           => closure1(X22,X27,X24,X1) )
                        & inv1(X10,X21,X22,X27,X24,X25)
                        & shortest_path1(X10,X12,X25) )
                     => ! [X28: set_vertex,X29: set_vertex] :
                          ( ( subset(vertex,t2tb(succ1(X12)),t2tb(X29))
                            & ! [X1: vertex1] : closure1(X29,X27,X28,X1)
                            & inv1(X10,X21,X29,X27,X28,X25) )
                         => ! [X30: bool1] :
                              ( ( is_empty(vertex,t2tb(X27))
                              <=> ( true1 = X30 ) )
                             => ( ( true1 = X30 )
                               => ! [X31: set_vertex] :
                                    ( ( X28 = X31 )
                                   => ! [X32: set_vertex] :
                                        ( ( tb2t(empty(vertex)) = X32 )
                                       => ! [X33: $int] :
                                            ( ( $sum(X25,1) = X33 )
                                           => ! [X1: vertex1] : closure1(X29,X31,X32,X1) ) ) ) ) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_bfs) ).

tff(f287,plain,
    ~ closure1(sK12,sK14,sK15,sK17),
    inference(cnf_transformation,[],[f201]) ).

tff(f774,plain,
    ( ~ mem(vertex,t2tb1(sK18(sK12,sK17)),t2tb(succ1(sK17)))
    | ~ spl32_3 ),
    inference(unit_resulting_resolution,[],[f293,f452,f507,f509,f530,f317]) ).

tff(f317,plain,
    ! [X2: vertex1,X3: set_vertex,X0: set_vertex,X1: set_vertex,X4: vertex1] :
      ( ~ closure1(X1,X0,X3,X2)
      | mem(vertex,t2tb1(X2),t2tb(X0))
      | mem(vertex,t2tb1(X2),t2tb(X3))
      | ~ mem(vertex,t2tb1(X2),t2tb(X1))
      | mem(vertex,t2tb1(X4),t2tb(X1))
      | ~ mem(vertex,t2tb1(X4),t2tb(succ1(X2))) ),
    inference(cnf_transformation,[],[f209]) ).

tff(f530,plain,
    ~ mem(vertex,t2tb1(sK18(sK12,sK17)),t2tb(sK12)),
    inference(unit_resulting_resolution,[],[f439,f312]) ).

tff(f312,plain,
    ! [X2: vertex1,X3: set_vertex,X0: set_vertex,X1: set_vertex] :
      ( ~ mem(vertex,t2tb1(sK18(X1,X2)),t2tb(X1))
      | closure1(X1,X0,X3,X2) ),
    inference(cnf_transformation,[],[f209]) ).

tff(f509,plain,
    mem(vertex,t2tb1(sK17),t2tb(sK12)),
    inference(unit_resulting_resolution,[],[f439,f315]) ).

tff(f315,plain,
    ! [X2: vertex1,X3: set_vertex,X0: set_vertex,X1: set_vertex] :
      ( closure1(X1,X0,X3,X2)
      | mem(vertex,t2tb1(X2),t2tb(X1)) ),
    inference(cnf_transformation,[],[f209]) ).

tff(f507,plain,
    ~ mem(vertex,t2tb1(sK17),t2tb(sK11)),
    inference(unit_resulting_resolution,[],[f439,f314]) ).

tff(f314,plain,
    ! [X2: vertex1,X3: set_vertex,X0: set_vertex,X1: set_vertex] :
      ( ~ mem(vertex,t2tb1(X2),t2tb(X0))
      | closure1(X1,X0,X3,X2) ),
    inference(cnf_transformation,[],[f209]) ).

tff(f452,plain,
    ( ! [X0: uni] : ~ mem(vertex,X0,t2tb(sK10))
    | ~ spl32_3 ),
    inference(unit_resulting_resolution,[],[f422,f326]) ).

tff(f326,plain,
    ! [X3: uni,X0: uni,X1: ty] :
      ( ~ mem(X1,X3,X0)
      | ~ is_empty(X1,X0) ),
    inference(cnf_transformation,[],[f218]) ).

tff(f218,plain,
    ! [X0: uni,X1: ty] :
      ( ( ( sort1(X1,sK19(X0,X1))
          & mem(X1,sK19(X0,X1),X0) )
        | is_empty(X1,X0) )
      & ( ! [X3: uni] : ~ mem(X1,X3,X0)
        | ~ is_empty(X1,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f216,f217]) ).

tff(f217,plain,
    ! [X0: uni,X1: ty] :
      ( ? [X2: uni] :
          ( sort1(X1,X2)
          & mem(X1,X2,X0) )
     => ( sort1(X1,sK19(X0,X1))
        & mem(X1,sK19(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

tff(f216,plain,
    ! [X0: uni,X1: ty] :
      ( ( ? [X2: uni] :
            ( sort1(X1,X2)
            & mem(X1,X2,X0) )
        | is_empty(X1,X0) )
      & ( ! [X3: uni] : ~ mem(X1,X3,X0)
        | ~ is_empty(X1,X0) ) ),
    inference(rectify,[],[f156]) ).

tff(f156,plain,
    ! [X0: uni,X1: ty] :
      ( ( ? [X3: uni] :
            ( sort1(X1,X3)
            & mem(X1,X3,X0) )
        | is_empty(X1,X0) )
      & ( ! [X2: uni] : ~ mem(X1,X2,X0)
        | ~ is_empty(X1,X0) ) ),
    inference(ennf_transformation,[],[f97]) ).

tff(f97,plain,
    ! [X1: ty,X0: uni] :
      ( ( ! [X3: uni] :
            ( sort1(X1,X3)
           => ~ mem(X1,X3,X0) )
       => is_empty(X1,X0) )
      & ( is_empty(X1,X0)
       => ! [X2: uni] : ~ mem(X1,X2,X0) ) ),
    inference(rectify,[],[f15]) ).

tff(f15,axiom,
    ! [X10: uni,X0: ty] :
      ( ( is_empty(X0,X10)
       => ! [X1: uni] : ~ mem(X0,X1,X10) )
      & ( ! [X1: uni] :
            ( sort1(X0,X1)
           => ~ mem(X0,X1,X10) )
       => is_empty(X0,X10) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_empty_def) ).

tff(f422,plain,
    ( is_empty(vertex,t2tb(sK10))
    | ~ spl32_3 ),
    inference(avatar_component_clause,[],[f421]) ).

tff(f421,plain,
    ( spl32_3
  <=> is_empty(vertex,t2tb(sK10)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl32_3])]) ).

tff(f293,plain,
    ! [X12: vertex1] : closure1(sK12,sK10,sK11,X12),
    inference(cnf_transformation,[],[f201]) ).

tff(f433,plain,
    ( spl32_3
    | ~ spl32_4 ),
    inference(avatar_split_clause,[],[f284,f425,f421]) ).

tff(f425,plain,
    ( spl32_4
  <=> ( true1 = sK13 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl32_4])]) ).

tff(f284,plain,
    ( ( true1 != sK13 )
    | is_empty(vertex,t2tb(sK10)) ),
    inference(cnf_transformation,[],[f201]) ).

tff(f430,plain,
    spl32_4,
    inference(avatar_split_clause,[],[f290,f425]) ).

tff(f290,plain,
    true1 = sK13,
    inference(cnf_transformation,[],[f201]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.45  % Problem    : SWW672=2 : TPTP v8.1.0. Released v6.1.0.
% 0.10/0.46  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.70  % Computer : n016.cluster.edu
% 0.13/0.70  % Model    : x86_64 x86_64
% 0.13/0.70  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.70  % Memory   : 8042.1875MB
% 0.13/0.70  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.70  % CPULimit   : 300
% 0.13/0.70  % WCLimit    : 300
% 0.13/0.70  % DateTime   : Tue Aug 30 21:22:02 EDT 2022
% 0.13/0.70  % CPUTime    : 
% 0.16/0.86  % (23697)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.86  % (23700)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.87  % (23708)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.16/0.87  % (23697)Instruction limit reached!
% 0.16/0.87  % (23697)------------------------------
% 0.16/0.87  % (23697)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.88  % (23713)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.16/0.88  % (23697)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.88  % (23697)Termination reason: Unknown
% 0.16/0.88  % (23697)Termination phase: Property scanning
% 0.16/0.88  
% 0.16/0.88  % (23697)Memory used [KB]: 1151
% 0.16/0.88  % (23697)Time elapsed: 0.006 s
% 0.16/0.88  % (23697)Instructions burned: 8 (million)
% 0.16/0.88  % (23697)------------------------------
% 0.16/0.88  % (23697)------------------------------
% 0.16/0.88  % (23705)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.16/0.89  % (23716)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.16/0.90  % (23693)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.16/0.91  % (23694)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.91  % (23709)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.16/0.91  % (23714)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.16/0.91  % (23695)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.16/0.92  % (23690)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.16/0.92  % (23696)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.16/0.92  % (23698)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.16/0.92  % (23701)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.16/0.92  % (23711)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.16/0.92  % (23698)Instruction limit reached!
% 0.16/0.92  % (23698)------------------------------
% 0.16/0.92  % (23698)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.92  % (23698)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.92  % (23698)Termination reason: Unknown
% 0.16/0.92  % (23698)Termination phase: Property scanning
% 0.16/0.92  
% 0.16/0.92  % (23698)Memory used [KB]: 895
% 0.16/0.92  % (23698)Time elapsed: 0.003 s
% 0.16/0.92  % (23698)Instructions burned: 3 (million)
% 0.16/0.92  % (23698)------------------------------
% 0.16/0.92  % (23698)------------------------------
% 0.16/0.92  % (23696)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.16/0.92  % (23696)Terminated due to inappropriate strategy.
% 0.16/0.92  % (23696)------------------------------
% 0.16/0.92  % (23696)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.92  % (23696)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.92  % (23696)Termination reason: Inappropriate
% 0.16/0.92  
% 0.16/0.92  % (23696)Memory used [KB]: 1151
% 0.16/0.92  % (23696)Time elapsed: 0.008 s
% 0.16/0.92  % (23696)Instructions burned: 9 (million)
% 0.16/0.92  % (23696)------------------------------
% 0.16/0.92  % (23696)------------------------------
% 0.16/0.93  % (23710)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.16/0.93  % (23706)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.16/0.93  % (23719)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)
% 0.16/0.93  % (23712)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.16/0.94  % (23703)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.16/0.94  % (23718)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.16/0.94  % (23704)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.16/0.94  % (23691)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.16/0.94  % (23702)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.16/0.94  % (23717)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.16/0.95  % (23690)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.16/0.95  % (23690)Terminated due to inappropriate strategy.
% 0.16/0.95  % (23690)------------------------------
% 0.16/0.95  % (23690)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.95  % (23690)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.95  % (23690)Termination reason: Inappropriate
% 0.16/0.95  
% 0.16/0.95  % (23690)Memory used [KB]: 1279
% 0.16/0.95  % (23690)Time elapsed: 0.010 s
% 0.16/0.95  % (23690)Instructions burned: 15 (million)
% 0.16/0.95  % (23690)------------------------------
% 0.16/0.95  % (23690)------------------------------
% 0.16/0.97  % (23707)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.16/0.97  % (23715)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.16/0.97  % (23700)Instruction limit reached!
% 0.16/0.97  % (23700)------------------------------
% 0.16/0.97  % (23700)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.97  % (23700)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.97  % (23700)Termination reason: Unknown
% 0.16/0.97  % (23700)Termination phase: Saturation
% 0.16/0.97  
% 0.16/0.97  % (23700)Memory used [KB]: 6396
% 0.16/0.97  % (23700)Time elapsed: 0.184 s
% 0.16/0.97  % (23700)Instructions burned: 50 (million)
% 0.16/0.97  % (23700)------------------------------
% 0.16/0.97  % (23700)------------------------------
% 0.16/0.99  % (23692)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.16/1.01  % (23699)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.16/1.02  % (23707)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.16/1.02  % (23707)Terminated due to inappropriate strategy.
% 0.16/1.02  % (23707)------------------------------
% 0.16/1.02  % (23707)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.02  % (23707)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.02  % (23707)Termination reason: Inappropriate
% 0.16/1.02  
% 0.16/1.02  % (23707)Memory used [KB]: 1279
% 0.16/1.02  % (23707)Time elapsed: 0.012 s
% 0.16/1.02  % (23707)Instructions burned: 14 (million)
% 0.16/1.02  % (23707)------------------------------
% 0.16/1.02  % (23707)------------------------------
% 0.16/1.02  % (23716)Instruction limit reached!
% 0.16/1.02  % (23716)------------------------------
% 0.16/1.02  % (23716)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.03  % (23695)Instruction limit reached!
% 0.16/1.03  % (23695)------------------------------
% 0.16/1.03  % (23695)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.03  % (23705)Instruction limit reached!
% 0.16/1.03  % (23705)------------------------------
% 0.16/1.03  % (23705)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.03  % (23705)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.03  % (23705)Termination reason: Unknown
% 0.16/1.03  % (23705)Termination phase: Saturation
% 0.16/1.03  
% 0.16/1.03  % (23705)Memory used [KB]: 2174
% 0.16/1.03  % (23705)Time elapsed: 0.258 s
% 0.16/1.03  % (23705)Instructions burned: 75 (million)
% 0.16/1.03  % (23705)------------------------------
% 0.16/1.03  % (23705)------------------------------
% 0.16/1.04  % (23694)Instruction limit reached!
% 0.16/1.04  % (23694)------------------------------
% 0.16/1.04  % (23694)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.04  % (23694)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.04  % (23694)Termination reason: Unknown
% 0.16/1.04  % (23694)Termination phase: Saturation
% 0.16/1.04  
% 0.16/1.04  % (23694)Memory used [KB]: 6268
% 0.16/1.04  % (23694)Time elapsed: 0.269 s
% 0.16/1.04  % (23694)Instructions burned: 52 (million)
% 0.16/1.04  % (23694)------------------------------
% 0.16/1.04  % (23694)------------------------------
% 0.16/1.04  % (23693)Instruction limit reached!
% 0.16/1.04  % (23693)------------------------------
% 0.16/1.04  % (23693)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.04  % (23693)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.04  % (23693)Termination reason: Unknown
% 0.16/1.04  % (23693)Termination phase: Saturation
% 0.16/1.04  
% 0.16/1.04  % (23693)Memory used [KB]: 6140
% 0.16/1.04  % (23693)Time elapsed: 0.269 s
% 0.16/1.04  % (23693)Instructions burned: 52 (million)
% 0.16/1.04  % (23693)------------------------------
% 0.16/1.04  % (23693)------------------------------
% 0.16/1.04  % (23716)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.04  % (23716)Termination reason: Unknown
% 0.16/1.04  % (23716)Termination phase: Saturation
% 0.16/1.04  
% 0.16/1.04  % (23716)Memory used [KB]: 7036
% 0.16/1.04  % (23716)Time elapsed: 0.056 s
% 0.16/1.04  % (23716)Instructions burned: 69 (million)
% 0.16/1.04  % (23716)------------------------------
% 0.16/1.04  % (23716)------------------------------
% 0.16/1.05  % (23695)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.05  % (23695)Termination reason: Unknown
% 0.16/1.05  % (23695)Termination phase: Saturation
% 0.16/1.05  
% 0.16/1.05  % (23695)Memory used [KB]: 6140
% 0.16/1.05  % (23695)Time elapsed: 0.263 s
% 0.16/1.05  % (23695)Instructions burned: 49 (million)
% 0.16/1.05  % (23695)------------------------------
% 0.16/1.05  % (23695)------------------------------
% 0.16/1.05  % (23720)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/388Mi)
% 0.16/1.06  % (23691)Instruction limit reached!
% 0.16/1.06  % (23691)------------------------------
% 0.16/1.06  % (23691)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/1.06  % (23691)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/1.06  % (23691)Termination reason: Unknown
% 0.16/1.06  % (23691)Termination phase: Saturation
% 0.16/1.06  
% 0.16/1.06  % (23691)Memory used [KB]: 6268
% 0.16/1.06  % (23691)Time elapsed: 0.254 s
% 0.16/1.06  % (23691)Instructions burned: 51 (million)
% 0.16/1.06  % (23691)------------------------------
% 0.16/1.06  % (23691)------------------------------
% 2.71/1.07  % (23704)Instruction limit reached!
% 2.71/1.07  % (23704)------------------------------
% 2.71/1.07  % (23704)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.71/1.08  % (23708)Instruction limit reached!
% 2.71/1.08  % (23708)------------------------------
% 2.71/1.08  % (23708)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.71/1.08  % (23708)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.71/1.08  % (23708)Termination reason: Unknown
% 2.71/1.08  % (23708)Termination phase: Saturation
% 2.71/1.08  
% 2.71/1.08  % (23708)Memory used [KB]: 6908
% 2.71/1.08  % (23708)Time elapsed: 0.315 s
% 2.71/1.08  % (23708)Instructions burned: 100 (million)
% 2.71/1.08  % (23708)------------------------------
% 2.71/1.08  % (23708)------------------------------
% 2.71/1.09  % (23704)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.71/1.09  % (23704)Termination reason: Unknown
% 2.71/1.09  % (23704)Termination phase: Saturation
% 2.71/1.09  
% 2.71/1.09  % (23704)Memory used [KB]: 7036
% 2.71/1.09  % (23704)Time elapsed: 0.050 s
% 2.71/1.09  % (23704)Instructions burned: 68 (million)
% 2.71/1.09  % (23704)------------------------------
% 2.71/1.09  % (23704)------------------------------
% 2.71/1.10  % (23722)dis+22_1:128_bsd=on:rp=on:slsq=on:slsqc=1:slsqr=1,6:sp=frequency:spb=goal:thsq=on:thsqc=16:thsqd=1:thsql=off:i=90:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/90Mi)
% 2.71/1.11  % (23692)Instruction limit reached!
% 2.71/1.11  % (23692)------------------------------
% 2.71/1.11  % (23692)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.71/1.11  % (23692)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.71/1.11  % (23692)Termination reason: Unknown
% 2.71/1.11  % (23692)Termination phase: Saturation
% 2.71/1.11  
% 2.71/1.11  % (23692)Memory used [KB]: 1535
% 2.71/1.11  % (23692)Time elapsed: 0.312 s
% 2.71/1.11  % (23692)Instructions burned: 37 (million)
% 2.71/1.11  % (23692)------------------------------
% 2.71/1.11  % (23692)------------------------------
% 2.71/1.12  % (23709)Instruction limit reached!
% 2.71/1.12  % (23709)------------------------------
% 2.71/1.12  % (23709)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.71/1.12  % (23709)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.71/1.12  % (23709)Termination reason: Unknown
% 2.71/1.12  % (23709)Termination phase: Saturation
% 2.71/1.12  
% 2.71/1.12  % (23709)Memory used [KB]: 1407
% 2.71/1.12  % (23709)Time elapsed: 0.337 s
% 2.71/1.12  % (23709)Instructions burned: 100 (million)
% 2.71/1.12  % (23709)------------------------------
% 2.71/1.12  % (23709)------------------------------
% 2.71/1.13  % (23699)Instruction limit reached!
% 2.71/1.13  % (23699)------------------------------
% 2.71/1.13  % (23699)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.71/1.13  % (23699)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.71/1.13  % (23699)Termination reason: Unknown
% 2.71/1.13  % (23699)Termination phase: Saturation
% 2.71/1.13  
% 2.71/1.13  % (23699)Memory used [KB]: 1535
% 2.71/1.13  % (23699)Time elapsed: 0.334 s
% 2.71/1.13  % (23699)Instructions burned: 52 (million)
% 2.71/1.13  % (23699)------------------------------
% 2.71/1.13  % (23699)------------------------------
% 3.21/1.15  % (23721)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=211:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/211Mi)
% 3.21/1.17  % (23706)Instruction limit reached!
% 3.21/1.17  % (23706)------------------------------
% 3.21/1.17  % (23706)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.21/1.17  % (23706)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.21/1.17  % (23706)Termination reason: Unknown
% 3.21/1.17  % (23706)Termination phase: Saturation
% 3.21/1.17  
% 3.21/1.17  % (23706)Memory used [KB]: 6524
% 3.21/1.17  % (23706)Time elapsed: 0.347 s
% 3.21/1.17  % (23706)Instructions burned: 100 (million)
% 3.21/1.17  % (23706)------------------------------
% 3.21/1.17  % (23706)------------------------------
% 3.52/1.19  % (23701)Instruction limit reached!
% 3.52/1.19  % (23701)------------------------------
% 3.52/1.19  % (23701)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.52/1.19  % (23701)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.52/1.19  % (23701)Termination reason: Unknown
% 3.52/1.19  % (23701)Termination phase: Saturation
% 3.52/1.19  
% 3.52/1.19  % (23701)Memory used [KB]: 6780
% 3.52/1.19  % (23701)Time elapsed: 0.395 s
% 3.52/1.19  % (23701)Instructions burned: 100 (million)
% 3.52/1.19  % (23701)------------------------------
% 3.52/1.19  % (23701)------------------------------
% 3.52/1.19  % (23703)Instruction limit reached!
% 3.52/1.19  % (23703)------------------------------
% 3.52/1.19  % (23703)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.52/1.19  % (23703)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.52/1.19  % (23703)Termination reason: Unknown
% 3.52/1.19  % (23703)Termination phase: Saturation
% 3.52/1.19  
% 3.52/1.19  % (23703)Memory used [KB]: 6908
% 3.52/1.19  % (23703)Time elapsed: 0.421 s
% 3.52/1.19  % (23703)Instructions burned: 100 (million)
% 3.52/1.19  % (23703)------------------------------
% 3.52/1.19  % (23703)------------------------------
% 3.52/1.20  % (23724)ott+1_1:2_i=920:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/920Mi)
% 3.52/1.21  % (23725)ott+1_1:7_bd=off:i=934:si=on:rawr=on:rtra=on_0 on theBenchmark for (2997ds/934Mi)
% 3.52/1.22  % (23722)Instruction limit reached!
% 3.52/1.22  % (23722)------------------------------
% 3.52/1.22  % (23722)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.52/1.22  % (23722)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.52/1.22  % (23722)Termination reason: Unknown
% 3.52/1.22  % (23722)Termination phase: Saturation
% 3.52/1.22  
% 3.52/1.22  % (23722)Memory used [KB]: 6524
% 3.52/1.22  % (23722)Time elapsed: 0.237 s
% 3.52/1.22  % (23722)Instructions burned: 90 (million)
% 3.52/1.22  % (23722)------------------------------
% 3.52/1.22  % (23722)------------------------------
% 3.52/1.23  % (23702)Instruction limit reached!
% 3.52/1.23  % (23702)------------------------------
% 3.52/1.23  % (23702)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.52/1.23  % (23702)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.52/1.23  % (23702)Termination reason: Unknown
% 3.52/1.23  % (23702)Termination phase: Saturation
% 3.52/1.23  
% 3.52/1.23  % (23702)Memory used [KB]: 6780
% 3.52/1.23  % (23702)Time elapsed: 0.463 s
% 3.52/1.23  % (23702)Instructions burned: 102 (million)
% 3.52/1.23  % (23702)------------------------------
% 3.52/1.23  % (23702)------------------------------
% 3.91/1.25  % (23729)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=940:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/940Mi)
% 3.91/1.25  % (23732)dis+22_1:128_bsd=on:rp=on:slsq=on:slsqc=1:slsqr=1,6:sp=frequency:spb=goal:thsq=on:thsqc=16:thsqd=1:thsql=off:i=90:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/90Mi)
% 3.91/1.26  WARNING Broken Constraint: if sine_depth(2) has been set then sine_selection(off) is not equal to off
% 3.96/1.27  % (23727)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=655:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/655Mi)
% 3.96/1.27  % (23711)Instruction limit reached!
% 3.96/1.27  % (23711)------------------------------
% 3.96/1.27  % (23711)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 3.96/1.27  % (23711)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 3.96/1.27  % (23711)Termination reason: Unknown
% 3.96/1.27  % (23711)Termination phase: Saturation
% 3.96/1.27  
% 3.96/1.27  % (23711)Memory used [KB]: 7164
% 3.96/1.27  % (23711)Time elapsed: 0.470 s
% 3.96/1.27  % (23711)Instructions burned: 138 (million)
% 3.96/1.27  % (23711)------------------------------
% 3.96/1.27  % (23711)------------------------------
% 3.96/1.28  % (23730)ott+11_4:1_br=off:fde=none:s2a=on:sd=2:sp=frequency:urr=on:i=981:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/981Mi)
% 3.96/1.29  % (23733)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=2016:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/2016Mi)
% 3.96/1.29  % (23726)ott+10_1:50_bsr=unit_only:drc=off:fd=preordered:sp=frequency:i=747:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/747Mi)
% 3.96/1.30  % (23734)dis+10_1:2_atotf=0.3:i=3735:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/3735Mi)
% 4.26/1.31  % (23735)ott+11_9:8_add=large:afp=10:amm=off:fsd=on:fsr=off:lma=on:nm=0:nwc=2.4:s2a=on:s2agt=10:sas=z3:sp=reverse_arity:tha=some:thi=overlap:i=4958:si=on:rawr=on:rtra=on_0 on theBenchmark for (2996ds/4958Mi)
% 4.26/1.32  % (23728)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 (2996ds/68Mi)
% 4.26/1.34  % (23737)ott+10_1:1_kws=precedence:tgt=ground:i=4756:si=on:rawr=on:rtra=on_0 on theBenchmark for (2995ds/4756Mi)
% 4.26/1.34  % (23742)ott-1_1:1_sp=const_frequency:i=2891:si=on:rawr=on:rtra=on_0 on theBenchmark for (2995ds/2891Mi)
% 4.41/1.35  % (23710)Instruction limit reached!
% 4.41/1.35  % (23710)------------------------------
% 4.41/1.35  % (23710)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 4.41/1.35  % (23710)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 4.41/1.35  % (23710)Termination reason: Unknown
% 4.41/1.35  % (23710)Termination phase: Saturation
% 4.41/1.35  
% 4.41/1.35  % (23710)Memory used [KB]: 6140
% 4.41/1.35  % (23710)Time elapsed: 0.563 s
% 4.41/1.35  % (23710)Instructions burned: 176 (million)
% 4.41/1.35  % (23710)------------------------------
% 4.41/1.35  % (23710)------------------------------
% 4.41/1.37  % (23730)First to succeed.
% 4.41/1.40  % (23730)Refutation found. Thanks to Tanya!
% 4.41/1.40  % SZS status Theorem for theBenchmark
% 4.41/1.40  % SZS output start Proof for theBenchmark
% See solution above
% 4.41/1.40  % (23730)------------------------------
% 4.41/1.40  % (23730)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 4.41/1.40  % (23730)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 4.41/1.40  % (23730)Termination reason: Refutation
% 4.41/1.40  
% 4.41/1.40  % (23730)Memory used [KB]: 6268
% 4.41/1.40  % (23730)Time elapsed: 0.282 s
% 4.41/1.40  % (23730)Instructions burned: 38 (million)
% 4.41/1.40  % (23730)------------------------------
% 4.41/1.40  % (23730)------------------------------
% 4.41/1.40  % (23689)Success in time 0.669 s
%------------------------------------------------------------------------------