%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ARI759_1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:49 AM UTC 2026
% Result : Unsatisfiable 3.26s 1.19s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 5 unt; 0 typ; 2 def)
% Number of atoms : 44 ( 39 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 43 ( 13 ~; 11 |; 15 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number arithmetic : 26 ( 0 atm; 5 fun; 21 num; 0 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 : 35 ( 33 usr; 3 prp; 0-4 aty)
% Number of functors : 395 ( 392 usr; 22 con; 0-9 aty)
% Number of variables : 25 ( 14 !; 11 ?; 25 :)
% 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,
int_max: ( $int * $int ) > $int ).
tff(func_def_14,type,
c_unit: c_type ).
tff(func_def_15,type,
pset_deref: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_16,type,
tag_id: c_type > c_type ).
tff(func_def_17,type,
offset_max_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_18,type,
neq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_19,type,
store_bytes: ( c_sorted * c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_20,type,
s2bool: c_sorted > c_Boolean ).
tff(func_def_21,type,
subtag_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_22,type,
abs_real: $real > $real ).
tff(func_def_23,type,
replace_bytes: ( c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_24,type,
neq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_25,type,
abs_int: $int > $int ).
tff(func_def_26,type,
c_Boolean_false: c_Boolean ).
tff(func_def_27,type,
bool_or: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_28,type,
eq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_29,type,
lt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_30,type,
block: c_type > c_type ).
tff(func_def_31,type,
log: $real > $real ).
tff(func_def_32,type,
pset: c_type > c_type ).
tff(func_def_33,type,
address: c_sorted > $int ).
tff(func_def_34,type,
shift: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_35,type,
exp: $real > $real ).
tff(func_def_36,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_37,type,
offset_min_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_38,type,
null: c_unsorted ).
tff(func_def_39,type,
eq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_40,type,
unit2u: 'Unit' > c_unsorted ).
tff(func_def_41,type,
pset_range_left: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_42,type,
le_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_43,type,
void_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_44,type,
s2real: c_sorted > $real ).
tff(func_def_45,type,
concat_bitvector: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_46,type,
pset_range_right: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_47,type,
int2u: $int > c_unsorted ).
tff(func_def_48,type,
int8_of_integer: $int > c_unsorted ).
tff(func_def_49,type,
s2unit: c_sorted > 'Unit' ).
tff(func_def_50,type,
s2int: c_sorted > $int ).
tff(func_def_51,type,
void_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_52,type,
c_real: c_type ).
tff(func_def_53,type,
real_max: ( $real * $real ) > $real ).
tff(func_def_54,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_55,type,
offset_max: ( c_sorted * c_sorted ) > $int ).
tff(func_def_56,type,
smtlib__select: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_57,type,
memory: ( c_type * c_type ) > c_type ).
tff(func_def_58,type,
real2u: $real > c_unsorted ).
tff(func_def_59,type,
int8: c_type ).
tff(func_def_60,type,
bw_and: ( $int * $int ) > $int ).
tff(func_def_61,type,
gt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_62,type,
c_sort: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_63,type,
offset_min: ( c_sorted * c_sorted ) > $int ).
tff(func_def_64,type,
typeof: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_65,type,
bitvector_of_int8: c_sorted > c_unsorted ).
tff(func_def_66,type,
void_P_tag: c_unsorted ).
tff(func_def_67,type,
char_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_68,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_69,type,
bottom_tag: c_unsorted ).
tff(func_def_70,type,
bitvector: c_type ).
tff(func_def_71,type,
integer_of_int8: c_sorted > $int ).
tff(func_def_72,type,
lsr: ( $int * $int ) > $int ).
tff(func_def_73,type,
pset_all: c_sorted > c_unsorted ).
tff(func_def_74,type,
pointer_address: c_sorted > c_unsorted ).
tff(func_def_75,type,
extract_bytes: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_76,type,
bool_and: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_77,type,
smtlib__ite: ( c_Boolean * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_78,type,
bool_xor: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_79,type,
ge_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_80,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_81,type,
c_bool: c_type ).
tff(func_def_82,type,
pset_singleton: c_sorted > c_unsorted ).
tff(func_def_83,type,
bitvector_of_void_P: c_sorted > c_unsorted ).
tff(func_def_84,type,
pointer: c_type > c_type ).
tff(func_def_85,type,
select_bytes: ( c_sorted * c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_86,type,
bool2u: c_Boolean > c_unsorted ).
tff(func_def_87,type,
void_P: c_type ).
tff(func_def_88,type,
char_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_89,type,
asr: ( $int * $int ) > $int ).
tff(func_def_90,type,
c_int: c_type ).
tff(func_def_91,type,
neq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_92,type,
int8_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_93,type,
alloc_table: c_type > c_type ).
tff(func_def_94,type,
sub_pointer: ( c_sorted * c_sorted ) > $int ).
tff(func_def_95,type,
char_P: c_type ).
tff(func_def_96,type,
real_min: ( $real * $real ) > $real ).
tff(func_def_97,type,
ge_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_98,type,
smtlib__store: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_110,type,
sK0: ( $int * c_unsorted * c_unsorted * c_type * $int ) > c_type ).
tff(func_def_111,type,
sK1: ( $int * c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_112,type,
sK2: c_unsorted > c_type ).
tff(func_def_113,type,
sK3: c_unsorted > c_sorted ).
tff(func_def_114,type,
sK4: ( c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_115,type,
sK5: ( c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_116,type,
sK6: ( c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_117,type,
sK7: ( c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_type ).
tff(func_def_118,type,
sK8: ( c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_type ).
tff(func_def_119,type,
sK9: ( c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).
tff(func_def_120,type,
sK10: ( c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).
tff(func_def_121,type,
sK11: ( c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).
tff(func_def_122,type,
sK12: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_123,type,
sK13: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_124,type,
sK14: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_125,type,
sK15: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_126,type,
sK16: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_127,type,
sK17: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_128,type,
sK18: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_129,type,
sK19: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_130,type,
sK20: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_131,type,
sK21: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_132,type,
sK22: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_133,type,
sK23: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_134,type,
sK24: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_135,type,
sK25: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_136,type,
sK26: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_137,type,
sK27: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_138,type,
sK28: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_139,type,
sK29: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_140,type,
sK30: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_141,type,
sK31: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_142,type,
sK32: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_143,type,
sK33: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_144,type,
sK34: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_145,type,
sK35: ( $int * $int ) > $int ).
tff(func_def_146,type,
sK36: ( $int * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_147,type,
sK37: ( $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_148,type,
sK38: ( $int * c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_149,type,
sK39: ( $int * c_unsorted * c_type * $int * c_unsorted ) > c_unsorted ).
tff(func_def_150,type,
sK40: ( $int * c_unsorted * c_type * $int * c_unsorted ) > $int ).
tff(func_def_151,type,
sK41: ( $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_152,type,
sK42: ( $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_153,type,
sK43: ( c_unsorted * c_unsorted * $int * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_154,type,
sK44: ( c_unsorted * c_unsorted * $int * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_155,type,
sK45: ( c_unsorted * c_unsorted * $int * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_156,type,
sK46: ( $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_157,type,
sK47: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_158,type,
sK48: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_159,type,
sK49: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_160,type,
sK50: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_161,type,
sK51: ( c_type * $int * c_unsorted * c_unsorted ) > $int ).
tff(func_def_162,type,
sK52: ( c_type * $int * c_unsorted * c_unsorted ) > $int ).
tff(func_def_163,type,
sK53: c_type ).
tff(func_def_164,type,
sK54: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_165,type,
sK55: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_166,type,
sK56: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_167,type,
sK57: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_168,type,
sK58: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_169,type,
sK59: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_170,type,
sK60: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_171,type,
sK61: ( c_unsorted * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_172,type,
sK62: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_173,type,
sK63: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_174,type,
sK64: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_175,type,
sK65: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_176,type,
sK66: ( $int * $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_177,type,
sK67: ( $int * $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_178,type,
sK68: ( $int * $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_179,type,
sK69: ( $int * $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_180,type,
sK70: ( $int * $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_181,type,
sK71: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_182,type,
sK72: ( $int * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_183,type,
sK73: ( $int * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_184,type,
sK74: c_unsorted > c_sorted ).
tff(func_def_185,type,
sK75: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_186,type,
sK76: ( c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_187,type,
sK77: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_188,type,
sK78: ( c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_189,type,
sK79: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_190,type,
sK80: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_191,type,
sK81: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_192,type,
sK82: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_193,type,
sK83: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_194,type,
sK84: c_type > c_type ).
tff(func_def_195,type,
sK85: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_196,type,
sK86: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_197,type,
sK87: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_198,type,
sK88: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_199,type,
sK89: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_200,type,
sK90: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_201,type,
sK91: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_202,type,
sK92: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_203,type,
sK93: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_204,type,
sK94: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_205,type,
sK95: c_unsorted ).
tff(func_def_206,type,
sK96: c_unsorted ).
tff(func_def_207,type,
sK97: c_unsorted ).
tff(func_def_208,type,
sK98: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_209,type,
sK99: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_210,type,
sK100: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_211,type,
sK101: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_212,type,
sK102: ( c_type * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_213,type,
sK103: ( c_type * $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_214,type,
sK104: ( $int * $int * c_unsorted * c_type * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_215,type,
sK105: ( $int * $int * c_unsorted * c_type * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_216,type,
sK106: ( $int * $int * c_unsorted * c_type * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_217,type,
sK107: ( $int * $int * c_unsorted * c_type * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_218,type,
sK108: ( $int * $int * c_unsorted * c_type * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_219,type,
sK109: ( $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_220,type,
sK110: ( $int * c_unsorted * c_type * c_unsorted ) > $int ).
tff(func_def_221,type,
sK111: ( $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_222,type,
sK112: ( $int * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_223,type,
sK113: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_224,type,
sK114: c_unsorted > c_sorted ).
tff(func_def_225,type,
sK115: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_type ).
tff(func_def_226,type,
sK116: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).
tff(func_def_227,type,
sK117: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_228,type,
sK118: ( $int * $int ) > $int ).
tff(func_def_229,type,
sK119: c_type > c_type ).
tff(func_def_230,type,
sK120: ( c_unsorted * c_type ) > c_type ).
tff(func_def_231,type,
sK121: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_232,type,
sK122: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_233,type,
sK123: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_234,type,
sK124: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_235,type,
sK125: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_236,type,
sK126: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_237,type,
sK127: ( $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_238,type,
sK128: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_239,type,
sK129: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_240,type,
sK130: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_241,type,
sK131: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_242,type,
sK132: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_243,type,
sK133: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_244,type,
sK134: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_245,type,
sK135: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_246,type,
sK136: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_247,type,
sK137: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_248,type,
sK138: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_249,type,
sK139: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_250,type,
sK140: ( $int * $int * c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_251,type,
sK141: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_252,type,
sK142: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_253,type,
sK143: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_254,type,
sK144: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_255,type,
sK145: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_256,type,
sK146: ( c_unsorted * c_type ) > c_type ).
tff(func_def_257,type,
sK147: c_unsorted > c_type ).
tff(func_def_258,type,
sK148: c_unsorted > c_sorted ).
tff(func_def_259,type,
sK149: ( $real * $real ) > $real ).
tff(func_def_260,type,
sK150: ( c_unsorted * c_type ) > c_type ).
tff(func_def_261,type,
sK151: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_262,type,
sK152: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_263,type,
sK153: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_264,type,
sK154: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_265,type,
sK155: c_type > c_type ).
tff(func_def_266,type,
sK156: ( $int * $int ) > $int ).
tff(func_def_267,type,
sK157: c_unsorted > c_type ).
tff(func_def_268,type,
sK158: c_unsorted > c_sorted ).
tff(func_def_269,type,
sK159: ( $int * $int * c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_270,type,
sK160: ( $int * $int * c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_271,type,
sK161: ( $int * $int * c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_272,type,
sK162: ( c_unsorted * $int * c_type * $int ) > c_type ).
tff(func_def_273,type,
sK163: ( c_unsorted * $int * c_type * $int ) > c_sorted ).
tff(func_def_274,type,
sK164: ( c_unsorted * c_unsorted * $int * $int * $int * $int ) > c_sorted ).
tff(func_def_275,type,
sK165: ( $int * $int ) > $int ).
tff(func_def_276,type,
sK166: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_277,type,
sK167: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_278,type,
sK168: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_279,type,
sK169: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_280,type,
sK170: ( $int * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_281,type,
sK171: ( $int * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_282,type,
sK172: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_283,type,
sK173: ( c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_284,type,
sK174: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_285,type,
sK175: ( $int * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_286,type,
sK176: ( $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_287,type,
sK177: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_288,type,
sK178: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_289,type,
sK179: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_290,type,
sK180: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_291,type,
sK181: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_292,type,
sK182: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_293,type,
sK183: c_unsorted > c_type ).
tff(func_def_294,type,
sK184: c_unsorted > c_sorted ).
tff(func_def_295,type,
sK185: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_296,type,
sK186: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_297,type,
sK187: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_298,type,
sK188: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_299,type,
sK189: ( c_unsorted * $int * c_unsorted * c_type ) > $int ).
tff(func_def_300,type,
sK190: ( c_unsorted * $int * c_unsorted * c_type ) > $int ).
tff(func_def_301,type,
sK191: ( $int * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_302,type,
sK192: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_303,type,
sK193: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_304,type,
sK194: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_305,type,
sK195: ( $int * c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_306,type,
sK196: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_307,type,
sK197: ( $int * c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_308,type,
sK198: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_309,type,
sK199: c_unsorted > c_type ).
tff(func_def_310,type,
sK200: c_unsorted > c_sorted ).
tff(func_def_311,type,
sK201: c_type ).
tff(func_def_312,type,
sK202: ( $int * c_unsorted * c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_313,type,
sK203: ( $int * c_unsorted * c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_314,type,
sK204: ( $int * c_unsorted * c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_315,type,
sK205: ( $int * c_unsorted * c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_316,type,
sK206: ( $int * c_unsorted * c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_317,type,
sK207: ( $int * c_unsorted * c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_318,type,
sK208: ( $int * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_319,type,
sK209: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_320,type,
sK210: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_unsorted ).
tff(func_def_321,type,
sK211: ( $int * c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_322,type,
sK212: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_323,type,
sK213: ( $int * c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_324,type,
sK214: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_325,type,
sK215: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_326,type,
sK216: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_327,type,
sK217: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_328,type,
sK218: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_329,type,
sK219: ( $real * $real ) > $real ).
tff(func_def_330,type,
sK220: ( $real * $real ) > $real ).
tff(func_def_331,type,
sK221: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_332,type,
sK222: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_333,type,
sK223: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_334,type,
sK224: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_335,type,
sK225: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_336,type,
sK226: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_337,type,
sK227: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_338,type,
sK228: ( c_unsorted * $int * $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_339,type,
sK229: ( c_unsorted * $int * $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_340,type,
sK230: ( c_unsorted * $int * $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_341,type,
sK231: ( c_unsorted * $int * $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_342,type,
sK232: ( c_unsorted * $int * $int * c_unsorted * c_type * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_343,type,
sK233: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_344,type,
sK234: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_345,type,
sK235: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_346,type,
sK236: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_347,type,
sK237: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_348,type,
sK238: c_unsorted > c_sorted ).
tff(func_def_349,type,
sK239: ( c_unsorted * c_type * $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_350,type,
sK240: ( c_unsorted * c_type * $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_351,type,
sK241: ( c_unsorted * c_type * $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_352,type,
sK242: ( c_unsorted * c_type * $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_353,type,
sK243: ( c_unsorted * c_type * $int * $int * c_unsorted * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_354,type,
sK244: ( $int * c_type * $int * c_unsorted * $int * $int ) > c_type ).
tff(func_def_355,type,
sK245: ( $int * c_type * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_356,type,
sK246: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_357,type,
sK247: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_358,type,
sK248: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_359,type,
sK249: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_360,type,
sK250: c_unsorted > c_type ).
tff(func_def_361,type,
sK251: c_unsorted > c_sorted ).
tff(func_def_362,type,
sK252: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_363,type,
sK253: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_364,type,
sK254: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_365,type,
sK255: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_366,type,
sK256: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_367,type,
sK257: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_368,type,
sK258: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_369,type,
sK259: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_370,type,
sK260: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_371,type,
sK261: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_372,type,
sK262: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_373,type,
sK263: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_374,type,
sK264: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_375,type,
sK265: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_376,type,
sK266: c_unsorted > c_sorted ).
tff(func_def_377,type,
sK267: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_378,type,
sK268: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_379,type,
sK269: ( $real * $real ) > $real ).
tff(func_def_380,type,
sK270: c_type > c_type ).
tff(func_def_381,type,
sK271: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_382,type,
sK272: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_383,type,
sK273: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_384,type,
sK274: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_385,type,
sK275: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_386,type,
sK276: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_387,type,
sK277: ( $int * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_388,type,
sK278: ( $int * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_389,type,
sK279: ( $int * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_390,type,
sK280: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_391,type,
sK281: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_392,type,
sK282: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_393,type,
sK283: ( c_type * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_394,type,
sK284: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_395,type,
sK285: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_396,type,
sK286: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_397,type,
sK287: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_398,type,
sK288: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_399,type,
sK289: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_400,type,
sK290: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_401,type,
sK291: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_402,type,
sK292: c_unsorted > $int ).
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,
subtag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_29,type,
valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_30,type,
pset_disjoint: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_31,type,
left_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(f165,axiom,
~ ! [X0: c_unsorted,X1: c_unsorted] :
( ( ( c_Boolean_true = c_Boolean_true )
& ( integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X1),c_sort(pointer(char_P),X0)))) = 1 ) )
=> ! [X2: c_unsorted] :
? [X3: c_type] :
( ( X3 = pointer(char_P) )
& ? [X4: c_sorted] :
( ( X4 = c_sort(X3,X0) )
& ( ( c_sort(X3,X2) = c_sort(X3,shift(X4,$uminus(1))) )
=> ( integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X1),X4))) != 0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_165) ).
tff(f377,plain,
? [X0: c_unsorted,X1: c_unsorted] :
( ? [X2: c_unsorted] :
! [X3: c_type] :
( ( pointer(char_P) != X3 )
| ! [X4: c_sorted] :
( ( ( c_sort(X3,X2) = c_sort(X3,shift(X4,$uminus(1))) )
& ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X1),X4))) ) )
| ( c_sort(X3,X0) != X4 ) ) )
& ( c_Boolean_true = c_Boolean_true )
& ( integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X1),c_sort(pointer(char_P),X0)))) = 1 ) ),
inference(ennf_transformation,[],[f165]) ).
tff(f378,plain,
? [X1: c_unsorted,X0: c_unsorted] :
( ? [X2: c_unsorted] :
! [X3: c_type] :
( ( pointer(char_P) != X3 )
| ! [X4: c_sorted] :
( ( ( c_sort(X3,X2) = c_sort(X3,shift(X4,$uminus(1))) )
& ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X1),X4))) ) )
| ( c_sort(X3,X0) != X4 ) ) )
& ( c_Boolean_true = c_Boolean_true )
& ( integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X1),c_sort(pointer(char_P),X0)))) = 1 ) ),
inference(flattening,[],[f377]) ).
tff(f500,plain,
? [X0: c_unsorted,X1: c_unsorted] :
( ? [X2: c_unsorted] :
! [X3: c_type] :
( ( pointer(char_P) != X3 )
| ! [X4: c_sorted] :
( ( ( c_sort(X3,X2) = c_sort(X3,shift(X4,$uminus(1))) )
& ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X0),X4))) ) )
| ( c_sort(X3,X1) != X4 ) ) )
& ( c_Boolean_true = c_Boolean_true )
& ( 1 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),X0),c_sort(pointer(char_P),X1)))) ) ),
inference(rectify,[],[f378]) ).
tff(f501,plain,
( ! [X3: c_type] :
( ( pointer(char_P) != X3 )
| ! [X4: c_sorted] :
( ( ( c_sort(X3,shift(X4,$uminus(1))) = c_sort(X3,sK97) )
& ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),X4))) ) )
| ( c_sort(X3,sK96) != X4 ) ) )
& ( c_Boolean_true = c_Boolean_true )
& ( 1 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),c_sort(pointer(char_P),sK96)))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK95,sK96,sK97]),skolemize(X0,sK95),skolemize(X1,sK96),skolemize(X2,sK97)],[f500]) ).
tff(f893,plain,
1 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),c_sort(pointer(char_P),sK96)))),
inference(cnf_transformation,[],[f501]) ).
tff(f895,plain,
! [X3: c_type,X4: c_sorted] :
( ( pointer(char_P) != X3 )
| ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),X4))) )
| ( c_sort(X3,sK96) != X4 ) ),
inference(cnf_transformation,[],[f501]) ).
tff(f1614,plain,
! [X4: c_sorted] :
( ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),X4))) )
| ( c_sort(pointer(char_P),sK96) != X4 ) ),
inference(equality_resolution,[],[f895]) ).
tff(f1615,plain,
0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),c_sort(pointer(char_P),sK96)))),
inference(equality_resolution,[],[f1614]) ).
tff(f1686,definition,
( spl293_7
<=> ( 1 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),c_sort(pointer(char_P),sK96)))) ) ),
introduced(definition,[new_symbols(definition,[spl293_7])],[avatar_definition]) ).
tff(f1689,plain,
spl293_7,
inference(avatar_split_clause,[],[f893,f1686]) ).
tff(f1706,definition,
( spl293_11
<=> ( 0 = integer_of_int8(c_sort(int8,smtlib__select(c_sort(memory(char_P,int8),sK95),c_sort(pointer(char_P),sK96)))) ) ),
introduced(definition,[new_symbols(definition,[spl293_11])],[avatar_definition]) ).
tff(f1709,plain,
spl293_11,
inference(avatar_split_clause,[],[f1615,f1706]) ).
tff(f1715,plain,
$false,
inference(avatar_smt_refutation,[],[f1709,f1689]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI759_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n026.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 21:05:12 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running first-order theorem proving
% 0.10/0.22 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.26/1.18 % (71049)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.26/1.18 % (71178)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3179258047:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.26/1.18 % (71178)Instruction limit reached!
% 3.26/1.18 % (71178)------------------------------
% 3.26/1.18 % (71178)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71178)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71178)Termination reason: Instruction limit
% 3.26/1.18 % (71178)Termination phase: Preprocessing 1
% 3.26/1.18 % (71178)Time elapsed: 0.003 s
% 3.26/1.18 % (71178)Peak memory usage: 86 MB
% 3.26/1.18 % (71178)Instructions burned: 9 (million)
% 3.26/1.18 % (71177)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=3877501261:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.26/1.18 % (71175)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2414859559:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.26/1.18 % (71176)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2635750931:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.26/1.18 % (71175)Instruction limit reached!
% 3.26/1.18 % (71175)------------------------------
% 3.26/1.18 % (71175)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71175)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71175)Termination reason: Instruction limit
% 3.26/1.18 % (71175)Termination phase: SInE selection
% 3.26/1.18 % (71175)Time elapsed: 0.006 s
% 3.26/1.18 % (71175)Peak memory usage: 86 MB
% 3.26/1.18 % (71175)Instructions burned: 12 (million)
% 3.26/1.18 % (71180)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=1434750646:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.26/1.18 % (71181)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3419566166:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.26/1.18 % (71179)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=1816972873:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.26/1.18 % (71181)Instruction limit reached!
% 3.26/1.18 % (71181)------------------------------
% 3.26/1.18 % (71181)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71181)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71181)Termination reason: Instruction limit
% 3.26/1.18 % (71181)Termination phase: Property scanning
% 3.26/1.18 % (71181)Time elapsed: 0.018 s
% 3.26/1.18 % (71181)Peak memory usage: 88 MB
% 3.26/1.18 % (71181)Instructions burned: 34 (million)
% 3.26/1.18 % (71179)Instruction limit reached!
% 3.26/1.18 % (71179)------------------------------
% 3.26/1.18 % (71179)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71179)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71179)Termination reason: Instruction limit
% 3.26/1.18 % (71179)Termination phase: Property scanning
% 3.26/1.18 % (71179)Time elapsed: 0.005 s
% 3.26/1.18 % (71179)Peak memory usage: 85 MB
% 3.26/1.18 % (71179)Instructions burned: 4 (million)
% 3.26/1.18 % (71180)Instruction limit reached!
% 3.26/1.18 % (71180)------------------------------
% 3.26/1.18 % (71180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71180)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71180)Termination reason: Instruction limit
% 3.26/1.18 % (71180)Termination phase: Saturation
% 3.26/1.18 % (71180)Time elapsed: 0.045 s
% 3.26/1.18 % (71180)Peak memory usage: 113 MB
% 3.26/1.18 % (71180)Instructions burned: 47 (million)
% 3.26/1.18 % (71176)First to succeed.
% 3.26/1.18 % (71176)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-71049"
% 3.26/1.18 % (71183)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=2088194197:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.26/1.18 % (71183)Refutation not found, incomplete strategy
% 3.26/1.18 % (71183)------------------------------
% 3.26/1.18 % (71183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71183)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71183)Termination reason: Refutation not found, incomplete strategy
% 3.26/1.18 % (71183)Time elapsed: 0.002 s
% 3.26/1.18 % (71183)Peak memory usage: 88 MB
% 3.26/1.18 % (71183)Instructions burned: 5 (million)
% 3.26/1.18 % (71177)Also succeeded, but the first one will report.
% 3.26/1.18 % (71189)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=3718144081:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.26/1.18 % (71189)Instruction limit reached!
% 3.26/1.18 % (71189)------------------------------
% 3.26/1.18 % (71189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71189)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71189)Termination reason: Instruction limit
% 3.26/1.18 % (71189)Termination phase: Property scanning
% 3.26/1.18 % (71189)Time elapsed: 0.016 s
% 3.26/1.18 % (71189)Peak memory usage: 87 MB
% 3.26/1.18 % (71189)Instructions burned: 30 (million)
% 3.26/1.18 % (71191)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=2806534017:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.26/1.18 % (71191)Instruction limit reached!
% 3.26/1.18 % (71191)------------------------------
% 3.26/1.18 % (71191)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.18 % (71191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.18 % (71191)CaDiCaL version: 2.1.3
% 3.26/1.18 % (71191)Termination reason: Instruction limit
% 3.26/1.18 % (71191)Termination phase: Clausification
% 3.26/1.18 % (71191)Time elapsed: 0.011 s
% 3.26/1.18 % (71191)Peak memory usage: 87 MB
% 3.26/1.18 % (71191)Instructions burned: 17 (million)
% 3.26/1.18 % (71193)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=953130482:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.26/1.19 % (71192)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=2815370381:i=24:canc=force:rtra=on_2998 on theBenchmark for (2998ds/24Mi)
% 3.26/1.19 % (71193)Instruction limit reached!
% 3.26/1.19 % (71193)------------------------------
% 3.26/1.19 % (71193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.19 % (71193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.19 % (71193)CaDiCaL version: 2.1.3
% 3.26/1.19 % (71193)Termination reason: Instruction limit
% 3.26/1.19 % (71193)Termination phase: Function definition elimination
% 3.26/1.19 % (71193)Time elapsed: 0.016 s
% 3.26/1.19 % (71193)Peak memory usage: 87 MB
% 3.26/1.19 % (71193)Instructions burned: 28 (million)
% 3.26/1.19 % (71183)------------------------------
% 3.26/1.19 % (71183)------------------------------
% 3.26/1.19 % (71192)Instruction limit reached!
% 3.26/1.19 % (71192)------------------------------
% 3.26/1.19 % (71192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.19 % (71192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.19 % (71192)CaDiCaL version: 2.1.3
% 3.26/1.19 % (71192)Termination reason: Instruction limit
% 3.26/1.19 % (71192)Termination phase: Property scanning
% 3.26/1.19 % (71192)Time elapsed: 0.023 s
% 3.26/1.19 % (71192)Peak memory usage: 87 MB
% 3.26/1.19 % (71192)Instructions burned: 24 (million)
% 3.26/1.19 % (71196)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=1557447111:i=85:gtgl=4:rtra=on:gtg=exists_sym_2996 on theBenchmark for (2996ds/85Mi)
% 3.26/1.19 % (71198)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=1458500250:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.26/1.19 % (71198)Instruction limit reached!
% 3.26/1.19 % (71198)------------------------------
% 3.26/1.19 % (71198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.26/1.19 % (71198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.26/1.19 % (71198)CaDiCaL version: 2.1.3
% 3.26/1.19 % (71198)Termination reason: Instruction limit
% 3.26/1.19 % (71198)Termination phase: Property scanning
% 3.26/1.19 % (71198)Time elapsed: 0.003 s
% 3.26/1.19 % (71198)Peak memory usage: 85 MB
% 3.26/1.19 % (71198)Instructions burned: 2 (million)
% 3.26/1.19 % (71176)Refutation found. Thanks to Tanya!
% 3.26/1.19 % SZS status Unsatisfiable for theBenchmark
% 3.26/1.19 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/1.40 % (71176)------------------------------
% 0.19/1.40 % (71176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.40 % (71176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.40 % (71176)CaDiCaL version: 2.1.3
% 0.19/1.40 % (71176)Termination reason: Refutation
% 0.19/1.40 % (71176)Time elapsed: 0.057 s
% 0.19/1.40 % (71176)Peak memory usage: 117 MB
% 0.19/1.40 % (71176)Instructions burned: 57 (million)
% 0.19/1.40 % (71176)------------------------------
% 0.19/1.40 % (71176)------------------------------
% 0.19/1.40 % (71049)Success in time 0.511 s
% 0.19/1.40 % Vampire exiting
%------------------------------------------------------------------------------