TSTP Solution File: SWW672_2 by Vampire-SAT---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.9
% Problem  : SWW672_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d SAT

% Computer : n003.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 : Mon Jun 24 18:54:02 EDT 2024

% Result   : Theorem 20.73s 3.38s
% Output   : Refutation 20.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   55 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :  620 ( 215 equ)
%            Maximal formula atoms :   60 (  11 avg)
%            Number of connectives :  758 ( 193   ~; 112   |; 352   &)
%                                         (  16 <=>;  85  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   31 (  11 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  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  11 usr;   1 prp; 0-6 aty)
%            Number of functors    :   61 (  58 usr;  27 con; 0-4 aty)
%            Number of variables   :  379 ( 195   !; 184   ?; 379   :)

% 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: vertex1 ).

tff(func_def_34,type,
    sK3: vertex1 ).

tff(func_def_35,type,
    sK4: $int ).

tff(func_def_36,type,
    sK5: set_vertex ).

tff(func_def_37,type,
    sK6: set_vertex ).

tff(func_def_38,type,
    sK7: set_vertex ).

tff(func_def_39,type,
    sK8: bool1 ).

tff(func_def_40,type,
    sK9: set_vertex ).

tff(func_def_41,type,
    sK10: vertex1 ).

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 ).

tff(func_def_50,type,
    sK19: set_vertex > vertex1 ).

tff(func_def_51,type,
    sK20: ( ty * uni ) > uni ).

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

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

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

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

tff(func_def_56,type,
    sK25: ( $int * vertex1 * vertex1 ) > vertex1 ).

tff(func_def_57,type,
    sK26: ( $int * vertex1 * vertex1 ) > vertex1 ).

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

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

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

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

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

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 * vertex1 ) > $o ).

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

tff(f422169,plain,
    $false,
    inference(unit_resulting_resolution,[],[f373,f36515,f430,f36253,f94257,f99286,f346]) ).

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

tff(f230,plain,
    ! [X0: set_vertex,X1: set_vertex,X2: set_vertex,X3: vertex1] :
      ( ( closure1(X0,X1,X2,X3)
        | ( ~ mem(vertex,t2tb1(sK30(X0,X3)),t2tb(X0))
          & mem(vertex,t2tb1(sK30(X0,X3)),t2tb(succ1(X3)))
          & ~ mem(vertex,t2tb1(X3),t2tb(X2))
          & ~ mem(vertex,t2tb1(X3),t2tb(X1))
          & mem(vertex,t2tb1(X3),t2tb(X0)) ) )
      & ( ! [X5: vertex1] :
            ( mem(vertex,t2tb1(X5),t2tb(X0))
            | ~ mem(vertex,t2tb1(X5),t2tb(succ1(X3))) )
        | mem(vertex,t2tb1(X3),t2tb(X2))
        | mem(vertex,t2tb1(X3),t2tb(X1))
        | ~ mem(vertex,t2tb1(X3),t2tb(X0))
        | ~ closure1(X0,X1,X2,X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK30])],[f228,f229]) ).

tff(f229,plain,
    ! [X0: set_vertex,X3: vertex1] :
      ( ? [X4: vertex1] :
          ( ~ mem(vertex,t2tb1(X4),t2tb(X0))
          & mem(vertex,t2tb1(X4),t2tb(succ1(X3))) )
     => ( ~ mem(vertex,t2tb1(sK30(X0,X3)),t2tb(X0))
        & mem(vertex,t2tb1(sK30(X0,X3)),t2tb(succ1(X3))) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

tff(f58,axiom,
    ! [X22: set_vertex,X23: set_vertex,X24: set_vertex,X1: vertex1] :
      ( 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',unknown) ).

tff(f99286,plain,
    mem(vertex,t2tb1(sK30(sK12,sK17)),t2tb(succ1(sK17))),
    inference(unit_resulting_resolution,[],[f390,f350]) ).

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

tff(f390,plain,
    ~ closure1(sK12,sK14,tb2t(empty(vertex)),sK17),
    inference(forward_demodulation,[],[f265,f263]) ).

tff(f263,plain,
    tb2t(empty(vertex)) = sK15,
    inference(cnf_transformation,[],[f194]) ).

tff(f194,plain,
    ( ~ closure1(sK12,sK14,sK15,sK17)
    & ( $sum(sK4,1) = sK16 )
    & ( tb2t(empty(vertex)) = sK15 )
    & ( sK11 = sK14 )
    & ( true1 = sK13 )
    & ( ( true1 = sK13 )
      | ~ is_empty(vertex,t2tb(sK9)) )
    & ( is_empty(vertex,t2tb(sK9))
      | ( true1 != sK13 ) )
    & ! [X16: vertex1] : closure1(sK12,sK9,sK11,X16)
    & subset(vertex,t2tb(succ1(sK10)),t2tb(sK12))
    & inv1(sK2,sK3,sK12,sK9,sK11,sK4)
    & ! [X17: vertex1] :
        ( closure1(sK7,sK9,sK5,X17)
        | ( sK10 = X17 ) )
    & shortest_path1(sK2,sK10,sK4)
    & inv1(sK2,sK3,sK7,sK9,sK5,sK4)
    & ( sK3 != sK10 )
    & ( sK9 = tb2t(remove(vertex,t2tb1(sK10),t2tb(sK6))) )
    & mem(vertex,t2tb1(sK10),t2tb(sK6))
    & ~ is_empty(vertex,t2tb(sK6))
    & ( true1 != sK8 )
    & ( ( true1 = sK8 )
      | ~ is_empty(vertex,t2tb(sK6)) )
    & ( is_empty(vertex,t2tb(sK6))
      | ( true1 != sK8 ) )
    & ~ $less(sK4,0)
    & ! [X18: vertex1] : closure1(sK7,sK6,sK5,X18)
    & ( is_empty(vertex,t2tb(sK5))
      | ~ is_empty(vertex,t2tb(sK6)) )
    & inv1(sK2,sK3,sK7,sK6,sK5,sK4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17])],[f184,f193,f192,f191,f190,f189,f188,f187,f186,f185]) ).

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

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

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

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

tff(f189,plain,
    ( ? [X11: bool1] :
        ( ? [X12: set_vertex] :
            ( ? [X13: set_vertex] :
                ( ? [X14: $int] :
                    ( ? [X15: vertex1] : ~ closure1(sK12,X12,X13,X15)
                    & ( $sum(sK4,1) = X14 ) )
                & ( tb2t(empty(vertex)) = X13 ) )
            & ( sK11 = X12 ) )
        & ( true1 = X11 )
        & ( ( true1 = X11 )
          | ~ is_empty(vertex,t2tb(sK9)) )
        & ( is_empty(vertex,t2tb(sK9))
          | ( true1 != X11 ) ) )
   => ( ? [X12: set_vertex] :
          ( ? [X13: set_vertex] :
              ( ? [X14: $int] :
                  ( ? [X15: vertex1] : ~ closure1(sK12,X12,X13,X15)
                  & ( $sum(sK4,1) = X14 ) )
              & ( tb2t(empty(vertex)) = X13 ) )
          & ( sK11 = X12 ) )
      & ( true1 = sK13 )
      & ( ( true1 = sK13 )
        | ~ is_empty(vertex,t2tb(sK9)) )
      & ( is_empty(vertex,t2tb(sK9))
        | ( true1 != sK13 ) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f190,plain,
    ( ? [X12: set_vertex] :
        ( ? [X13: set_vertex] :
            ( ? [X14: $int] :
                ( ? [X15: vertex1] : ~ closure1(sK12,X12,X13,X15)
                & ( $sum(sK4,1) = X14 ) )
            & ( tb2t(empty(vertex)) = X13 ) )
        & ( sK11 = X12 ) )
   => ( ? [X13: set_vertex] :
          ( ? [X14: $int] :
              ( ? [X15: vertex1] : ~ closure1(sK12,sK14,X13,X15)
              & ( $sum(sK4,1) = X14 ) )
          & ( tb2t(empty(vertex)) = X13 ) )
      & ( sK11 = sK14 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f191,plain,
    ( ? [X13: set_vertex] :
        ( ? [X14: $int] :
            ( ? [X15: vertex1] : ~ closure1(sK12,sK14,X13,X15)
            & ( $sum(sK4,1) = X14 ) )
        & ( tb2t(empty(vertex)) = X13 ) )
   => ( ? [X14: $int] :
          ( ? [X15: vertex1] : ~ closure1(sK12,sK14,sK15,X15)
          & ( $sum(sK4,1) = X14 ) )
      & ( tb2t(empty(vertex)) = sK15 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f192,plain,
    ( ? [X14: $int] :
        ( ? [X15: vertex1] : ~ closure1(sK12,sK14,sK15,X15)
        & ( $sum(sK4,1) = X14 ) )
   => ( ? [X15: vertex1] : ~ closure1(sK12,sK14,sK15,X15)
      & ( $sum(sK4,1) = sK16 ) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

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

tff(f61,plain,
    ~ ! [X10: vertex1,X21: vertex1,X25: $int,X24: set_vertex,X23: set_vertex,X22: set_vertex] :
        ( ( ~ $less(X25,0)
          & ! [X1: vertex1] : closure1(X22,X23,X24,X1)
          & ( is_empty(vertex,t2tb(X23))
           => is_empty(vertex,t2tb(X24)) )
          & inv1(X10,X21,X22,X23,X24,X25) )
       => ! [X26: bool1] :
            ( ( ( true1 = X26 )
            <=> is_empty(vertex,t2tb(X23)) )
           => ( ( true1 != X26 )
             => ( ~ is_empty(vertex,t2tb(X23))
               => ! [X27: set_vertex,X12: vertex1] :
                    ( ( ( 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) )
                          & shortest_path1(X10,X12,X25)
                          & inv1(X10,X21,X22,X27,X24,X25) )
                       => ! [X28: set_vertex,X29: set_vertex] :
                            ( ( ! [X1: vertex1] : closure1(X29,X27,X28,X1)
                              & subset(vertex,t2tb(succ1(X12)),t2tb(X29))
                              & inv1(X10,X21,X29,X27,X28,X25) )
                           => ! [X30: bool1] :
                                ( ( ( true1 = X30 )
                                <=> is_empty(vertex,t2tb(X27)) )
                               => ( ( 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,
    ~ ! [X10: vertex1,X21: vertex1,X25: $int,X24: set_vertex,X23: set_vertex,X22: set_vertex] :
        ( ( $lesseq(0,X25)
          & ! [X1: vertex1] : closure1(X22,X23,X24,X1)
          & ( is_empty(vertex,t2tb(X23))
           => is_empty(vertex,t2tb(X24)) )
          & inv1(X10,X21,X22,X23,X24,X25) )
       => ! [X26: bool1] :
            ( ( ( true1 = X26 )
            <=> is_empty(vertex,t2tb(X23)) )
           => ( ( true1 != X26 )
             => ( ~ is_empty(vertex,t2tb(X23))
               => ! [X27: set_vertex,X12: vertex1] :
                    ( ( ( 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) )
                          & shortest_path1(X10,X12,X25)
                          & inv1(X10,X21,X22,X27,X24,X25) )
                       => ! [X28: set_vertex,X29: set_vertex] :
                            ( ( ! [X1: vertex1] : closure1(X29,X27,X28,X1)
                              & subset(vertex,t2tb(succ1(X12)),t2tb(X29))
                              & inv1(X10,X21,X29,X27,X28,X25) )
                           => ! [X30: bool1] :
                                ( ( ( true1 = X30 )
                                <=> is_empty(vertex,t2tb(X27)) )
                               => ( ( 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,
    ! [X10: vertex1,X21: vertex1,X25: $int,X24: set_vertex,X23: set_vertex,X22: set_vertex] :
      ( ( $lesseq(0,X25)
        & ! [X1: vertex1] : closure1(X22,X23,X24,X1)
        & ( is_empty(vertex,t2tb(X23))
         => is_empty(vertex,t2tb(X24)) )
        & inv1(X10,X21,X22,X23,X24,X25) )
     => ! [X26: bool1] :
          ( ( ( true1 = X26 )
          <=> is_empty(vertex,t2tb(X23)) )
         => ( ( true1 != X26 )
           => ( ~ is_empty(vertex,t2tb(X23))
             => ! [X27: set_vertex,X12: vertex1] :
                  ( ( ( 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) )
                        & shortest_path1(X10,X12,X25)
                        & inv1(X10,X21,X22,X27,X24,X25) )
                     => ! [X28: set_vertex,X29: set_vertex] :
                          ( ( ! [X1: vertex1] : closure1(X29,X27,X28,X1)
                            & subset(vertex,t2tb(succ1(X12)),t2tb(X29))
                            & inv1(X10,X21,X29,X27,X28,X25) )
                         => ! [X30: bool1] :
                              ( ( ( true1 = X30 )
                              <=> is_empty(vertex,t2tb(X27)) )
                             => ( ( 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',unknown) ).

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

tff(f94257,plain,
    ~ mem(vertex,t2tb1(sK30(sK12,sK17)),t2tb(sK12)),
    inference(unit_resulting_resolution,[],[f390,f351]) ).

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

tff(f36253,plain,
    mem(vertex,t2tb1(sK17),t2tb(sK12)),
    inference(unit_resulting_resolution,[],[f390,f347]) ).

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

tff(f430,plain,
    ! [X0: uni] : ~ mem(vertex,X0,t2tb(sK9)),
    inference(unit_resulting_resolution,[],[f386,f287]) ).

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

tff(f200,plain,
    ! [X0: ty,X1: uni] :
      ( ( is_empty(X0,X1)
        | ( mem(X0,sK20(X0,X1),X1)
          & sort1(X0,sK20(X0,X1)) ) )
      & ( ! [X3: uni] : ~ mem(X0,X3,X1)
        | ~ is_empty(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK20])],[f140,f199]) ).

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

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

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

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

tff(f386,plain,
    is_empty(vertex,t2tb(sK9)),
    inference(trivial_inequality_removal,[],[f372]) ).

tff(f372,plain,
    ( is_empty(vertex,t2tb(sK9))
    | ( sK13 != sK13 ) ),
    inference(definition_unfolding,[],[f259,f261]) ).

tff(f261,plain,
    true1 = sK13,
    inference(cnf_transformation,[],[f194]) ).

tff(f259,plain,
    ( is_empty(vertex,t2tb(sK9))
    | ( true1 != sK13 ) ),
    inference(cnf_transformation,[],[f194]) ).

tff(f36515,plain,
    ~ mem(vertex,t2tb1(sK17),t2tb(sK14)),
    inference(unit_resulting_resolution,[],[f390,f348]) ).

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

tff(f373,plain,
    ! [X16: vertex1] : closure1(sK12,sK9,sK14,X16),
    inference(definition_unfolding,[],[f258,f262]) ).

tff(f262,plain,
    sK11 = sK14,
    inference(cnf_transformation,[],[f194]) ).

tff(f258,plain,
    ! [X16: vertex1] : closure1(sK12,sK9,sK11,X16),
    inference(cnf_transformation,[],[f194]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWW672_2 : TPTP v8.2.0. Released v6.1.0.
% 0.07/0.13  % Command    : run_vampire %s %d SAT
% 0.14/0.34  % Computer : n003.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Wed Jun 19 07:17:39 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.36  This is a TF0_THM_EQU_ARI problem
% 0.14/0.36  Running first-order model finding
% 0.14/0.36  Running /export/starexec/sandbox2/solver/bin/vampire --mode casc_sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.40  % (29737)fmb+10_1:1_sil=256000:fmbss=23:fmbes=contour:newcnf=on:fmbsr=1.14:i=152523:nm=2:gsp=on:rp=on_0 on theBenchmark for (3000ds/152523Mi)
% 0.22/0.41  % (29737)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.22/0.41  % (29737)Terminated due to inappropriate strategy.
% 0.22/0.41  % (29737)------------------------------
% 0.22/0.41  % (29737)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.41  % (29737)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.41  % (29737)Termination reason: Inappropriate
% 0.22/0.41  
% 0.22/0.41  % (29737)Memory used [KB]: 873
% 0.22/0.41  % (29737)Time elapsed: 0.004 s
% 0.22/0.41  % (29737)Instructions burned: 9 (million)
% 0.22/0.41  % (29737)------------------------------
% 0.22/0.41  % (29737)------------------------------
% 0.22/0.43  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43  % (29738)ott+21_1:1_sil=4000:i=104:fsd=on:fd=off:newcnf=on_0 on theBenchmark for (3000ds/104Mi)
% 0.22/0.43  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43  % (29735)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency:i=99418_0 on theBenchmark for (3000ds/99418Mi)
% 0.22/0.43  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43  % (29734)fmb+10_1:1_sil=256000:i=98885:tgt=full:fmbsr=1.3:fmbss=10_0 on theBenchmark for (3000ds/98885Mi)
% 0.22/0.43  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43  % (29736)fmb+10_1:1_sil=256000:fmbes=contour:i=214858:bce=on_0 on theBenchmark for (3000ds/214858Mi)
% 0.22/0.43  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.43  % (29740)ott-4_1:1_sil=4000:sp=reverse_arity:lcm=predicate:newcnf=on:i=115:bce=on:fd=off:fs=off:fsr=off_0 on theBenchmark for (3000ds/115Mi)
% 0.22/0.43  % (29734)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.22/0.43  % (29734)Terminated due to inappropriate strategy.
% 0.22/0.43  % (29734)------------------------------
% 0.22/0.43  % (29734)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.43  % (29734)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.43  % (29734)Termination reason: Inappropriate
% 0.22/0.43  
% 0.22/0.43  % (29734)Memory used [KB]: 921
% 0.22/0.43  % (29734)Time elapsed: 0.006 s
% 0.22/0.43  % (29734)Instructions burned: 8 (million)
% 0.22/0.43  % (29734)------------------------------
% 0.22/0.43  % (29734)------------------------------
% 0.22/0.44  % (29736)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.22/0.44  % (29736)Terminated due to inappropriate strategy.
% 0.22/0.44  % (29736)------------------------------
% 0.22/0.44  % (29736)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.44  % (29736)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.44  % (29736)Termination reason: Inappropriate
% 0.22/0.44  
% 0.22/0.44  % (29736)Memory used [KB]: 930
% 0.22/0.44  % (29736)Time elapsed: 0.008 s
% 0.22/0.44  % (29736)Instructions burned: 11 (million)
% 0.22/0.44  % (29736)------------------------------
% 0.22/0.44  % (29736)------------------------------
% 0.22/0.44  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.44  % (29739)ott+11_8:59_sil=16000:sp=occurrence:lsd=20:abs=on:i=146:aac=none:nm=16:fdi=10:rawr=on:nicw=on_0 on theBenchmark for (3000ds/146Mi)
% 0.22/0.44  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.44  % (29766)dis+11_1:3_bsr=unit_only:sil=2000:rp=on:newcnf=on:i=404:kws=precedence:lsd=100_0 on theBenchmark for (2999ds/404Mi)
% 0.22/0.49  % (29740)Instruction limit reached!
% 0.22/0.49  % (29740)------------------------------
% 0.22/0.49  % (29740)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.49  % (29740)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.49  % (29740)Termination reason: Time limit
% 0.22/0.49  % (29740)Termination phase: Saturation
% 0.22/0.49  
% 0.22/0.49  % (29740)Memory used [KB]: 2119
% 0.22/0.49  % (29740)Time elapsed: 0.058 s
% 0.22/0.49  % (29740)Instructions burned: 117 (million)
% 0.22/0.49  % (29738)Instruction limit reached!
% 0.22/0.49  % (29738)------------------------------
% 0.22/0.49  % (29738)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.49  % (29738)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.49  % (29738)Termination reason: Time limit
% 0.22/0.49  % (29738)Termination phase: Saturation
% 0.22/0.49  
% 0.22/0.49  % (29738)Memory used [KB]: 1815
% 0.22/0.49  % (29738)Time elapsed: 0.063 s
% 0.22/0.49  % (29738)Instructions burned: 106 (million)
% 0.22/0.49  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.49  % (29775)ott-21_1:1_sil=4000:sp=const_frequency:i=175:fsr=off:fs=off:av=off_0 on theBenchmark for (2999ds/175Mi)
% 0.22/0.49  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.49  % (29777)ott+33_1:1_to=lpo:sil=8000:sp=weighted_frequency:rp=on:i=270:nm=3:fsr=off:sac=on_0 on theBenchmark for (2999ds/270Mi)
% 0.22/0.51  % (29739)Instruction limit reached!
% 0.22/0.51  % (29739)------------------------------
% 0.22/0.51  % (29739)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.51  % (29739)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.51  % (29739)Termination reason: Time limit
% 0.22/0.51  % (29739)Termination phase: Saturation
% 0.22/0.51  
% 0.22/0.51  % (29739)Memory used [KB]: 1948
% 0.22/0.51  % (29739)Time elapsed: 0.078 s
% 0.22/0.51  % (29739)Instructions burned: 148 (million)
% 0.22/0.52  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.52  % (29798)ott+4_1:1_sil=2000:i=900:bd=off:fsr=off_0 on theBenchmark for (2998ds/900Mi)
% 0.22/0.52  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.52  % (29800)fmb+10_1:1_sil=8000:fde=unused:fmbes=contour:i=7859:nm=2:fmbswr=0_0 on theBenchmark for (2998ds/7859Mi)
% 0.22/0.53  % (29800)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.22/0.53  % (29800)Terminated due to inappropriate strategy.
% 0.22/0.53  % (29800)------------------------------
% 0.22/0.53  % (29800)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.53  % (29800)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.53  % (29800)Termination reason: Inappropriate
% 0.22/0.53  
% 0.22/0.53  % (29800)Memory used [KB]: 923
% 0.22/0.53  % (29800)Time elapsed: 0.004 s
% 0.22/0.53  % (29800)Instructions burned: 8 (million)
% 0.22/0.53  % (29800)------------------------------
% 0.22/0.53  % (29800)------------------------------
% 0.22/0.55  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.55  % (29807)ott+11_1:2_anc=none:sil=2000:sp=const_max:spb=units:s2a=on:i=2145:s2at=5.0:awrs=converge:awrsf=170:rawr=on:gs=on:fsr=off_0 on theBenchmark for (2998ds/2145Mi)
% 0.22/0.55  % (29775)Instruction limit reached!
% 0.22/0.55  % (29775)------------------------------
% 0.22/0.55  % (29775)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.55  % (29775)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.55  % (29775)Termination reason: Time limit
% 0.22/0.55  % (29775)Termination phase: Saturation
% 0.22/0.55  
% 0.22/0.55  % (29775)Memory used [KB]: 2524
% 0.22/0.55  % (29775)Time elapsed: 0.062 s
% 0.22/0.55  % (29775)Instructions burned: 177 (million)
% 0.22/0.56  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.56  % (29812)ott-30_1:1024_sil=4000:alpa=true:newcnf=on:i=1187:bs=unit_only:ins=1:amm=off_0 on theBenchmark for (2998ds/1187Mi)
% 0.22/0.59  % (29726)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.59  % (29813)fmb+10_1:1_sil=32000:i=23580:newcnf=on_0 on theBenchmark for (2998ds/23580Mi)
% 0.22/0.59  % (29813)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.22/0.59  % (29813)Terminated due to inappropriate strategy.
% 0.22/0.59  % (29813)------------------------------
% 0.22/0.59  % (29813)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.59  % (29813)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.59  % (29813)Termination reason: Inappropriate
% 0.22/0.59  
% 0.22/0.59  % (29813)Memory used [KB]: 862
% 0.22/0.59  % (29813)Time elapsed: 0.004 s
% 0.22/0.59  % (29813)Instructions burned: 8 (million)
% 0.22/0.59  % (29813)------------------------------
% 0.22/0.59  % (29813)------------------------------
% 1.71/0.60  % (29766)Instruction limit reached!
% 1.71/0.60  % (29766)------------------------------
% 1.71/0.60  % (29766)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.71/0.60  % (29766)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.71/0.60  % (29766)Termination reason: Time limit
% 1.71/0.60  % (29766)Termination phase: Saturation
% 1.71/0.60  
% 1.71/0.60  % (29766)Memory used [KB]: 4031
% 1.71/0.60  % (29766)Time elapsed: 0.158 s
% 1.71/0.60  % (29766)Instructions burned: 406 (million)
% 1.71/0.60  % (29777)Instruction limit reached!
% 1.71/0.60  % (29777)------------------------------
% 1.71/0.60  % (29777)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.71/0.60  % (29777)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.71/0.60  % (29777)Termination reason: Time limit
% 1.71/0.60  % (29777)Termination phase: Saturation
% 1.71/0.60  
% 1.71/0.60  % (29777)Memory used [KB]: 3685
% 1.71/0.60  % (29777)Time elapsed: 0.106 s
% 1.71/0.60  % (29777)Instructions burned: 270 (million)
% 1.87/0.63  % (29726)Running in auto input_syntax mode. Trying TPTP
% 1.87/0.63  % (29858)ott-10_1:1_sil=4000:i=1693_0 on theBenchmark for (2997ds/1693Mi)
% 1.87/0.63  % (29726)Running in auto input_syntax mode. Trying TPTP
% 1.87/0.63  % (29859)dis+21_1:1_sil=4000:gs=on:sac=on:newcnf=on:gsem=off:i=1735:gsaa=full_model:abs=on:anc=none_0 on theBenchmark for (2997ds/1735Mi)
% 1.87/0.65  % (29726)Running in auto input_syntax mode. Trying TPTP
% 1.87/0.65  % (29848)fmb+10_1:1_sil=32000:fmbss=17:fmbsr=2.0:i=2892_0 on theBenchmark for (2997ds/2892Mi)
% 1.87/0.65  % (29848)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 1.87/0.65  % (29848)Terminated due to inappropriate strategy.
% 1.87/0.65  % (29848)------------------------------
% 1.87/0.65  % (29848)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.87/0.65  % (29848)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.87/0.65  % (29848)Termination reason: Inappropriate
% 1.87/0.65  
% 1.87/0.65  % (29848)Memory used [KB]: 898
% 1.87/0.65  % (29848)Time elapsed: 0.006 s
% 1.87/0.65  % (29848)Instructions burned: 8 (million)
% 1.87/0.65  % (29848)------------------------------
% 1.87/0.65  % (29848)------------------------------
% 1.87/0.70  % (29726)Running in auto input_syntax mode. Trying TPTP
% 1.87/0.70  % (29872)fmb+10_1:1_fmbas=expand:sil=128000:i=131798:nm=2:fmbksg=on:fmbss=4:fmbsr=1.77:rp=on_0 on theBenchmark for (2997ds/131798Mi)
% 1.87/0.70  % (29872)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 1.87/0.70  % (29872)Terminated due to inappropriate strategy.
% 1.87/0.70  % (29872)------------------------------
% 1.87/0.70  % (29872)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 1.87/0.70  % (29872)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 1.87/0.70  % (29872)Termination reason: Inappropriate
% 1.87/0.70  
% 1.87/0.70  % (29872)Memory used [KB]: 939
% 1.87/0.70  % (29872)Time elapsed: 0.004 s
% 1.87/0.70  % (29872)Instructions burned: 9 (million)
% 1.87/0.70  % (29872)------------------------------
% 1.87/0.70  % (29872)------------------------------
% 2.31/0.74  % (29726)Running in auto input_syntax mode. Trying TPTP
% 2.31/0.74  % (29880)fmb+10_1:1_sil=16000:fmbss=16:i=3451:newcnf=on_0 on theBenchmark for (2996ds/3451Mi)
% 2.31/0.74  % (29880)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 2.31/0.74  % (29880)Terminated due to inappropriate strategy.
% 2.31/0.74  % (29880)------------------------------
% 2.31/0.74  % (29880)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 2.31/0.74  % (29880)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 2.31/0.74  % (29880)Termination reason: Inappropriate
% 2.31/0.74  
% 2.31/0.74  % (29880)Memory used [KB]: 862
% 2.31/0.74  % (29880)Time elapsed: 0.004 s
% 2.31/0.74  % (29880)Instructions burned: 8 (million)
% 2.31/0.74  % (29880)------------------------------
% 2.31/0.74  % (29880)------------------------------
% 2.31/0.78  % (29726)Running in auto input_syntax mode. Trying TPTP
% 2.31/0.78  % (29892)ott+11_1:64_sil=4000:rp=on:i=3978:bd=off:fsr=off_0 on theBenchmark for (2996ds/3978Mi)
% 2.64/0.85  % (29798)Instruction limit reached!
% 2.64/0.85  % (29798)------------------------------
% 2.64/0.85  % (29798)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 2.64/0.85  % (29798)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 2.64/0.85  % (29798)Termination reason: Time limit
% 2.64/0.85  % (29798)Termination phase: Saturation
% 2.64/0.85  
% 2.64/0.85  % (29798)Memory used [KB]: 8244
% 2.64/0.85  % (29798)Time elapsed: 0.330 s
% 2.64/0.85  % (29798)Instructions burned: 900 (million)
% 2.98/0.88  % (29726)Running in auto input_syntax mode. Trying TPTP
% 2.98/0.88  % (29924)dis+35_1:64_to=lpo:sil=32000:sp=occurrence:urr=on:sac=on:i=33091:fsr=off_0 on theBenchmark for (2995ds/33091Mi)
% 3.16/0.98  % (29812)Instruction limit reached!
% 3.16/0.98  % (29812)------------------------------
% 3.16/0.98  % (29812)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 3.16/0.98  % (29812)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 3.16/0.98  % (29812)Termination reason: Time limit
% 3.16/0.98  % (29812)Termination phase: Saturation
% 3.16/0.98  
% 3.16/0.98  % (29812)Memory used [KB]: 7963
% 3.16/0.98  % (29812)Time elapsed: 0.416 s
% 3.16/0.98  % (29812)Instructions burned: 1189 (million)
% 3.39/1.01  % (29726)Running in auto input_syntax mode. Trying TPTP
% 3.39/1.01  % (29925)dis-4_1:1_sil=16000:sp=const_frequency:sac=on:newcnf=on:i=9564_0 on theBenchmark for (2994ds/9564Mi)
% 5.99/1.21  % (29858)Instruction limit reached!
% 5.99/1.21  % (29858)------------------------------
% 5.99/1.21  % (29858)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 5.99/1.21  % (29858)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 5.99/1.21  % (29858)Termination reason: Time limit
% 5.99/1.21  % (29858)Termination phase: Saturation
% 5.99/1.21  
% 5.99/1.21  % (29858)Memory used [KB]: 7642
% 5.99/1.21  % (29858)Time elapsed: 0.576 s
% 5.99/1.21  % (29858)Instructions burned: 1695 (million)
% 6.19/1.24  % (29726)Running in auto input_syntax mode. Trying TPTP
% 6.19/1.24  % (29926)fmb+10_1:1_sil=64000:i=50409:nm=2:gsp=on_0 on theBenchmark for (2991ds/50409Mi)
% 6.19/1.24  % (29926)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 6.19/1.24  % (29926)Terminated due to inappropriate strategy.
% 6.19/1.24  % (29926)------------------------------
% 6.19/1.24  % (29926)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 6.19/1.24  % (29926)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 6.19/1.24  % (29926)Termination reason: Inappropriate
% 6.19/1.24  
% 6.19/1.24  % (29926)Memory used [KB]: 931
% 6.19/1.24  % (29926)Time elapsed: 0.004 s
% 6.19/1.24  % (29926)Instructions burned: 10 (million)
% 6.19/1.24  % (29926)------------------------------
% 6.19/1.24  % (29926)------------------------------
% 6.19/1.26  % (29807)Instruction limit reached!
% 6.19/1.26  % (29807)------------------------------
% 6.19/1.26  % (29807)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 6.19/1.26  % (29807)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 6.19/1.26  % (29807)Termination reason: Time limit
% 6.19/1.26  % (29807)Termination phase: Saturation
% 6.19/1.26  
% 6.19/1.26  % (29807)Memory used [KB]: 16222
% 6.19/1.26  % (29807)Time elapsed: 0.716 s
% 6.19/1.26  % (29807)Instructions burned: 2146 (million)
% 6.19/1.26  % (29859)Instruction limit reached!
% 6.19/1.26  % (29859)------------------------------
% 6.19/1.26  % (29859)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 6.19/1.26  % (29859)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 6.19/1.26  % (29859)Termination reason: Time limit
% 6.19/1.26  % (29859)Termination phase: Saturation
% 6.19/1.26  
% 6.19/1.26  % (29859)Memory used [KB]: 23156
% 6.19/1.26  % (29859)Time elapsed: 0.632 s
% 6.19/1.26  % (29859)Instructions burned: 1737 (million)
% 6.19/1.27  % (29726)Running in auto input_syntax mode. Trying TPTP
% 6.19/1.27  % (29927)dis+2_3:1_bsr=on:sil=64000:abs=on:i=10852:gsp=on:fs=off:fsr=off_0 on theBenchmark for (2991ds/10852Mi)
% 6.19/1.30  % (29726)Running in auto input_syntax mode. Trying TPTP
% 6.19/1.30  % (29928)dis+11_61:31_bsr=unit_only:sil=16000:sp=frequency:rp=on:newcnf=on:i=11327:uhcvi=on:rawr=on:abs=on:lsd=5:add=off_0 on theBenchmark for (2991ds/11327Mi)
% 6.19/1.30  % (29726)Running in auto input_syntax mode. Trying TPTP
% 6.19/1.30  % (29929)fmb+10_1:1_fmbas=expand:sil=128000:i=17908:nm=2:fmbss=15:gsp=on_0 on theBenchmark for (2991ds/17908Mi)
% 6.19/1.30  % (29929)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 6.19/1.30  % (29929)Terminated due to inappropriate strategy.
% 6.19/1.30  % (29929)------------------------------
% 6.19/1.30  % (29929)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 6.19/1.30  % (29929)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 6.19/1.30  % (29929)Termination reason: Inappropriate
% 6.19/1.30  
% 6.19/1.30  % (29929)Memory used [KB]: 931
% 6.19/1.30  % (29929)Time elapsed: 0.003 s
% 6.19/1.30  % (29929)Instructions burned: 10 (million)
% 6.19/1.30  % (29929)------------------------------
% 6.19/1.30  % (29929)------------------------------
% 6.73/1.33  % (29726)Running in auto input_syntax mode. Trying TPTP
% 6.73/1.33  % (29930)dis+11_1:1_anc=all:sil=64000:rp=on:newcnf=on:i=22636:alpa=false:atotf=0.1:gs=on_0 on theBenchmark for (2990ds/22636Mi)
% 10.44/1.84  % (29892)Instruction limit reached!
% 10.44/1.84  % (29892)------------------------------
% 10.44/1.84  % (29892)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 10.44/1.84  % (29892)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 10.44/1.84  % (29892)Termination reason: Time limit
% 10.44/1.84  % (29892)Termination phase: Saturation
% 10.44/1.84  
% 10.44/1.84  % (29892)Memory used [KB]: 12545
% 10.44/1.84  % (29892)Time elapsed: 1.066 s
% 10.44/1.84  % (29892)Instructions burned: 3978 (million)
% 10.44/1.87  % (29726)Running in auto input_syntax mode. Trying TPTP
% 10.44/1.87  % (29931)fmb+10_1:1_i=30223_0 on theBenchmark for (2985ds/30223Mi)
% 10.44/1.88  % (29931)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 10.44/1.88  % (29931)Terminated due to inappropriate strategy.
% 10.44/1.88  % (29931)------------------------------
% 10.44/1.88  % (29931)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 10.44/1.88  % (29931)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 10.44/1.88  % (29931)Termination reason: Inappropriate
% 10.44/1.88  
% 10.44/1.88  % (29931)Memory used [KB]: 898
% 10.44/1.88  % (29931)Time elapsed: 0.003 s
% 10.44/1.88  % (29931)Instructions burned: 8 (million)
% 10.44/1.88  % (29931)------------------------------
% 10.44/1.88  % (29931)------------------------------
% 10.44/1.91  % (29726)Running in auto input_syntax mode. Trying TPTP
% 10.44/1.91  % (29932)ott+11_8:1_sil=64000:i=37350:fsr=off:bsr=unit_only:newcnf=on_0 on theBenchmark for (2985ds/37350Mi)
% 20.73/3.36  % (29924)First to succeed.
% 20.73/3.37  % (29924)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29726"
% 20.73/3.38  % (29726)Running in auto input_syntax mode. Trying TPTP
% 20.73/3.38  % (29924)Refutation found. Thanks to Tanya!
% 20.73/3.38  % SZS status Theorem for theBenchmark
% 20.73/3.38  % SZS output start Proof for theBenchmark
% See solution above
% 20.73/3.38  % (29924)------------------------------
% 20.73/3.38  % (29924)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 20.73/3.38  % (29924)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 20.73/3.38  % (29924)Termination reason: Refutation
% 20.73/3.38  
% 20.73/3.38  % (29924)Memory used [KB]: 111066
% 20.73/3.38  % (29924)Time elapsed: 2.486 s
% 20.73/3.38  % (29924)Instructions burned: 9695 (million)
% 20.73/3.38  % (29924)------------------------------
% 20.73/3.38  % (29924)------------------------------
% 20.73/3.38  % (29726)Success in time 3 s
%------------------------------------------------------------------------------