↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : ARI754_1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 09:33:48 AM UTC 2026

% Result   : Unsatisfiable 3.35s 1.19s
% Output   : Refutation 4.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   70 (  33 unt;   0 typ;   0 def)
%            Number of atoms       :  163 ( 118 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  121 (  28   ~;  33   |;  53   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number arithmetic     :  216 (  44 atm;  23 fun;  34 num; 115 var)
%            Number of types       :    8 (   5 usr;   2 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   36 (  32 usr;   1 prp; 0-4 aty)
%            Number of functors    :  394 ( 391 usr;  28 con; 0-9 aty)
%            Number of variables   :  287 ( 253   !;  34   ?; 287   :)

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

tff(type_def_6,type,
    'Unit': $tType ).

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

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

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

tff(func_def_0,type,
    lsl: ( $int * $int ) > $int ).

tff(func_def_1,type,
    char_P_tag: c_unsorted ).

tff(func_def_2,type,
    pset_union: ( c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_3,type,
    int_of_tag: c_sorted > $int ).

tff(func_def_4,type,
    bool_not: c_Boolean > c_Boolean ).

tff(func_def_5,type,
    int_min: ( $int * $int ) > $int ).

tff(func_def_6,type,
    c_Boolean_true: c_Boolean ).

tff(func_def_7,type,
    bitvector_of_char_P: c_sorted > c_unsorted ).

tff(func_def_8,type,
    base_block: c_sorted > c_unsorted ).

tff(func_def_9,type,
    downcast: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_10,type,
    pset_empty: c_unsorted ).

tff(func_def_11,type,
    pset_range: ( c_sorted * $int * $int ) > c_unsorted ).

tff(func_def_12,type,
    tag_table: c_type > c_type ).

tff(func_def_13,type,
    int32_of_integer: $int > c_unsorted ).

tff(func_def_14,type,
    int_max: ( $int * $int ) > $int ).

tff(func_def_15,type,
    c_unit: c_type ).

tff(func_def_16,type,
    pset_deref: ( c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_17,type,
    tag_id: c_type > c_type ).

tff(func_def_18,type,
    offset_max_bytes: ( c_sorted * c_sorted * $int ) > $int ).

tff(func_def_19,type,
    neq_int_bool: ( $int * $int ) > c_Boolean ).

tff(func_def_20,type,
    store_bytes: ( c_sorted * c_sorted * $int * $int * c_sorted ) > c_unsorted ).

tff(func_def_21,type,
    s2bool: c_sorted > c_Boolean ).

tff(func_def_22,type,
    subtag_bool: ( c_sorted * c_sorted ) > c_Boolean ).

tff(func_def_23,type,
    abs_real: $real > $real ).

tff(func_def_24,type,
    replace_bytes: ( c_sorted * $int * $int * c_sorted ) > c_unsorted ).

tff(func_def_25,type,
    neq_real_bool: ( $real * $real ) > c_Boolean ).

tff(func_def_26,type,
    abs_int: $int > $int ).

tff(func_def_27,type,
    c_Boolean_false: c_Boolean ).

tff(func_def_28,type,
    bool_or: ( c_Boolean * c_Boolean ) > c_Boolean ).

tff(func_def_29,type,
    eq_real_bool: ( $real * $real ) > c_Boolean ).

tff(func_def_30,type,
    lt_real_bool: ( $real * $real ) > c_Boolean ).

tff(func_def_31,type,
    block: c_type > c_type ).

tff(func_def_32,type,
    int32_of_bitvector: c_sorted > c_unsorted ).

tff(func_def_33,type,
    log: $real > $real ).

tff(func_def_34,type,
    bitvector_of_int32: c_sorted > c_unsorted ).

tff(func_def_35,type,
    pset: c_type > c_type ).

tff(func_def_36,type,
    address: c_sorted > $int ).

tff(func_def_37,type,
    shift: ( c_sorted * $int ) > c_unsorted ).

tff(func_def_38,type,
    exp: $real > $real ).

tff(func_def_39,type,
    gt_int_bool: ( $int * $int ) > c_Boolean ).

tff(func_def_40,type,
    offset_min_bytes: ( c_sorted * c_sorted * $int ) > $int ).

tff(func_def_41,type,
    null: c_unsorted ).

tff(func_def_42,type,
    eq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).

tff(func_def_43,type,
    unit2u: 'Unit' > c_unsorted ).

tff(func_def_44,type,
    pset_range_left: ( c_sorted * $int ) > c_unsorted ).

tff(func_def_45,type,
    le_real_bool: ( $real * $real ) > c_Boolean ).

tff(func_def_46,type,
    void_P_of_bitvector: c_sorted > c_unsorted ).

tff(func_def_47,type,
    s2real: c_sorted > $real ).

tff(func_def_48,type,
    concat_bitvector: ( c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_49,type,
    pset_range_right: ( c_sorted * $int ) > c_unsorted ).

tff(func_def_50,type,
    int2u: $int > c_unsorted ).

tff(func_def_51,type,
    int8_of_integer: $int > c_unsorted ).

tff(func_def_52,type,
    s2unit: c_sorted > 'Unit' ).

tff(func_def_53,type,
    s2int: c_sorted > $int ).

tff(func_def_54,type,
    void_P_of_pointer_address: c_sorted > c_unsorted ).

tff(func_def_55,type,
    c_real: c_type ).

tff(func_def_56,type,
    real_max: ( $real * $real ) > $real ).

tff(func_def_57,type,
    lt_int_bool: ( $int * $int ) > c_Boolean ).

tff(func_def_58,type,
    offset_max: ( c_sorted * c_sorted ) > $int ).

tff(func_def_59,type,
    smtlib__select: ( c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_60,type,
    memory: ( c_type * c_type ) > c_type ).

tff(func_def_61,type,
    real2u: $real > c_unsorted ).

tff(func_def_62,type,
    int8: c_type ).

tff(func_def_63,type,
    int32: c_type ).

tff(func_def_64,type,
    bw_and: ( $int * $int ) > $int ).

tff(func_def_65,type,
    gt_real_bool: ( $real * $real ) > c_Boolean ).

tff(func_def_66,type,
    c_sort: ( c_type * c_unsorted ) > c_sorted ).

tff(func_def_67,type,
    offset_min: ( c_sorted * c_sorted ) > $int ).

tff(func_def_68,type,
    typeof: ( c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_69,type,
    bitvector_of_int8: c_sorted > c_unsorted ).

tff(func_def_70,type,
    void_P_tag: c_unsorted ).

tff(func_def_71,type,
    char_P_of_pointer_address: c_sorted > c_unsorted ).

tff(func_def_72,type,
    le_int_bool: ( $int * $int ) > c_Boolean ).

tff(func_def_73,type,
    bottom_tag: c_unsorted ).

tff(func_def_74,type,
    bitvector: c_type ).

tff(func_def_75,type,
    integer_of_int8: c_sorted > $int ).

tff(func_def_76,type,
    lsr: ( $int * $int ) > $int ).

tff(func_def_77,type,
    pset_all: c_sorted > c_unsorted ).

tff(func_def_78,type,
    pointer_address: c_sorted > c_unsorted ).

tff(func_def_79,type,
    extract_bytes: ( c_sorted * $int * $int ) > c_unsorted ).

tff(func_def_80,type,
    bool_and: ( c_Boolean * c_Boolean ) > c_Boolean ).

tff(func_def_81,type,
    smtlib__ite: ( c_Boolean * c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_82,type,
    bool_xor: ( c_Boolean * c_Boolean ) > c_Boolean ).

tff(func_def_83,type,
    ge_real_bool: ( $real * $real ) > c_Boolean ).

tff(func_def_84,type,
    eq_int_bool: ( $int * $int ) > c_Boolean ).

tff(func_def_85,type,
    c_bool: c_type ).

tff(func_def_86,type,
    pset_singleton: c_sorted > c_unsorted ).

tff(func_def_87,type,
    bitvector_of_void_P: c_sorted > c_unsorted ).

tff(func_def_88,type,
    pointer: c_type > c_type ).

tff(func_def_89,type,
    select_bytes: ( c_sorted * c_sorted * $int * $int ) > c_unsorted ).

tff(func_def_90,type,
    bool2u: c_Boolean > c_unsorted ).

tff(func_def_91,type,
    void_P: c_type ).

tff(func_def_92,type,
    integer_of_int32: c_sorted > $int ).

tff(func_def_93,type,
    char_P_of_bitvector: c_sorted > c_unsorted ).

tff(func_def_94,type,
    asr: ( $int * $int ) > $int ).

tff(func_def_95,type,
    c_int: c_type ).

tff(func_def_96,type,
    neq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).

tff(func_def_97,type,
    int8_of_bitvector: c_sorted > c_unsorted ).

tff(func_def_98,type,
    alloc_table: c_type > c_type ).

tff(func_def_99,type,
    sub_pointer: ( c_sorted * c_sorted ) > $int ).

tff(func_def_100,type,
    x: c_unsorted ).

tff(func_def_101,type,
    char_P: c_type ).

tff(func_def_102,type,
    real_min: ( $real * $real ) > $real ).

tff(func_def_103,type,
    ge_int_bool: ( $int * $int ) > c_Boolean ).

tff(func_def_104,type,
    smtlib__store: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).

tff(func_def_121,type,
    sK0: ( c_unsorted * c_type * c_unsorted * $int ) > c_type ).

tff(func_def_122,type,
    sK1: ( c_unsorted * c_type * c_unsorted * $int ) > c_type ).

tff(func_def_123,type,
    sK2: ( c_unsorted * c_type * c_unsorted * $int ) > $int ).

tff(func_def_124,type,
    sK3: ( c_unsorted * c_type * c_unsorted * $int ) > c_unsorted ).

tff(func_def_125,type,
    sK4: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).

tff(func_def_126,type,
    sK5: ( c_unsorted * c_unsorted * c_type ) > c_type ).

tff(func_def_127,type,
    sK6: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_128,type,
    sK7: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_129,type,
    sK8: ( $int * c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_130,type,
    sK9: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_131,type,
    sK10: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_132,type,
    sK11: c_type > c_type ).

tff(func_def_133,type,
    sK12: ( c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_134,type,
    sK13: ( c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_135,type,
    sK14: ( c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_136,type,
    sK15: ( c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_137,type,
    sK16: ( c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_138,type,
    sK17: ( $int * $int * c_unsorted * c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_139,type,
    sK18: ( $int * $int * c_unsorted * c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_140,type,
    sK19: ( $int * $int * c_unsorted * c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_141,type,
    sK20: ( $int * $int * c_unsorted * c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_142,type,
    sK21: ( $int * $int * c_unsorted * c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_143,type,
    sK22: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_144,type,
    sK23: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_145,type,
    sK24: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_146,type,
    sK25: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_147,type,
    sK26: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_148,type,
    sK27: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_149,type,
    sK28: c_unsorted > c_sorted ).

tff(func_def_150,type,
    sK29: c_unsorted ).

tff(func_def_151,type,
    sK30: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_152,type,
    sK31: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_153,type,
    sK32: ( $int * $int * $int * c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_154,type,
    sK33: ( c_type * c_unsorted * $int * $int * $int * $int ) > c_type ).

tff(func_def_155,type,
    sK34: ( c_type * c_unsorted * $int * $int * $int * $int ) > c_sorted ).

tff(func_def_156,type,
    sK35: ( $int * c_unsorted * c_type * $int ) > c_type ).

tff(func_def_157,type,
    sK36: ( $int * c_unsorted * c_type * $int ) > c_sorted ).

tff(func_def_158,type,
    sK37: c_unsorted > c_sorted ).

tff(func_def_159,type,
    sK38: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_type ).

tff(func_def_160,type,
    sK39: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_type ).

tff(func_def_161,type,
    sK40: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_unsorted ).

tff(func_def_162,type,
    sK41: ( $int * c_type * c_unsorted * c_unsorted * $int ) > $int ).

tff(func_def_163,type,
    sK42: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_164,type,
    sK43: ( c_type * $int * c_unsorted * $int ) > c_type ).

tff(func_def_165,type,
    sK44: ( c_type * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_166,type,
    sK45: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_167,type,
    sK46: ( c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_168,type,
    sK47: ( c_unsorted * c_type * c_unsorted ) > c_unsorted ).

tff(func_def_169,type,
    sK48: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_170,type,
    sK49: ( $int * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_171,type,
    sK50: ( $int * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_172,type,
    sK51: ( $int * c_type * c_unsorted * c_unsorted ) > $int ).

tff(func_def_173,type,
    sK52: ( $int * c_type * c_unsorted * c_unsorted ) > c_unsorted ).

tff(func_def_174,type,
    sK53: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_175,type,
    sK54: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_176,type,
    sK55: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_177,type,
    sK56: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_178,type,
    sK57: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_179,type,
    sK58: c_unsorted > c_type ).

tff(func_def_180,type,
    sK59: c_unsorted > c_sorted ).

tff(func_def_181,type,
    sK60: ( $real * $real ) > $real ).

tff(func_def_182,type,
    sK61: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_183,type,
    sK62: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_184,type,
    sK63: ( $real * $real ) > $real ).

tff(func_def_185,type,
    sK64: ( c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_186,type,
    sK65: ( c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_187,type,
    sK66: ( c_type * c_unsorted ) > c_sorted ).

tff(func_def_188,type,
    sK67: ( c_unsorted * c_type ) > c_type ).

tff(func_def_189,type,
    sK68: ( c_unsorted * c_unsorted * c_type ) > c_type ).

tff(func_def_190,type,
    sK69: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_191,type,
    sK70: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_192,type,
    sK71: ( c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_193,type,
    sK72: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_194,type,
    sK73: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_195,type,
    sK74: ( c_unsorted * c_type ) > c_sorted ).

tff(func_def_196,type,
    sK75: c_type ).

tff(func_def_197,type,
    sK76: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_198,type,
    sK77: ( c_type * c_unsorted * c_unsorted ) > $int ).

tff(func_def_199,type,
    sK78: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).

tff(func_def_200,type,
    sK79: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_201,type,
    sK80: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_202,type,
    sK81: ( c_type * c_unsorted ) > c_sorted ).

tff(func_def_203,type,
    sK82: ( c_type * c_unsorted ) > c_sorted ).

tff(func_def_204,type,
    sK83: ( c_unsorted * $int * c_type * c_unsorted ) > c_type ).

tff(func_def_205,type,
    sK84: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).

tff(func_def_206,type,
    sK85: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).

tff(func_def_207,type,
    sK86: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_208,type,
    sK87: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_209,type,
    sK88: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_210,type,
    sK89: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_211,type,
    sK90: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).

tff(func_def_212,type,
    sK91: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).

tff(func_def_213,type,
    sK92: c_unsorted > c_type ).

tff(func_def_214,type,
    sK93: c_unsorted > c_sorted ).

tff(func_def_215,type,
    sK94: ( c_type * c_unsorted ) > c_sorted ).

tff(func_def_216,type,
    sK95: ( c_type * $int * $int * c_unsorted ) > c_type ).

tff(func_def_217,type,
    sK96: ( c_type * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_218,type,
    sK97: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_219,type,
    sK98: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).

tff(func_def_220,type,
    sK99: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_221,type,
    sK100: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_222,type,
    sK101: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_223,type,
    sK102: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_224,type,
    sK103: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_225,type,
    sK104: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_226,type,
    sK105: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_227,type,
    sK106: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_unsorted ).

tff(func_def_228,type,
    sK107: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_229,type,
    sK108: ( c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_230,type,
    sK109: ( c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_231,type,
    sK110: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_232,type,
    sK111: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_233,type,
    sK112: ( c_unsorted * c_unsorted * $int * c_type ) > $int ).

tff(func_def_234,type,
    sK113: ( c_unsorted * c_unsorted * $int * c_type * $int ) > c_type ).

tff(func_def_235,type,
    sK114: ( c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted * $int * $int * $int ) > c_type ).

tff(func_def_236,type,
    sK115: ( c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted * $int * $int * $int ) > c_type ).

tff(func_def_237,type,
    sK116: ( c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_238,type,
    sK117: ( c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted * $int * $int * $int ) > c_type ).

tff(func_def_239,type,
    sK118: ( c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_240,type,
    sK119: ( c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_241,type,
    sK120: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_242,type,
    sK121: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_243,type,
    sK122: c_type ).

tff(func_def_244,type,
    sK123: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_245,type,
    sK124: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_246,type,
    sK125: ( c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_247,type,
    sK126: ( c_unsorted * c_type * c_unsorted ) > c_unsorted ).

tff(func_def_248,type,
    sK127: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_249,type,
    sK128: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_250,type,
    sK129: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_251,type,
    sK130: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_252,type,
    sK131: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_253,type,
    sK132: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_254,type,
    sK133: c_type > c_type ).

tff(func_def_255,type,
    sK134: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_256,type,
    sK135: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_257,type,
    sK136: c_unsorted > c_sorted ).

tff(func_def_258,type,
    sK137: ( $int * c_unsorted * c_type * $int * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_259,type,
    sK138: ( $int * c_unsorted * c_type * $int * $int * c_unsorted * $int ) > c_sorted ).

tff(func_def_260,type,
    sK139: ( c_unsorted * c_unsorted * $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_261,type,
    sK140: ( c_unsorted * c_unsorted * $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_262,type,
    sK141: ( c_unsorted * c_unsorted * $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_263,type,
    sK142: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_264,type,
    sK143: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_265,type,
    sK144: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_266,type,
    sK145: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_267,type,
    sK146: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_268,type,
    sK147: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_269,type,
    sK148: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_270,type,
    sK149: ( c_type * $int * $int * c_unsorted ) > c_type ).

tff(func_def_271,type,
    sK150: ( c_type * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_272,type,
    sK151: ( c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_273,type,
    sK152: ( c_unsorted * $int * c_unsorted ) > c_sorted ).

tff(func_def_274,type,
    sK153: ( c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_275,type,
    sK154: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_276,type,
    sK155: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_277,type,
    sK156: ( c_unsorted * c_unsorted * c_type ) > c_type ).

tff(func_def_278,type,
    sK157: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_279,type,
    sK158: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_280,type,
    sK159: ( c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_281,type,
    sK160: ( c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_282,type,
    sK161: ( c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_283,type,
    sK162: ( c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_284,type,
    sK163: ( c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_285,type,
    sK164: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).

tff(func_def_286,type,
    sK165: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).

tff(func_def_287,type,
    sK166: ( c_unsorted * c_type * c_unsorted * $int ) > $int ).

tff(func_def_288,type,
    sK167: ( c_unsorted * c_type * c_unsorted * $int ) > $int ).

tff(func_def_289,type,
    sK168: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_290,type,
    sK169: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_291,type,
    sK170: ( c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_292,type,
    sK171: ( c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_293,type,
    sK172: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).

tff(func_def_294,type,
    sK173: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_295,type,
    sK174: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_296,type,
    sK175: ( $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_297,type,
    sK176: ( $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_298,type,
    sK177: ( $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_299,type,
    sK178: ( c_type * $int * $int * c_unsorted ) > c_type ).

tff(func_def_300,type,
    sK179: ( c_type * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_301,type,
    sK180: c_type > c_type ).

tff(func_def_302,type,
    sK181: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_303,type,
    sK182: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_304,type,
    sK183: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_305,type,
    sK184: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_306,type,
    sK185: ( c_type * c_unsorted ) > c_type ).

tff(func_def_307,type,
    sK186: ( c_type * c_unsorted ) > c_sorted ).

tff(func_def_308,type,
    sK187: c_unsorted > c_sorted ).

tff(func_def_309,type,
    sK188: c_type > c_type ).

tff(func_def_310,type,
    sK189: ( $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_311,type,
    sK190: ( $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_312,type,
    sK191: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_313,type,
    sK192: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).

tff(func_def_314,type,
    sK193: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_315,type,
    sK194: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).

tff(func_def_316,type,
    sK195: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_317,type,
    sK196: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_318,type,
    sK197: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).

tff(func_def_319,type,
    sK198: ( c_unsorted * $int * c_type * c_unsorted ) > c_type ).

tff(func_def_320,type,
    sK199: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).

tff(func_def_321,type,
    sK200: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_type ).

tff(func_def_322,type,
    sK201: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).

tff(func_def_323,type,
    sK202: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).

tff(func_def_324,type,
    sK203: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).

tff(func_def_325,type,
    sK204: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).

tff(func_def_326,type,
    sK205: ( $real * $real ) > $real ).

tff(func_def_327,type,
    sK206: c_unsorted > c_type ).

tff(func_def_328,type,
    sK207: c_unsorted > c_sorted ).

tff(func_def_329,type,
    sK208: ( $int * c_unsorted * $int * $int * $int ) > c_sorted ).

tff(func_def_330,type,
    sK209: c_unsorted > c_type ).

tff(func_def_331,type,
    sK210: c_unsorted > c_sorted ).

tff(func_def_332,type,
    sK211: c_unsorted > c_type ).

tff(func_def_333,type,
    sK212: c_unsorted > c_sorted ).

tff(func_def_334,type,
    sK213: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_335,type,
    sK214: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_336,type,
    sK215: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_337,type,
    sK216: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_338,type,
    sK217: ( $int * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_339,type,
    sK218: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_340,type,
    sK219: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_341,type,
    sK220: ( c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).

tff(func_def_342,type,
    sK221: ( c_unsorted * $int * c_type * c_unsorted * $int ) > $int ).

tff(func_def_343,type,
    sK222: ( c_unsorted * $int * c_type * c_unsorted * $int ) > c_unsorted ).

tff(func_def_344,type,
    sK223: ( c_unsorted * $int * c_type * c_unsorted * $int * $int * c_unsorted ) > c_type ).

tff(func_def_345,type,
    sK224: ( c_unsorted * $int * c_type * c_unsorted * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_346,type,
    sK225: ( c_unsorted * c_unsorted * $int * c_type ) > c_type ).

tff(func_def_347,type,
    sK226: ( c_unsorted * c_unsorted * $int * c_type ) > c_sorted ).

tff(func_def_348,type,
    sK227: ( c_unsorted * c_unsorted * $int * c_type ) > c_sorted ).

tff(func_def_349,type,
    sK228: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_350,type,
    sK229: ( c_unsorted * c_unsorted * $int * c_type * $int * $int ) > c_sorted ).

tff(func_def_351,type,
    sK230: ( c_unsorted * c_unsorted * $int * c_type * $int * $int ) > c_type ).

tff(func_def_352,type,
    sK231: ( c_unsorted * c_unsorted * $int * c_type * $int * $int ) > c_sorted ).

tff(func_def_353,type,
    sK232: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_354,type,
    sK233: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_355,type,
    sK234: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_356,type,
    sK235: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_357,type,
    sK236: ( c_unsorted * c_unsorted * $int * $int * c_type * $int * c_unsorted * c_unsorted * $int ) > c_type ).

tff(func_def_358,type,
    sK237: ( c_unsorted * c_unsorted * $int * $int * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_359,type,
    sK238: ( c_unsorted * c_unsorted * $int * $int * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_360,type,
    sK239: ( c_unsorted * c_unsorted * $int * $int * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_361,type,
    sK240: ( c_unsorted * c_unsorted * $int * $int * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).

tff(func_def_362,type,
    sK241: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_363,type,
    sK242: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_364,type,
    sK243: ( c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_365,type,
    sK244: ( c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_366,type,
    sK245: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_367,type,
    sK246: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_368,type,
    sK247: c_unsorted > c_type ).

tff(func_def_369,type,
    sK248: c_unsorted > c_sorted ).

tff(func_def_370,type,
    sK249: ( $real * $real ) > $real ).

tff(func_def_371,type,
    sK250: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_372,type,
    sK251: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_373,type,
    sK252: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_374,type,
    sK253: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_375,type,
    sK254: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_376,type,
    sK255: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).

tff(func_def_377,type,
    sK256: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_type ).

tff(func_def_378,type,
    sK257: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).

tff(func_def_379,type,
    sK258: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).

tff(func_def_380,type,
    sK259: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).

tff(func_def_381,type,
    sK260: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_type ).

tff(func_def_382,type,
    sK261: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).

tff(func_def_383,type,
    sK262: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).

tff(func_def_384,type,
    sK263: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_type ).

tff(func_def_385,type,
    sK264: ( c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).

tff(func_def_386,type,
    sK265: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).

tff(func_def_387,type,
    sK266: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_unsorted ).

tff(func_def_388,type,
    sK267: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).

tff(func_def_389,type,
    sK268: c_unsorted > c_sorted ).

tff(func_def_390,type,
    sK269: c_unsorted > $int ).

tff(func_def_391,type,
    sK270: c_unsorted > $int ).

tff(func_def_392,type,
    sK271: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_unsorted ).

tff(func_def_393,type,
    sK272: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_unsorted ).

tff(func_def_394,type,
    sK273: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).

tff(func_def_395,type,
    sK274: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_396,type,
    sK275: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).

tff(func_def_397,type,
    sK276: c_unsorted > c_sorted ).

tff(func_def_398,type,
    sK277: ( $int * c_unsorted * $int * $int * $int * c_unsorted ) > c_sorted ).

tff(func_def_399,type,
    sK278: ( c_unsorted * c_type ) > c_type ).

tff(func_def_400,type,
    sK279: ( c_unsorted * c_type ) > c_sorted ).

tff(func_def_405,type,
    '$inst280': $int ).

tff(func_def_406,type,
    '$inst281': $int ).

tff(func_def_407,type,
    '$inst282': $int ).

tff(func_def_408,type,
    '$inst283': $int ).

tff(func_def_409,type,
    '$inst284': $real ).

tff(func_def_410,type,
    '$inst285': $real ).

tff(pred_def_1,type,
    left_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).

tff(pred_def_2,type,
    strict_valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_3,type,
    root_tag: c_sorted > $o ).

tff(pred_def_4,type,
    alloc_extends: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_5,type,
    valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_6,type,
    valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_7,type,
    eq_int8: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_8,type,
    same_block: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_9,type,
    pset_included: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_10,type,
    strict_valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_11,type,
    in_pset: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_12,type,
    instanceof: ( c_sorted * c_sorted * c_sorted ) > $o ).

tff(pred_def_13,type,
    alloc_extends_except: ( c_sorted * c_sorted * c_sorted ) > $o ).

tff(pred_def_14,type,
    not_assigns: ( c_sorted * c_sorted * c_sorted * c_sorted ) > $o ).

tff(pred_def_15,type,
    valid_bitvector_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_16,type,
    parenttag: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_17,type,
    valid_pset: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_18,type,
    right_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).

tff(pred_def_19,type,
    strict_valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_20,type,
    valid_bitvector_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_21,type,
    right_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).

tff(pred_def_22,type,
    valid: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_23,type,
    full_separated: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_24,type,
    strict_valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_25,type,
    valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_26,type,
    fully_packed: ( c_sorted * c_sorted * c_sorted ) > $o ).

tff(pred_def_27,type,
    alloc_fresh: ( c_sorted * c_sorted * $int ) > $o ).

tff(pred_def_28,type,
    eq_int32: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_29,type,
    subtag: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_30,type,
    valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).

tff(pred_def_31,type,
    pset_disjoint: ( c_sorted * c_sorted ) > $o ).

tff(pred_def_32,type,
    left_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).

tff(f48,axiom,
    ! [X2: $int,X1: c_unsorted,X3: $int,X0: c_type] :
    ? [X4: c_type] :
      ( ( X4 = pointer(X0) )
      & ? [X5: c_sorted] :
          ( ( X5 = c_sort(X4,X1) )
          & ( $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X3))))
          <=> $less(X2,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_48) ).

tff(f62,axiom,
    ! [X1: c_unsorted,X0: c_type] :
    ? [X2: c_sorted] :
      ( ( sub_pointer(X2,X2) = 0 )
      & ( X2 = c_sort(pointer(X0),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_62) ).

tff(f64,axiom,
    ! [X3: $int,X1: c_unsorted,X2: c_unsorted,X0: c_type] :
    ? [X4: c_type] :
      ( ? [X6: c_sorted,X5: c_sorted] :
          ( ( X6 = c_sort(X4,X2) )
          & ( X5 = c_sort(X4,X1) )
          & ( sub_pointer(c_sort(X4,shift(X5,X3)),X6) = $sum(sub_pointer(X5,X6),X3) ) )
      & ( X4 = pointer(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_64) ).

tff(f120,axiom,
    ! [X4: c_unsorted,X3: $int,X5: c_unsorted,X0: $int,X2: $int,X1: $int] :
    ? [X6: c_sorted] :
      ( ( ( ( X1 = X3 )
          & ( X0 = X2 ) )
       => ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X4),X0,X1,X6)),X2,X3)) = X6 ) )
      & ( X6 = c_sort(bitvector,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_120) ).

tff(f121,axiom,
    ! [X4: c_unsorted,X1: $int,X5: c_unsorted,X0: $int,X2: $int,X3: $int] :
    ? [X6: c_sorted] :
      ( ( ( $lesseq($sum(X2,X3),X0)
          | $lesseq($sum(X0,X3),X2) )
       => ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X0,X1,c_sort(bitvector,X5))),X2,X3)) = c_sort(bitvector,extract_bytes(X6,X2,X3)) ) )
      & ( X6 = c_sort(bitvector,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_121) ).

tff(f137,axiom,
    ! [X0: c_unsorted] :
    ? [X1: c_type] :
      ( ( X1 = pointer(char_P) )
      & ? [X2: c_sorted] :
          ( ( X2 = c_sort(X1,X0) )
          & ( c_sort(X1,char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(X2)))) = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_137) ).

tff(f172,plain,
    ! [X4: c_unsorted,X1: $int,X5: c_unsorted,X0: $int,X2: $int,X3: $int] :
    ? [X6: c_sorted] :
      ( ( ( ~ $less(X0,$sum(X2,X3))
          | ~ $less(X2,$sum(X0,X3)) )
       => ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X0,X1,c_sort(bitvector,X5))),X2,X3)) = c_sort(bitvector,extract_bytes(X6,X2,X3)) ) )
      & ( X6 = c_sort(bitvector,X4) ) ),
    inference(theory_normalization,[],[f121]) ).

tff(f306,plain,
    ! [X0: $int,X3: c_type,X2: c_unsorted,X1: c_unsorted] :
    ? [X4: c_type] :
      ( ( pointer(X3) = X4 )
      & ? [X5: c_sorted,X6: c_sorted] :
          ( ( c_sort(X4,X2) = X5 )
          & ( sub_pointer(c_sort(X4,shift(X6,X0)),X5) = $sum(sub_pointer(X6,X5),X0) )
          & ( c_sort(X4,X1) = X6 ) ) ),
    inference(rectify,[],[f64]) ).

tff(f307,plain,
    ! [X1: c_type,X0: c_unsorted] :
    ? [X2: c_sorted] :
      ( ( sub_pointer(X2,X2) = 0 )
      & ( c_sort(pointer(X1),X0) = X2 ) ),
    inference(rectify,[],[f62]) ).

tff(f342,plain,
    ! [X0: $int,X1: c_unsorted,X3: c_type,X2: $int] :
    ? [X4: c_type] :
      ( ? [X5: c_sorted] :
          ( ( $less(X0,X2)
          <=> $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X2)))) )
          & ( X5 = c_sort(X4,X1) ) )
      & ( pointer(X3) = X4 ) ),
    inference(rectify,[],[f48]) ).

tff(f349,plain,
    ! [X0: c_unsorted,X2: c_unsorted,X3: $int,X4: $int,X1: $int,X5: $int] :
    ? [X6: c_sorted] :
      ( ( ( ( X3 = X4 )
          & ( X1 = X5 ) )
       => ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X0),X3,X5,X6)),X4,X1)) = X6 ) )
      & ( c_sort(bitvector,X2) = X6 ) ),
    inference(rectify,[],[f120]) ).

tff(f350,plain,
    ! [X1: $int,X5: $int,X4: $int,X0: c_unsorted,X2: c_unsorted,X3: $int] :
    ? [X6: c_sorted] :
      ( ( c_sort(bitvector,X0) = X6 )
      & ( ( ~ $less(X4,$sum(X3,X5))
          | ~ $less(X3,$sum(X4,X5)) )
       => ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X3,X1,c_sort(bitvector,X2))),X4,X5)) = c_sort(bitvector,extract_bytes(X6,X4,X5)) ) ) ),
    inference(rectify,[],[f172]) ).

tff(f362,plain,
    ! [X5: $int,X0: c_unsorted,X3: $int,X4: $int,X1: $int,X2: c_unsorted] :
    ? [X6: c_sorted] :
      ( ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X3,X1,c_sort(bitvector,X2))),X4,X5)) = c_sort(bitvector,extract_bytes(X6,X4,X5)) )
        | ( $less(X3,$sum(X4,X5))
          & $less(X4,$sum(X3,X5)) ) )
      & ( c_sort(bitvector,X0) = X6 ) ),
    inference(ennf_transformation,[],[f350]) ).

tff(f397,plain,
    ! [X0: c_unsorted,X2: c_unsorted,X3: $int,X4: $int,X1: $int,X5: $int] :
    ? [X6: c_sorted] :
      ( ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X0),X3,X5,X6)),X4,X1)) = X6 )
        | ( X3 != X4 )
        | ( X1 != X5 ) )
      & ( c_sort(bitvector,X2) = X6 ) ),
    inference(ennf_transformation,[],[f349]) ).

tff(f398,plain,
    ! [X1: $int,X5: $int,X3: $int,X2: c_unsorted,X4: $int,X0: c_unsorted] :
    ? [X6: c_sorted] :
      ( ( ( X3 != X4 )
        | ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X0),X3,X5,X6)),X4,X1)) = X6 )
        | ( X1 != X5 ) )
      & ( c_sort(bitvector,X2) = X6 ) ),
    inference(flattening,[],[f397]) ).

tff(f429,plain,
    ! [X0: $int,X1: $int,X2: $int,X3: c_unsorted,X4: $int,X5: c_unsorted] :
    ? [X6: c_sorted] :
      ( ( ( X2 != X4 )
        | ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X5),X2,X1,X6)),X4,X0)) = X6 )
        | ( X0 != X1 ) )
      & ( c_sort(bitvector,X3) = X6 ) ),
    inference(rectify,[],[f398]) ).

tff(f430,plain,
    ! [X0: $int,X1: $int,X2: $int,X3: c_unsorted,X4: $int,X5: c_unsorted] :
      ( ( ( X2 != X4 )
        | ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X5),X2,X1,sK32(X0,X1,X2,X3,X4,X5))),X4,X0)) = sK32(X0,X1,X2,X3,X4,X5) )
        | ( X0 != X1 ) )
      & ( c_sort(bitvector,X3) = sK32(X0,X1,X2,X3,X4,X5) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK32]),skolemize(X6,sK32(X0,X1,X2,X3,X4,X5))],[f429]) ).

tff(f433,plain,
    ! [X0: $int,X1: c_unsorted,X3: c_type,X2: $int] :
    ? [X4: c_type] :
      ( ? [X5: c_sorted] :
          ( ( $less(X0,X2)
            | ~ $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X2)))) )
          & ( $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X2))))
            | ~ $less(X0,X2) )
          & ( X5 = c_sort(X4,X1) ) )
      & ( pointer(X3) = X4 ) ),
    inference(nnf_transformation,[],[f342]) ).

tff(f434,plain,
    ! [X0: $int,X1: c_unsorted,X3: c_type,X2: $int] :
    ? [X4: c_type] :
      ( ? [X5: c_sorted] :
          ( ( $less(X0,X2)
            | ~ $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X2)))) )
          & ( $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X2))))
            | ~ $less(X0,X2) )
          & ( X5 = c_sort(X4,X1) ) )
      & ( pointer(X3) = X4 ) ),
    inference(flattening,[],[f433]) ).

tff(f435,plain,
    ! [X0: $int,X1: c_unsorted,X2: c_type,X3: $int] :
    ? [X4: c_type] :
      ( ? [X5: c_sorted] :
          ( ( $less(X0,X3)
            | ~ $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X3)))) )
          & ( $less(address(c_sort(X4,shift(X5,X0))),address(c_sort(X4,shift(X5,X3))))
            | ~ $less(X0,X3) )
          & ( X5 = c_sort(X4,X1) ) )
      & ( pointer(X2) = X4 ) ),
    inference(rectify,[],[f434]) ).

tff(f436,plain,
    ! [X0: $int,X1: c_unsorted,X2: c_type,X3: $int] :
      ( ( $less(X0,X3)
        | ~ $less(address(c_sort(sK35(X0,X1,X2,X3),shift(sK36(X0,X1,X2,X3),X0))),address(c_sort(sK35(X0,X1,X2,X3),shift(sK36(X0,X1,X2,X3),X3)))) )
      & ( $less(address(c_sort(sK35(X0,X1,X2,X3),shift(sK36(X0,X1,X2,X3),X0))),address(c_sort(sK35(X0,X1,X2,X3),shift(sK36(X0,X1,X2,X3),X3))))
        | ~ $less(X0,X3) )
      & ( sK36(X0,X1,X2,X3) = c_sort(sK35(X0,X1,X2,X3),X1) )
      & ( sK35(X0,X1,X2,X3) = pointer(X2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK35,sK36]),skolemize(X4,sK35(X0,X1,X2,X3)),skolemize(X5,sK36(X0,X1,X2,X3))],[f435]) ).

tff(f480,plain,
    ! [X0: c_type,X1: c_unsorted] :
    ? [X2: c_sorted] :
      ( ( sub_pointer(X2,X2) = 0 )
      & ( c_sort(pointer(X0),X1) = X2 ) ),
    inference(rectify,[],[f307]) ).

tff(f481,plain,
    ! [X0: c_type,X1: c_unsorted] :
      ( ( 0 = sub_pointer(sK66(X0,X1),sK66(X0,X1)) )
      & ( c_sort(pointer(X0),X1) = sK66(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK66]),skolemize(X2,sK66(X0,X1))],[f480]) ).

tff(f644,plain,
    ! [X0: c_unsorted] :
      ( ( pointer(char_P) = sK206(X0) )
      & ( sK207(X0) = c_sort(sK206(X0),X0) )
      & ( sK207(X0) = c_sort(sK206(X0),char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(sK207(X0))))) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK206,sK207]),skolemize(X1,sK206(X0)),skolemize(X2,sK207(X0))],[f137]) ).

tff(f654,plain,
    ! [X0: $int,X1: c_type,X2: c_unsorted,X3: c_unsorted] :
    ? [X4: c_type] :
      ( ( pointer(X1) = X4 )
      & ? [X5: c_sorted,X6: c_sorted] :
          ( ( c_sort(X4,X2) = X5 )
          & ( sub_pointer(c_sort(X4,shift(X6,X0)),X5) = $sum(sub_pointer(X6,X5),X0) )
          & ( c_sort(X4,X3) = X6 ) ) ),
    inference(rectify,[],[f306]) ).

tff(f655,plain,
    ! [X0: $int,X1: c_type,X2: c_unsorted,X3: c_unsorted] :
      ( ( pointer(X1) = sK217(X0,X1,X2,X3) )
      & ( sK218(X0,X1,X2,X3) = c_sort(sK217(X0,X1,X2,X3),X2) )
      & ( $sum(sub_pointer(sK219(X0,X1,X2,X3),sK218(X0,X1,X2,X3)),X0) = sub_pointer(c_sort(sK217(X0,X1,X2,X3),shift(sK219(X0,X1,X2,X3),X0)),sK218(X0,X1,X2,X3)) )
      & ( sK219(X0,X1,X2,X3) = c_sort(sK217(X0,X1,X2,X3),X3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK217,sK218,sK219]),skolemize(X4,sK217(X0,X1,X2,X3)),skolemize(X5,sK218(X0,X1,X2,X3)),skolemize(X6,sK219(X0,X1,X2,X3))],[f654]) ).

tff(f706,plain,
    ! [X0: $int,X1: c_unsorted,X2: $int,X3: $int,X4: $int,X5: c_unsorted] :
    ? [X6: c_sorted] :
      ( ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X2,X4,c_sort(bitvector,X5))),X3,X0)) = c_sort(bitvector,extract_bytes(X6,X3,X0)) )
        | ( $less(X2,$sum(X3,X0))
          & $less(X3,$sum(X2,X0)) ) )
      & ( c_sort(bitvector,X1) = X6 ) ),
    inference(rectify,[],[f362]) ).

tff(f707,plain,
    ! [X0: $int,X1: c_unsorted,X2: $int,X3: $int,X4: $int,X5: c_unsorted] :
      ( ( ( c_sort(bitvector,extract_bytes(sK277(X0,X1,X2,X3,X4,X5),X3,X0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(sK277(X0,X1,X2,X3,X4,X5),X2,X4,c_sort(bitvector,X5))),X3,X0)) )
        | ( $less(X2,$sum(X3,X0))
          & $less(X3,$sum(X2,X0)) ) )
      & ( c_sort(bitvector,X1) = sK277(X0,X1,X2,X3,X4,X5) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK277]),skolemize(X6,sK277(X0,X1,X2,X3,X4,X5))],[f706]) ).

tff(f757,plain,
    ! [X2: $int,X3: c_unsorted,X0: $int,X1: $int,X4: $int,X5: c_unsorted] : ( c_sort(bitvector,X3) = sK32(X0,X1,X2,X3,X4,X5) ),
    inference(cnf_transformation,[],[f430]) ).

tff(f758,plain,
    ! [X2: $int,X3: c_unsorted,X0: $int,X1: $int,X4: $int,X5: c_unsorted] :
      ( ( X2 != X4 )
      | ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X5),X2,X1,sK32(X0,X1,X2,X3,X4,X5))),X4,X0)) = sK32(X0,X1,X2,X3,X4,X5) )
      | ( X0 != X1 ) ),
    inference(cnf_transformation,[],[f430]) ).

tff(f762,plain,
    ! [X2: c_type,X3: $int,X0: $int,X1: c_unsorted] : ( sK35(X0,X1,X2,X3) = pointer(X2) ),
    inference(cnf_transformation,[],[f436]) ).

tff(f763,plain,
    ! [X2: c_type,X3: $int,X0: $int,X1: c_unsorted] : ( sK36(X0,X1,X2,X3) = c_sort(sK35(X0,X1,X2,X3),X1) ),
    inference(cnf_transformation,[],[f436]) ).

tff(f764,plain,
    ! [X2: c_type,X3: $int,X0: $int,X1: c_unsorted] :
      ( $less(address(c_sort(sK35(X0,X1,X2,X3),shift(sK36(X0,X1,X2,X3),X0))),address(c_sort(sK35(X0,X1,X2,X3),shift(sK36(X0,X1,X2,X3),X3))))
      | ~ $less(X0,X3) ),
    inference(cnf_transformation,[],[f436]) ).

tff(f833,plain,
    ! [X0: c_type,X1: c_unsorted] : ( c_sort(pointer(X0),X1) = sK66(X0,X1) ),
    inference(cnf_transformation,[],[f481]) ).

tff(f834,plain,
    ! [X0: c_type,X1: c_unsorted] : ( 0 = sub_pointer(sK66(X0,X1),sK66(X0,X1)) ),
    inference(cnf_transformation,[],[f481]) ).

tff(f1096,plain,
    ! [X0: c_unsorted] : ( sK207(X0) = c_sort(sK206(X0),char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(sK207(X0))))) ),
    inference(cnf_transformation,[],[f644]) ).

tff(f1097,plain,
    ! [X0: c_unsorted] : ( sK207(X0) = c_sort(sK206(X0),X0) ),
    inference(cnf_transformation,[],[f644]) ).

tff(f1098,plain,
    ! [X0: c_unsorted] : ( pointer(char_P) = sK206(X0) ),
    inference(cnf_transformation,[],[f644]) ).

tff(f1115,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( sK219(X0,X1,X2,X3) = c_sort(sK217(X0,X1,X2,X3),X3) ),
    inference(cnf_transformation,[],[f655]) ).

tff(f1116,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( $sum(sub_pointer(sK219(X0,X1,X2,X3),sK218(X0,X1,X2,X3)),X0) = sub_pointer(c_sort(sK217(X0,X1,X2,X3),shift(sK219(X0,X1,X2,X3),X0)),sK218(X0,X1,X2,X3)) ),
    inference(cnf_transformation,[],[f655]) ).

tff(f1117,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( sK218(X0,X1,X2,X3) = c_sort(sK217(X0,X1,X2,X3),X2) ),
    inference(cnf_transformation,[],[f655]) ).

tff(f1118,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( pointer(X1) = sK217(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f655]) ).

tff(f1214,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: c_unsorted,X4: $int,X5: c_unsorted] : ( c_sort(bitvector,X1) = sK277(X0,X1,X2,X3,X4,X5) ),
    inference(cnf_transformation,[],[f707]) ).

tff(f1216,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: c_unsorted,X4: $int,X5: c_unsorted] :
      ( ( c_sort(bitvector,extract_bytes(sK277(X0,X1,X2,X3,X4,X5),X3,X0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(sK277(X0,X1,X2,X3,X4,X5),X2,X4,c_sort(bitvector,X5))),X3,X0)) )
      | $less(X2,$sum(X3,X0)) ),
    inference(cnf_transformation,[],[f707]) ).

tff(f1236,plain,
    ! [X2: c_type,X3: $int,X0: $int,X1: c_unsorted] : ( sK36(X0,X1,X2,X3) = c_sort(pointer(X2),X1) ),
    inference(definition_unfolding,[],[f763,f762]) ).

tff(f1302,plain,
    ! [X0: c_unsorted] : ( c_sort(pointer(char_P),X0) = sK207(X0) ),
    inference(definition_unfolding,[],[f1097,f1098]) ).

tff(f1306,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( c_sort(pointer(X1),X2) = sK218(X0,X1,X2,X3) ),
    inference(definition_unfolding,[],[f1117,f1118]) ).

tff(f1307,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( sK219(X0,X1,X2,X3) = c_sort(pointer(X1),X3) ),
    inference(definition_unfolding,[],[f1115,f1118]) ).

tff(f1343,plain,
    ! [X2: $int,X3: c_unsorted,X0: $int,X1: $int,X4: $int,X5: c_unsorted] :
      ( ( X2 != X4 )
      | ( c_sort(bitvector,X3) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X5),X2,X1,c_sort(bitvector,X3))),X4,X0)) )
      | ( X0 != X1 ) ),
    inference(definition_unfolding,[],[f758,f757,f757]) ).

tff(f1346,plain,
    ! [X2: c_type,X3: $int,X0: $int,X1: c_unsorted] :
      ( $less(address(c_sort(pointer(X2),shift(c_sort(pointer(X2),X1),X0))),address(c_sort(pointer(X2),shift(c_sort(pointer(X2),X1),X3))))
      | ~ $less(X0,X3) ),
    inference(definition_unfolding,[],[f764,f762,f1236,f762,f1236]) ).

tff(f1375,plain,
    ! [X0: c_type,X1: c_unsorted] : ( 0 = sub_pointer(c_sort(pointer(X0),X1),c_sort(pointer(X0),X1)) ),
    inference(definition_unfolding,[],[f834,f833,f833]) ).

tff(f1477,plain,
    ! [X0: c_unsorted] : ( c_sort(pointer(char_P),X0) = c_sort(pointer(char_P),char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(c_sort(pointer(char_P),X0))))) ),
    inference(definition_unfolding,[],[f1096,f1302,f1098,f1302]) ).

tff(f1483,plain,
    ! [X2: c_unsorted,X3: c_unsorted,X0: $int,X1: c_type] : ( $sum(sub_pointer(c_sort(pointer(X1),X3),c_sort(pointer(X1),X2)),X0) = sub_pointer(c_sort(pointer(X1),shift(c_sort(pointer(X1),X3),X0)),c_sort(pointer(X1),X2)) ),
    inference(definition_unfolding,[],[f1116,f1307,f1306,f1118,f1307,f1306]) ).

tff(f1527,plain,
    ! [X2: $int,X3: $int,X0: $int,X1: c_unsorted,X4: $int,X5: c_unsorted] :
      ( $less(X2,$sum(X3,X0))
      | ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X2,X4,c_sort(bitvector,X5))),X3,X0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),X3,X0)) ) ),
    inference(definition_unfolding,[],[f1216,f1214,f1214]) ).

tff(f1539,plain,
    ! [X3: c_unsorted,X0: $int,X1: $int,X4: $int,X5: c_unsorted] :
      ( ( c_sort(bitvector,X3) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X5),X4,X1,c_sort(bitvector,X3))),X4,X0)) )
      | ( X0 != X1 ) ),
    inference(equality_resolution,[],[f1343]) ).

tff(f1540,plain,
    ! [X3: c_unsorted,X1: $int,X4: $int,X5: c_unsorted] : ( c_sort(bitvector,X3) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X5),X4,X1,c_sort(bitvector,X3))),X4,X1)) ),
    inference(equality_resolution,[],[f1539]) ).

tff(f1767,plain,
    ! [X2: c_type,X1: c_unsorted] :
      ( $less(address(c_sort(pointer(X2),shift(c_sort(pointer(X2),X1),0))),address(c_sort(pointer(X2),shift(c_sort(pointer(X2),X1),1))))
      | ~ $less(0,1) ),
    inference(instantiation,[],[f1346]) ).

tff(f1768,plain,
    ! [X2: c_type,X1: c_unsorted] : $less(address(c_sort(pointer(X2),shift(c_sort(pointer(X2),X1),0))),address(c_sort(pointer(X2),shift(c_sort(pointer(X2),X1),1)))),
    inference(interpreted_simplification,[],[f1767]) ).

tff(f1800,plain,
    ! [X2: $int,X0: c_type,X1: c_unsorted] : ( 0 = $sum(sub_pointer(c_sort(pointer(X0),X1),c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X2))),X2) ),
    inference(superposition,[],[f1483,f1375]) ).

tff(f1821,plain,
    ! [X1: c_unsorted,X4: $int,X5: c_unsorted] :
      ( $less(0,$sum(0,0))
      | ( c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),0,0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),0,X4,c_sort(bitvector,X5))),0,0)) ) ),
    inference(instantiation,[],[f1527]) ).

tff(f1822,plain,
    ! [X1: c_unsorted,X4: $int,X5: c_unsorted] : ( c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),0,0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),0,X4,c_sort(bitvector,X5))),0,0)) ),
    inference(interpreted_simplification,[],[f1821]) ).

tff(f1835,plain,
    ! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(bitvector,X0) = c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),0,0)) ),
    inference(superposition,[],[f1822,f1540]) ).

tff(f1857,plain,
    ! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(bitvector,X0) = c_sort(bitvector,X1) ),
    inference(superposition,[],[f1835,f1540]) ).

tff(f1915,plain,
    ! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(pointer(char_P),char_P_of_bitvector(c_sort(bitvector,X0))) = c_sort(pointer(char_P),X1) ),
    inference(superposition,[],[f1477,f1857]) ).

tff(f1957,plain,
    ! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(pointer(char_P),X0) = c_sort(pointer(char_P),X1) ),
    inference(superposition,[],[f1915,f1477]) ).

tff(f2058,plain,
    ! [X2: $int,X0: c_unsorted,X1: c_unsorted] : ( 0 = $sum(sub_pointer(c_sort(pointer(char_P),X1),c_sort(pointer(char_P),X0)),X2) ),
    inference(superposition,[],[f1800,f1957]) ).

tff(f2318,plain,
    ! [X2: $int] : ( 0 = X2 ),
    inference(arithmetic_subterm_generalization,[],[f2058]) ).

tff(f2338,plain,
    ! [X0: c_type,X1: c_unsorted] : $less(0,address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),1)))),
    inference(superposition,[],[f1768,f2318]) ).

tff(f2355,plain,
    $less(0,0),
    inference(forward_demodulation,[],[f2338,f2318]) ).

tff(f2356,plain,
    $false,
    inference(evaluation,[],[f2355]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ARI754_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n020.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 21:03:19 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running first-order theorem proving
% 0.08/0.22  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.35/1.19  % (555092)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.35/1.19  % (555101)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3917692541:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.35/1.19  % (555101)Instruction limit reached! 
% 3.35/1.19  % (555101)------------------------------
% 3.35/1.19  % (555101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555101)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555101)Termination reason: Instruction limit
% 3.35/1.19  % (555101)Termination phase: Preprocessing 1
% 3.35/1.19  % (555101)Time elapsed: 0.002 s
% 3.35/1.19  % (555101)Peak memory usage: 86 MB
% 3.35/1.19  % (555101)Instructions burned: 7 (million)
% 3.35/1.19  % (555097)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2817883443:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.35/1.19  % (555099)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2523676225:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.35/1.19  % (555100)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=370920837:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.35/1.19  % (555098)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=748336170:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.35/1.19  % (555103)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3027672153:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.35/1.19  % (555102)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=368922209:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.35/1.19  % (555100)Instruction limit reached! 
% 3.35/1.19  % (555100)------------------------------
% 3.35/1.19  % (555100)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555100)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555100)Termination reason: Instruction limit
% 3.35/1.19  % (555100)Termination phase: SInE selection
% 3.35/1.19  % (555100)Time elapsed: 0.004 s
% 3.35/1.19  % (555100)Peak memory usage: 85 MB
% 3.35/1.19  % (555100)Instructions burned: 7 (million)
% 3.35/1.19  % (555097)Instruction limit reached! 
% 3.35/1.19  % (555097)------------------------------
% 3.35/1.19  % (555097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555097)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555097)Termination reason: Instruction limit
% 3.35/1.19  % (555097)Termination phase: SInE selection
% 3.35/1.19  % (555097)Time elapsed: 0.007 s
% 3.35/1.19  % (555097)Peak memory usage: 85 MB
% 3.35/1.19  % (555097)Instructions burned: 13 (million)
% 3.35/1.19  % (555103)Instruction limit reached! 
% 3.35/1.19  % (555103)------------------------------
% 3.35/1.19  % (555103)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555103)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555103)Termination reason: Instruction limit
% 3.35/1.19  % (555103)Termination phase: Property scanning
% 3.35/1.19  % (555103)Time elapsed: 0.018 s
% 3.35/1.19  % (555103)Peak memory usage: 88 MB
% 3.35/1.19  % (555103)Instructions burned: 33 (million)
% 3.35/1.19  % (555102)Instruction limit reached! 
% 3.35/1.19  % (555102)------------------------------
% 3.35/1.19  % (555102)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555102)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555102)Termination reason: Instruction limit
% 3.35/1.19  % (555102)Termination phase: Saturation
% 3.35/1.19  % (555102)Time elapsed: 0.046 s
% 3.35/1.19  % (555102)Peak memory usage: 112 MB
% 3.35/1.19  % (555102)Instructions burned: 47 (million)
% 3.35/1.19  % (555105)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=1205194293:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.35/1.19  % (555105)Refutation not found, incomplete strategy
% 3.35/1.19  % (555105)------------------------------
% 3.35/1.19  % (555105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555105)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555105)Termination reason: Refutation not found, incomplete strategy
% 3.35/1.19  % (555105)Time elapsed: 0.002 s
% 3.35/1.19  % (555105)Peak memory usage: 88 MB
% 3.35/1.19  % (555105)Instructions burned: 5 (million)
% 3.35/1.19  % (555099)First to succeed.
% 3.35/1.19  % (555099)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-555092"
% 3.35/1.19  % (555113)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=582846600:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.35/1.19  % (555112)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=2462588552:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.35/1.19  % (555113)Instruction limit reached! 
% 3.35/1.19  % (555113)------------------------------
% 3.35/1.19  % (555113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555113)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555113)Termination reason: Instruction limit
% 3.35/1.19  % (555113)Termination phase: Preprocessing 3
% 3.35/1.19  % (555113)Time elapsed: 0.011 s
% 3.35/1.19  % (555113)Peak memory usage: 87 MB
% 3.35/1.19  % (555113)Instructions burned: 16 (million)
% 3.35/1.19  % (555112)Instruction limit reached! 
% 3.35/1.19  % (555112)------------------------------
% 3.35/1.19  % (555112)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555112)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555112)Termination reason: Instruction limit
% 3.35/1.19  % (555112)Termination phase: Property scanning
% 3.35/1.19  % (555112)Time elapsed: 0.017 s
% 3.35/1.19  % (555112)Peak memory usage: 87 MB
% 3.35/1.19  % (555112)Instructions burned: 32 (million)
% 3.35/1.19  % (555114)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=3005928549:i=24:canc=force:rtra=on_2998 on theBenchmark for (2998ds/24Mi)
% 3.35/1.19  % (555114)Instruction limit reached! 
% 3.35/1.19  % (555114)------------------------------
% 3.35/1.19  % (555114)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555114)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555114)Termination reason: Instruction limit
% 3.35/1.19  % (555114)Termination phase: Property scanning
% 3.35/1.19  % (555114)Time elapsed: 0.014 s
% 3.35/1.19  % (555114)Peak memory usage: 87 MB
% 3.35/1.19  % (555114)Instructions burned: 24 (million)
% 3.35/1.19  % (555115)ott+1010_8_to=lpo:sil=128000:si=on:norm_ineq=on:sp=unary_frequency:sos=on:gve=cautious:spb=goal_then_units:uwa=alasca_main_floor:tha=some:random_seed=3287410800:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.35/1.19  % (555098)Instruction limit reached! 
% 3.35/1.19  % (555098)------------------------------
% 3.35/1.19  % (555098)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555098)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555098)Termination reason: Instruction limit
% 3.35/1.19  % (555098)Termination phase: Saturation
% 3.35/1.19  % (555098)Time elapsed: 0.216 s
% 3.35/1.19  % (555098)Peak memory usage: 118 MB
% 3.35/1.19  % (555098)Instructions burned: 307 (million)
% 3.35/1.19  % (555105)------------------------------
% 3.35/1.19  % (555105)------------------------------
% 3.35/1.19  % (555115)Instruction limit reached! 
% 3.35/1.19  % (555115)------------------------------
% 3.35/1.19  % (555115)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555115)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555115)Termination reason: Instruction limit
% 3.35/1.19  % (555115)Termination phase: Function definition elimination
% 3.35/1.19  % (555115)Time elapsed: 0.016 s
% 3.35/1.19  % (555115)Peak memory usage: 87 MB
% 3.35/1.19  % (555115)Instructions burned: 28 (million)
% 3.35/1.19  % (555119)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=3054694430:i=85:gtgl=4:rtra=on:gtg=exists_sym_2996 on theBenchmark for (2996ds/85Mi)
% 3.35/1.19  % (555121)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=523196421:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.35/1.19  % (555121)Instruction limit reached! 
% 3.35/1.19  % (555121)------------------------------
% 3.35/1.19  % (555121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555121)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555121)Termination reason: Instruction limit
% 3.35/1.19  % (555121)Termination phase: Property scanning
% 3.35/1.19  % (555121)Time elapsed: 0.002 s
% 3.35/1.19  % (555121)Peak memory usage: 85 MB
% 3.35/1.19  % (555121)Instructions burned: 3 (million)
% 3.35/1.19  % (555125)dis+1010_128_isp=bottom:to=lpo:thi=overlap:prc=on:sas=z3:si=on:fd=preordered:random_seed=306553835:i=66:thsqd=64:thsqc=16:rtra=on:thsq=on:ev=force_2995 on theBenchmark for (2995ds/66Mi)
% 3.35/1.19  % (555122)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=3683691228:i=181:rtra=on:ss=axioms:ev=cautious_2996 on theBenchmark for (2996ds/181Mi)
% 3.35/1.19  % (555122)Refutation not found, incomplete strategy
% 3.35/1.19  % (555122)------------------------------
% 3.35/1.19  % (555122)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555122)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555122)Termination reason: Refutation not found, incomplete strategy
% 3.35/1.19  % (555122)Time elapsed: 0.004 s
% 3.35/1.19  % (555122)Peak memory usage: 88 MB
% 3.35/1.19  % (555122)Instructions burned: 5 (million)
% 3.35/1.19  % (555119)Instruction limit reached! 
% 3.35/1.19  % (555119)------------------------------
% 3.35/1.19  % (555119)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.19  % (555119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.19  % (555119)CaDiCaL version: 2.1.3
% 3.35/1.19  % (555119)Termination reason: Instruction limit
% 3.35/1.19  % (555119)Termination phase: Saturation
% 3.35/1.19  % (555119)Time elapsed: 0.048 s
% 3.35/1.19  % (555119)Peak memory usage: 90 MB
% 3.35/1.19  % (555119)Instructions burned: 87 (million)
% 3.35/1.19  % (555099)Refutation found. Thanks to Tanya!
% 3.35/1.19  % SZS status Unsatisfiable for theBenchmark
% 3.35/1.19  % SZS output start Proof for theBenchmark
% See solution above
% 4.33/1.34  % (555099)------------------------------
% 4.33/1.34  % (555099)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.33/1.34  % (555099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.33/1.34  % (555099)CaDiCaL version: 2.1.3
% 4.33/1.34  % (555099)Termination reason: Refutation
% 4.33/1.34  % (555099)Time elapsed: 0.095 s
% 4.33/1.34  % (555099)Peak memory usage: 118 MB
% 4.33/1.34  % (555099)Instructions burned: 115 (million)
% 4.33/1.34  % (555099)------------------------------
% 4.33/1.34  % (555099)------------------------------
% 4.33/1.34  % (555092)Success in time 0.539 s
% 4.33/1.34  % Vampire exiting
%------------------------------------------------------------------------------