%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ARI750_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 : n006.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.00s 1.13s
% Output : Refutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 9 unt; 0 typ; 1 def)
% Number of atoms : 91 ( 51 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 117 ( 53 ~; 30 |; 26 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 79 ( 32 atm; 0 fun; 32 num; 15 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 : 45 ( 40 usr; 2 prp; 0-4 aty)
% Number of functors : 429 ( 428 usr; 24 con; 0-9 aty)
% Number of variables : 73 ( 50 !; 23 ?; 73 :)
% 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,
'T': c_type ).
tff(func_def_37,type,
address: c_sorted > $int ).
tff(func_def_38,type,
shift: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_39,type,
exp: $real > $real ).
tff(func_def_40,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_41,type,
offset_min_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_42,type,
null: c_unsorted ).
tff(func_def_43,type,
eq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_44,type,
unit2u: 'Unit' > c_unsorted ).
tff(func_def_45,type,
pset_range_left: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_46,type,
le_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_47,type,
void_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_48,type,
s2real: c_sorted > $real ).
tff(func_def_49,type,
concat_bitvector: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_50,type,
pset_range_right: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_51,type,
int2u: $int > c_unsorted ).
tff(func_def_52,type,
int8_of_integer: $int > c_unsorted ).
tff(func_def_53,type,
bitvector_of_T: c_sorted > c_unsorted ).
tff(func_def_54,type,
s2unit: c_sorted > 'Unit' ).
tff(func_def_55,type,
s2int: c_sorted > $int ).
tff(func_def_56,type,
void_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_57,type,
'T_tag': c_unsorted ).
tff(func_def_58,type,
c_real: c_type ).
tff(func_def_59,type,
real_max: ( $real * $real ) > $real ).
tff(func_def_60,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_61,type,
offset_max: ( c_sorted * c_sorted ) > $int ).
tff(func_def_62,type,
'T_of_bitvector': c_sorted > c_unsorted ).
tff(func_def_63,type,
smtlib__select: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_64,type,
memory: ( c_type * c_type ) > c_type ).
tff(func_def_65,type,
real2u: $real > c_unsorted ).
tff(func_def_66,type,
int8: c_type ).
tff(func_def_67,type,
int32: c_type ).
tff(func_def_68,type,
bw_and: ( $int * $int ) > $int ).
tff(func_def_69,type,
gt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_70,type,
c_sort: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_71,type,
offset_min: ( c_sorted * c_sorted ) > $int ).
tff(func_def_72,type,
typeof: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_73,type,
bitvector_of_int8: c_sorted > c_unsorted ).
tff(func_def_74,type,
void_P_tag: c_unsorted ).
tff(func_def_75,type,
char_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_76,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_77,type,
bottom_tag: c_unsorted ).
tff(func_def_78,type,
bitvector: c_type ).
tff(func_def_79,type,
integer_of_int8: c_sorted > $int ).
tff(func_def_80,type,
lsr: ( $int * $int ) > $int ).
tff(func_def_81,type,
pset_all: c_sorted > c_unsorted ).
tff(func_def_82,type,
pointer_address: c_sorted > c_unsorted ).
tff(func_def_83,type,
extract_bytes: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_84,type,
bool_and: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_85,type,
'T_of_pointer_address': c_sorted > c_unsorted ).
tff(func_def_86,type,
smtlib__ite: ( c_Boolean * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_87,type,
bool_xor: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_88,type,
ge_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_89,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_90,type,
c_bool: c_type ).
tff(func_def_91,type,
pset_singleton: c_sorted > c_unsorted ).
tff(func_def_92,type,
bitvector_of_void_P: c_sorted > c_unsorted ).
tff(func_def_93,type,
pointer: c_type > c_type ).
tff(func_def_94,type,
select_bytes: ( c_sorted * c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_95,type,
bool2u: c_Boolean > c_unsorted ).
tff(func_def_96,type,
void_P: c_type ).
tff(func_def_97,type,
integer_of_int32: c_sorted > $int ).
tff(func_def_98,type,
char_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_99,type,
asr: ( $int * $int ) > $int ).
tff(func_def_100,type,
c_int: c_type ).
tff(func_def_101,type,
neq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_102,type,
int8_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_103,type,
alloc_table: c_type > c_type ).
tff(func_def_104,type,
sub_pointer: ( c_sorted * c_sorted ) > $int ).
tff(func_def_105,type,
char_P: c_type ).
tff(func_def_106,type,
real_min: ( $real * $real ) > $real ).
tff(func_def_107,type,
ge_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_108,type,
smtlib__store: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_122,type,
sK0: ( c_unsorted * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_123,type,
sK1: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_124,type,
sK2: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_125,type,
sK3: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_126,type,
sK4: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_127,type,
sK5: c_unsorted > c_sorted ).
tff(func_def_128,type,
sK6: ( c_type * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_129,type,
sK7: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_130,type,
sK8: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_131,type,
sK9: ( $real * $real ) > $real ).
tff(func_def_132,type,
sK10: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_133,type,
sK11: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_134,type,
sK12: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_135,type,
sK13: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_136,type,
sK14: ( $int * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_137,type,
sK15: ( $int * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_138,type,
sK16: ( c_type * $int * $int * c_unsorted ) > c_type ).
tff(func_def_139,type,
sK17: ( c_type * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_140,type,
sK18: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_141,type,
sK19: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_142,type,
sK20: c_unsorted > c_type ).
tff(func_def_143,type,
sK21: c_unsorted > c_sorted ).
tff(func_def_144,type,
sK22: c_type ).
tff(func_def_145,type,
sK23: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_146,type,
sK24: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_147,type,
sK25: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_148,type,
sK26: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_149,type,
sK27: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_150,type,
sK28: c_unsorted > c_type ).
tff(func_def_151,type,
sK29: c_unsorted > c_sorted ).
tff(func_def_152,type,
sK30: c_type > c_type ).
tff(func_def_153,type,
sK31: c_unsorted > c_sorted ).
tff(func_def_154,type,
sK32: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_155,type,
sK33: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_156,type,
sK34: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_157,type,
sK35: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_158,type,
sK36: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_159,type,
sK37: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_160,type,
sK38: ( c_type * c_unsorted * c_unsorted * $int ) > c_unsorted ).
tff(func_def_161,type,
sK39: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_162,type,
sK40: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_163,type,
sK41: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_164,type,
sK42: ( c_type * c_unsorted ) > c_type ).
tff(func_def_165,type,
sK43: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_166,type,
sK44: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_167,type,
sK45: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_168,type,
sK46: ( c_unsorted * $int * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_169,type,
sK47: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_170,type,
sK48: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_171,type,
sK49: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_172,type,
sK50: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_173,type,
sK51: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_174,type,
sK52: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_175,type,
sK53: ( $int * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_176,type,
sK54: ( $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_177,type,
sK55: ( $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_178,type,
sK56: ( c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_179,type,
sK57: ( c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_180,type,
sK58: ( c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_181,type,
sK59: ( c_unsorted * $int * $int * $int * $int ) > c_sorted ).
tff(func_def_182,type,
sK60: ( c_unsorted * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_183,type,
sK61: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_184,type,
sK62: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_185,type,
sK63: ( c_unsorted * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_186,type,
sK64: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_187,type,
sK65: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_188,type,
sK66: ( c_type * c_unsorted * $int * c_unsorted * $int ) > c_type ).
tff(func_def_189,type,
sK67: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * c_unsorted ) > c_type ).
tff(func_def_190,type,
sK68: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_191,type,
sK69: ( c_type * c_unsorted * $int * c_unsorted * $int ) > $int ).
tff(func_def_192,type,
sK70: ( c_type * c_unsorted * $int * c_unsorted * $int ) > c_unsorted ).
tff(func_def_193,type,
sK71: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_194,type,
sK72: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_195,type,
sK73: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_196,type,
sK74: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_197,type,
sK75: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_198,type,
sK76: c_unsorted > c_type ).
tff(func_def_199,type,
sK77: c_unsorted > c_sorted ).
tff(func_def_200,type,
sK78: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_201,type,
sK79: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_202,type,
sK80: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_203,type,
sK81: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_204,type,
sK82: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_205,type,
sK83: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_206,type,
sK84: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_207,type,
sK85: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_208,type,
sK86: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_209,type,
sK87: ( $int * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_210,type,
sK88: ( $int * c_unsorted * $int * c_type ) > c_sorted ).
tff(func_def_211,type,
sK89: ( $int * c_type * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_212,type,
sK90: ( $int * c_type * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_213,type,
sK91: ( $int * c_type * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_214,type,
sK92: ( $int * c_type * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_215,type,
sK93: ( $int * c_type * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_216,type,
sK94: ( $int * c_type * $int * $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_217,type,
sK95: ( c_unsorted * c_unsorted * c_type * $int ) > c_type ).
tff(func_def_218,type,
sK96: ( c_unsorted * c_unsorted * c_type * $int ) > c_unsorted ).
tff(func_def_219,type,
sK97: ( c_unsorted * c_unsorted * c_type * $int ) > $int ).
tff(func_def_220,type,
sK98: ( c_unsorted * c_unsorted * c_type * $int ) > c_type ).
tff(func_def_221,type,
sK99: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_222,type,
sK100: c_type ).
tff(func_def_223,type,
sK101: c_unsorted > $int ).
tff(func_def_224,type,
sK102: ( $int * $int ) > $int ).
tff(func_def_225,type,
sK103: ( $int * $int ) > $int ).
tff(func_def_226,type,
sK104: c_unsorted > c_type ).
tff(func_def_227,type,
sK105: c_unsorted > c_sorted ).
tff(func_def_228,type,
sK106: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_229,type,
sK107: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_230,type,
sK108: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_231,type,
sK109: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_232,type,
sK110: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_233,type,
sK111: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_234,type,
sK112: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_235,type,
sK113: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_236,type,
sK114: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_237,type,
sK115: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_238,type,
sK116: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_239,type,
sK117: ( c_unsorted * $int * c_unsorted * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_240,type,
sK118: ( c_unsorted * $int * c_unsorted * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_241,type,
sK119: ( c_unsorted * $int * c_unsorted * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_242,type,
sK120: ( $int * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_243,type,
sK121: ( $int * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_244,type,
sK122: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_245,type,
sK123: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_246,type,
sK124: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_247,type,
sK125: c_unsorted > c_sorted ).
tff(func_def_248,type,
sK126: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_249,type,
sK127: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_250,type,
sK128: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_251,type,
sK129: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_252,type,
sK130: c_unsorted > c_sorted ).
tff(func_def_253,type,
sK131: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_254,type,
sK132: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_255,type,
sK133: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_256,type,
sK134: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_257,type,
sK135: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_258,type,
sK136: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_259,type,
sK137: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_260,type,
sK138: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_261,type,
sK139: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_262,type,
sK140: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_263,type,
sK141: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_264,type,
sK142: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_265,type,
sK143: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_266,type,
sK144: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_267,type,
sK145: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_268,type,
sK146: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_269,type,
sK147: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_270,type,
sK148: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_271,type,
sK149: c_type > c_type ).
tff(func_def_272,type,
sK150: c_unsorted > c_type ).
tff(func_def_273,type,
sK151: c_unsorted > c_sorted ).
tff(func_def_274,type,
sK152: ( c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * c_unsorted ) > c_type ).
tff(func_def_275,type,
sK153: ( c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_276,type,
sK154: ( c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_277,type,
sK155: ( c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_278,type,
sK156: ( c_type * $int * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_279,type,
sK157: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_280,type,
sK158: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_281,type,
sK159: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_282,type,
sK160: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_283,type,
sK161: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_284,type,
sK162: c_unsorted > c_type ).
tff(func_def_285,type,
sK163: c_unsorted > c_sorted ).
tff(func_def_286,type,
sK164: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_287,type,
sK165: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_288,type,
sK166: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_289,type,
sK167: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_290,type,
sK168: c_unsorted > c_sorted ).
tff(func_def_291,type,
sK169: ( c_unsorted * $int * c_type * $int ) > c_type ).
tff(func_def_292,type,
sK170: ( c_unsorted * $int * c_type * $int ) > c_sorted ).
tff(func_def_293,type,
sK171: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_sorted ).
tff(func_def_294,type,
sK172: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_295,type,
sK173: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_296,type,
sK174: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_297,type,
sK175: ( c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_298,type,
sK176: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_299,type,
sK177: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_300,type,
sK178: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_301,type,
sK179: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_302,type,
sK180: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_303,type,
sK181: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_304,type,
sK182: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_305,type,
sK183: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_306,type,
sK184: ( c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_307,type,
sK185: ( c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_308,type,
sK186: ( c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_309,type,
sK187: ( c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_310,type,
sK188: ( c_unsorted * $int * c_unsorted * c_unsorted * $int * $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_311,type,
sK189: c_unsorted ).
tff(func_def_312,type,
sK190: c_unsorted ).
tff(func_def_313,type,
sK191: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_314,type,
sK192: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_315,type,
sK193: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_316,type,
sK194: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_317,type,
sK195: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_318,type,
sK196: ( $real * $real ) > $real ).
tff(func_def_319,type,
sK197: ( c_type * c_unsorted ) > c_type ).
tff(func_def_320,type,
sK198: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_321,type,
sK199: ( $int * $int * $int * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_322,type,
sK200: ( $int * $int * $int * c_unsorted * $int * c_type ) > c_sorted ).
tff(func_def_323,type,
sK201: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_324,type,
sK202: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_325,type,
sK203: ( $int * c_type * c_unsorted * c_unsorted ) > $int ).
tff(func_def_326,type,
sK204: ( $int * c_type * c_unsorted * c_unsorted ) > $int ).
tff(func_def_327,type,
sK205: c_type > c_type ).
tff(func_def_328,type,
sK206: c_unsorted > c_type ).
tff(func_def_329,type,
sK207: c_unsorted > c_sorted ).
tff(func_def_330,type,
sK208: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_331,type,
sK209: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_332,type,
sK210: ( $real * $real ) > $real ).
tff(func_def_333,type,
sK211: c_unsorted > c_type ).
tff(func_def_334,type,
sK212: c_unsorted > c_sorted ).
tff(func_def_335,type,
sK213: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_336,type,
sK214: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_337,type,
sK215: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_338,type,
sK216: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_339,type,
sK217: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_340,type,
sK218: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_341,type,
sK219: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_342,type,
sK220: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_343,type,
sK221: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_344,type,
sK222: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_345,type,
sK223: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_346,type,
sK224: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_347,type,
sK225: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_348,type,
sK226: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_349,type,
sK227: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_350,type,
sK228: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_351,type,
sK229: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_352,type,
sK230: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_353,type,
sK231: c_type ).
tff(func_def_354,type,
sK232: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_355,type,
sK233: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_356,type,
sK234: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_357,type,
sK235: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_358,type,
sK236: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_359,type,
sK237: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_360,type,
sK238: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_361,type,
sK239: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_362,type,
sK240: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_363,type,
sK241: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_364,type,
sK242: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_365,type,
sK243: ( $int * $int ) > $int ).
tff(func_def_366,type,
sK244: ( $int * $int ) > $int ).
tff(func_def_367,type,
sK245: ( $int * c_unsorted * c_unsorted * $int * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_368,type,
sK246: ( $int * c_unsorted * c_unsorted * $int * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_369,type,
sK247: ( $int * c_unsorted * c_unsorted * $int * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_370,type,
sK248: ( $int * c_unsorted * c_unsorted * $int * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_371,type,
sK249: ( $int * c_unsorted * c_unsorted * $int * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_372,type,
sK250: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_373,type,
sK251: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_374,type,
sK252: ( $int * $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_375,type,
sK253: ( $int * $int * c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_376,type,
sK254: ( $int * $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_377,type,
sK255: ( $int * $int * c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_378,type,
sK256: ( $int * $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_379,type,
sK257: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_380,type,
sK258: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_381,type,
sK259: ( c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_382,type,
sK260: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_383,type,
sK261: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_384,type,
sK262: ( c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_385,type,
sK263: ( $int * c_unsorted * c_unsorted * c_type * $int * $int ) > c_sorted ).
tff(func_def_386,type,
sK264: ( $int * c_unsorted * c_unsorted * c_type * $int * $int ) > c_type ).
tff(func_def_387,type,
sK265: ( $int * c_unsorted * c_unsorted * c_type * $int * $int ) > c_sorted ).
tff(func_def_388,type,
sK266: c_type > c_type ).
tff(func_def_389,type,
sK267: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_390,type,
sK268: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_391,type,
sK269: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_392,type,
sK270: c_unsorted > c_sorted ).
tff(func_def_393,type,
sK271: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_394,type,
sK272: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_395,type,
sK273: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_396,type,
sK274: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_397,type,
sK275: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_398,type,
sK276: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_399,type,
sK277: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_400,type,
sK278: c_unsorted > c_sorted ).
tff(func_def_401,type,
sK279: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_402,type,
sK280: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_403,type,
sK281: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_404,type,
sK282: ( $real * $real ) > $real ).
tff(func_def_405,type,
sK283: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_406,type,
sK284: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_407,type,
sK285: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_408,type,
sK286: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_409,type,
sK287: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_410,type,
sK288: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_411,type,
sK289: ( $int * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_412,type,
sK290: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_413,type,
sK291: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_414,type,
sK292: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_415,type,
sK293: ( c_unsorted * c_type * c_unsorted ) > $int ).
tff(func_def_416,type,
sK294: ( c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_417,type,
sK295: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_418,type,
sK296: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_419,type,
sK297: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_420,type,
sK298: c_unsorted > $int ).
tff(func_def_421,type,
sK299: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_422,type,
sK300: ( c_unsorted * c_unsorted * c_type * $int ) > c_type ).
tff(func_def_423,type,
sK301: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_424,type,
sK302: ( c_type * c_unsorted * c_unsorted * $int ) > $int ).
tff(func_def_425,type,
sK303: ( c_type * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_426,type,
sK304: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_427,type,
sK305: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_428,type,
sK306: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_429,type,
sK307: c_unsorted > c_type ).
tff(func_def_430,type,
sK308: c_unsorted > c_sorted ).
tff(func_def_431,type,
sK309: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_432,type,
sK310: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_433,type,
sK311: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_434,type,
sK312: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_435,type,
sK313: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_436,type,
sK314: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_437,type,
sK315: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_438,type,
sK316: ( c_unsorted * $int * c_type * c_unsorted ) > $int ).
tff(func_def_439,type,
sK317: ( c_unsorted * $int * c_type * c_unsorted ) > $int ).
tff(func_def_440,type,
sK318: ( c_type * c_unsorted ) > c_type ).
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_T: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_11,type,
strict_valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_12,type,
in_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_13,type,
instanceof: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_14,type,
alloc_extends_except: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_15,type,
not_assigns: ( c_sorted * c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_16,type,
valid_bitvector_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_17,type,
left_valid_struct_T: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_18,type,
valid_struct_T: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_19,type,
valid_root_T: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_20,type,
parenttag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_21,type,
valid_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_22,type,
valid_bitvector_struct_T: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_23,type,
right_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_24,type,
strict_valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_25,type,
valid_bitvector_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_26,type,
right_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_27,type,
valid: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_28,type,
full_separated: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_29,type,
strict_valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_30,type,
right_valid_struct_T: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_31,type,
valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_32,type,
fully_packed: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_33,type,
alloc_fresh: ( c_sorted * c_sorted * $int ) > $o ).
tff(pred_def_34,type,
eq_int32: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_35,type,
strict_valid_struct_T: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_36,type,
subtag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_37,type,
valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_38,type,
pset_disjoint: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_39,type,
left_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(f114,axiom,
! [X2: c_unsorted,X0: c_type,X1: c_unsorted] :
? [X3: c_type] :
( ( alloc_extends(c_sort(X3,X1),c_sort(X3,X2))
=> ! [X4: c_unsorted] :
? [X6: c_sorted,X5: c_sorted] :
( ( X6 = c_sort(pointer(X0),X4) )
& ( valid(X5,X6)
=> ( offset_max(X5,X6) = offset_max(c_sort(X3,X2),X6) ) )
& ( X5 = c_sort(X3,X1) ) ) )
& ( X3 = alloc_table(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_114) ).
tff(f184,axiom,
~ ! [X1: c_unsorted,X0: c_unsorted] :
? [X3: c_sorted,X2: c_sorted] :
( ? [X4: $int] :
( ( X4 = offset_max(X2,X3) )
& ( ( $lesseq(offset_min(X2,X3),0)
& $greatereq(X4,0) )
=> $lesseq(0,X4) ) )
& ( X3 = c_sort(pointer('T'),X0) )
& ( X2 = c_sort(alloc_table('T'),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_184) ).
tff(f216,plain,
~ ! [X1: c_unsorted,X0: c_unsorted] :
? [X3: c_sorted,X2: c_sorted] :
( ? [X4: $int] :
( ( X4 = offset_max(X2,X3) )
& ( ( ~ $less(0,offset_min(X2,X3))
& ~ $less(X4,0) )
=> ~ $less(X4,0) ) )
& ( X3 = c_sort(pointer('T'),X0) )
& ( X2 = c_sort(alloc_table('T'),X1) ) ),
inference(theory_normalization,[],[f184]) ).
tff(f303,plain,
! [X0: c_unsorted,X1: c_type,X2: c_unsorted] :
? [X3: c_type] :
( ( alloc_table(X1) = X3 )
& ( alloc_extends(c_sort(X3,X2),c_sort(X3,X0))
=> ! [X4: c_unsorted] :
? [X6: c_sorted,X5: c_sorted] :
( ( c_sort(pointer(X1),X4) = X5 )
& ( c_sort(X3,X2) = X6 )
& ( valid(X6,X5)
=> ( offset_max(X6,X5) = offset_max(c_sort(X3,X0),X5) ) ) ) ) ),
inference(rectify,[],[f114]) ).
tff(f304,plain,
~ ! [X1: c_unsorted,X0: c_unsorted] :
? [X3: c_sorted,X2: c_sorted] :
( ? [X4: $int] :
( ( offset_max(X3,X2) = X4 )
& ( ( ~ $less(X4,0)
& ~ $less(0,offset_min(X3,X2)) )
=> ~ $less(X4,0) ) )
& ( c_sort(alloc_table('T'),X0) = X3 )
& ( c_sort(pointer('T'),X1) = X2 ) ),
inference(rectify,[],[f216]) ).
tff(f356,plain,
! [X2: c_unsorted,X1: c_type,X0: c_unsorted] :
? [X3: c_type] : ( alloc_table(X1) = X3 ),
inference(pure_predicate_removal,[],[f303]) ).
tff(f367,plain,
? [X1: c_unsorted,X0: c_unsorted] :
! [X3: c_sorted,X2: c_sorted] :
( ! [X4: $int] :
( ( offset_max(X3,X2) != X4 )
| ( $less(X4,0)
& ~ $less(X4,0)
& ~ $less(0,offset_min(X3,X2)) ) )
| ( c_sort(alloc_table('T'),X0) != X3 )
| ( c_sort(pointer('T'),X1) != X2 ) ),
inference(ennf_transformation,[],[f304]) ).
tff(f368,plain,
? [X1: c_unsorted,X0: c_unsorted] :
! [X3: c_sorted,X2: c_sorted] :
( ( c_sort(alloc_table('T'),X0) != X3 )
| ( c_sort(pointer('T'),X1) != X2 )
| ! [X4: $int] :
( ( ~ $less(0,offset_min(X3,X2))
& ~ $less(X4,0)
& $less(X4,0) )
| ( offset_max(X3,X2) != X4 ) ) ),
inference(flattening,[],[f367]) ).
tff(f469,plain,
! [X1: c_type] :
? [X3: c_type] : ( alloc_table(X1) = X3 ),
inference(rectify,[],[f356]) ).
tff(f470,plain,
! [X1: c_type] : ( alloc_table(X1) = sK30(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK30]),skolemize(X3,sK30(X1))],[f469]) ).
tff(f644,plain,
? [X0: c_unsorted,X1: c_unsorted] :
! [X2: c_sorted,X3: c_sorted] :
( ( c_sort(alloc_table('T'),X1) != X2 )
| ( c_sort(pointer('T'),X0) != X3 )
| ! [X4: $int] :
( ( ~ $less(0,offset_min(X2,X3))
& ~ $less(X4,0)
& $less(X4,0) )
| ( offset_max(X2,X3) != X4 ) ) ),
inference(rectify,[],[f368]) ).
tff(f645,plain,
! [X2: c_sorted,X3: c_sorted] :
( ( c_sort(alloc_table('T'),sK190) != X2 )
| ( c_sort(pointer('T'),sK189) != X3 )
| ! [X4: $int] :
( ( ~ $less(0,offset_min(X2,X3))
& ~ $less(X4,0)
& $less(X4,0) )
| ( offset_max(X2,X3) != X4 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK189,sK190]),skolemize(X0,sK189),skolemize(X1,sK190)],[f644]) ).
tff(f854,plain,
! [X1: c_type] : ( alloc_table(X1) = sK30(X1) ),
inference(cnf_transformation,[],[f470]) ).
tff(f1145,plain,
! [X2: c_sorted,X3: c_sorted,X4: $int] :
( ( c_sort(alloc_table('T'),sK190) != X2 )
| ( c_sort(pointer('T'),sK189) != X3 )
| $less(X4,0)
| ( offset_max(X2,X3) != X4 ) ),
inference(cnf_transformation,[],[f645]) ).
tff(f1146,plain,
! [X2: c_sorted,X3: c_sorted,X4: $int] :
( ( c_sort(alloc_table('T'),sK190) != X2 )
| ( c_sort(pointer('T'),sK189) != X3 )
| ~ $less(X4,0)
| ( offset_max(X2,X3) != X4 ) ),
inference(cnf_transformation,[],[f645]) ).
tff(f1648,plain,
! [X2: c_sorted,X3: c_sorted,X4: $int] :
( ( c_sort(sK30('T'),sK190) != X2 )
| ( c_sort(pointer('T'),sK189) != X3 )
| ~ $less(X4,0)
| ( offset_max(X2,X3) != X4 ) ),
inference(definition_unfolding,[],[f1146,f854]) ).
tff(f1649,plain,
! [X2: c_sorted,X3: c_sorted,X4: $int] :
( ( c_sort(sK30('T'),sK190) != X2 )
| ( c_sort(pointer('T'),sK189) != X3 )
| $less(X4,0)
| ( offset_max(X2,X3) != X4 ) ),
inference(definition_unfolding,[],[f1145,f854]) ).
tff(f1804,plain,
! [X3: c_sorted,X4: $int] :
( ( c_sort(pointer('T'),sK189) != X3 )
| ~ $less(X4,0)
| ( offset_max(c_sort(sK30('T'),sK190),X3) != X4 ) ),
inference(equality_resolution,[],[f1648]) ).
tff(f1805,plain,
! [X4: $int] :
( ~ $less(X4,0)
| ( offset_max(c_sort(sK30('T'),sK190),c_sort(pointer('T'),sK189)) != X4 ) ),
inference(equality_resolution,[],[f1804]) ).
tff(f1806,plain,
~ $less(offset_max(c_sort(sK30('T'),sK190),c_sort(pointer('T'),sK189)),0),
inference(equality_resolution,[],[f1805]) ).
tff(f1807,plain,
! [X3: c_sorted,X4: $int] :
( ( c_sort(pointer('T'),sK189) != X3 )
| $less(X4,0)
| ( offset_max(c_sort(sK30('T'),sK190),X3) != X4 ) ),
inference(equality_resolution,[],[f1649]) ).
tff(f1808,plain,
! [X4: $int] :
( $less(X4,0)
| ( offset_max(c_sort(sK30('T'),sK190),c_sort(pointer('T'),sK189)) != X4 ) ),
inference(equality_resolution,[],[f1807]) ).
tff(f1809,plain,
$less(offset_max(c_sort(sK30('T'),sK190),c_sort(pointer('T'),sK189)),0),
inference(equality_resolution,[],[f1808]) ).
tff(f1905,definition,
( spl319_13
<=> $less(offset_max(c_sort(sK30('T'),sK190),c_sort(pointer('T'),sK189)),0) ),
introduced(definition,[new_symbols(definition,[spl319_13])],[avatar_definition]) ).
tff(f1908,plain,
spl319_13,
inference(avatar_split_clause,[],[f1809,f1905]) ).
tff(f1914,plain,
~ spl319_13,
inference(avatar_split_clause,[],[f1806,f1905]) ).
tff(f1915,plain,
$false,
inference(avatar_smt_refutation,[],[f1914,f1908]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ARI750_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n006.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 21:01:55 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/0.21 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.00/1.13 % (195182)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.00/1.13 % (195187)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1042480532:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.00/1.13 % (195187)Instruction limit reached!
% 3.00/1.13 % (195187)------------------------------
% 3.00/1.13 % (195187)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195187)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195187)Termination reason: Instruction limit
% 3.00/1.13 % (195187)Termination phase: Preprocessing 3
% 3.00/1.13 % (195187)Time elapsed: 0.004 s
% 3.00/1.13 % (195187)Peak memory usage: 86 MB
% 3.00/1.13 % (195187)Instructions burned: 14 (million)
% 3.00/1.13 % (195193)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=4227893435:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.00/1.13 % (195188)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=2762538708:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.00/1.13 % (195191)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=4055571884:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.00/1.13 % (195189)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=1251539660:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.00/1.13 % (195190)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=1185181686:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.00/1.13 % (195192)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=789312676:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.00/1.13 % (195191)Instruction limit reached!
% 3.00/1.13 % (195191)------------------------------
% 3.00/1.13 % (195191)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195191)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195191)Termination reason: Instruction limit
% 3.00/1.13 % (195191)Termination phase: Property scanning
% 3.00/1.13 % (195191)Time elapsed: 0.003 s
% 3.00/1.13 % (195191)Peak memory usage: 85 MB
% 3.00/1.13 % (195191)Instructions burned: 5 (million)
% 3.00/1.13 % (195190)Instruction limit reached!
% 3.00/1.13 % (195190)------------------------------
% 3.00/1.13 % (195190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195190)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195190)Termination reason: Instruction limit
% 3.00/1.13 % (195190)Termination phase: SInE selection
% 3.00/1.13 % (195190)Time elapsed: 0.004 s
% 3.00/1.13 % (195190)Peak memory usage: 85 MB
% 3.00/1.13 % (195190)Instructions burned: 7 (million)
% 3.00/1.13 % (195193)Instruction limit reached!
% 3.00/1.13 % (195193)------------------------------
% 3.00/1.13 % (195193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195193)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195193)Termination reason: Instruction limit
% 3.00/1.13 % (195193)Termination phase: Function definition elimination
% 3.00/1.13 % (195193)Time elapsed: 0.019 s
% 3.00/1.13 % (195193)Peak memory usage: 87 MB
% 3.00/1.13 % (195193)Instructions burned: 34 (million)
% 3.00/1.13 % (195192)Instruction limit reached!
% 3.00/1.13 % (195192)------------------------------
% 3.00/1.13 % (195192)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195192)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195192)Termination reason: Instruction limit
% 3.00/1.13 % (195192)Termination phase: Saturation
% 3.00/1.13 % (195192)Time elapsed: 0.045 s
% 3.00/1.13 % (195192)Peak memory usage: 113 MB
% 3.00/1.13 % (195192)Instructions burned: 46 (million)
% 3.00/1.13 % (195188)First to succeed.
% 3.00/1.13 % (195188)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-195182"
% 3.00/1.13 % (195195)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=1773670251:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.00/1.13 % (195195)Refutation not found, incomplete strategy
% 3.00/1.13 % (195195)------------------------------
% 3.00/1.13 % (195195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195195)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195195)Termination reason: Refutation not found, incomplete strategy
% 3.00/1.13 % (195195)Time elapsed: 0.002 s
% 3.00/1.13 % (195195)Peak memory usage: 88 MB
% 3.00/1.13 % (195195)Instructions burned: 6 (million)
% 3.00/1.13 % (195189)Also succeeded, but the first one will report.
% 3.00/1.13 % (195203)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=3666818602:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.00/1.13 % (195204)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=973794751:i=24:canc=force:rtra=on_2998 on theBenchmark for (2998ds/24Mi)
% 3.00/1.13 % (195202)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=1811987632:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.00/1.13 % (195203)Instruction limit reached!
% 3.00/1.13 % (195203)------------------------------
% 3.00/1.13 % (195203)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195203)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195203)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195203)Termination reason: Instruction limit
% 3.00/1.13 % (195203)Termination phase: Preprocessing 3
% 3.00/1.13 % (195203)Time elapsed: 0.011 s
% 3.00/1.13 % (195203)Peak memory usage: 87 MB
% 3.00/1.13 % (195203)Instructions burned: 17 (million)
% 3.00/1.13 % (195204)Instruction limit reached!
% 3.00/1.13 % (195204)------------------------------
% 3.00/1.13 % (195204)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195204)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195204)Termination reason: Instruction limit
% 3.00/1.13 % (195204)Termination phase: Property scanning
% 3.00/1.13 % (195204)Time elapsed: 0.014 s
% 3.00/1.13 % (195204)Peak memory usage: 87 MB
% 3.00/1.13 % (195204)Instructions burned: 24 (million)
% 3.00/1.13 % (195202)Instruction limit reached!
% 3.00/1.13 % (195202)------------------------------
% 3.00/1.13 % (195202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195202)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195202)Termination reason: Instruction limit
% 3.00/1.13 % (195202)Termination phase: Saturation
% 3.00/1.13 % (195202)Time elapsed: 0.017 s
% 3.00/1.13 % (195202)Peak memory usage: 87 MB
% 3.00/1.13 % (195202)Instructions burned: 30 (million)
% 3.00/1.13 % (195205)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=1094919135:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.00/1.13 % (195205)Instruction limit reached!
% 3.00/1.13 % (195205)------------------------------
% 3.00/1.13 % (195205)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195205)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195205)Termination reason: Instruction limit
% 3.00/1.13 % (195205)Termination phase: Property scanning
% 3.00/1.13 % (195205)Time elapsed: 0.016 s
% 3.00/1.13 % (195205)Peak memory usage: 87 MB
% 3.00/1.13 % (195205)Instructions burned: 27 (million)
% 3.00/1.13 % (195195)------------------------------
% 3.00/1.13 % (195195)------------------------------
% 3.00/1.13 % (195211)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=1699648446:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.00/1.13 % (195210)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=1619873580:i=85:gtgl=4:rtra=on:gtg=exists_sym_2996 on theBenchmark for (2996ds/85Mi)
% 3.00/1.13 % (195212)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=3737159276:i=181:rtra=on:ss=axioms:ev=cautious_2996 on theBenchmark for (2996ds/181Mi)
% 3.00/1.13 % (195211)Instruction limit reached!
% 3.00/1.13 % (195211)------------------------------
% 3.00/1.13 % (195211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195211)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195211)Termination reason: Instruction limit
% 3.00/1.13 % (195211)Termination phase: Property scanning
% 3.00/1.13 % (195211)Time elapsed: 0.002 s
% 3.00/1.13 % (195211)Peak memory usage: 85 MB
% 3.00/1.13 % (195211)Instructions burned: 3 (million)
% 3.00/1.13 % (195212)Refutation not found, incomplete strategy
% 3.00/1.13 % (195212)------------------------------
% 3.00/1.13 % (195212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.00/1.13 % (195212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.00/1.13 % (195212)CaDiCaL version: 2.1.3
% 3.00/1.13 % (195212)Termination reason: Refutation not found, incomplete strategy
% 3.00/1.13 % (195212)Time elapsed: 0.004 s
% 3.00/1.13 % (195212)Peak memory usage: 87 MB
% 3.00/1.13 % (195212)Instructions burned: 6 (million)
% 3.00/1.13 % (195188)Refutation found. Thanks to Tanya!
% 3.00/1.13 % SZS status Unsatisfiable for theBenchmark
% 3.00/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.91/1.32 % (195188)------------------------------
% 3.91/1.32 % (195188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.91/1.32 % (195188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.91/1.32 % (195188)CaDiCaL version: 2.1.3
% 3.91/1.32 % (195188)Termination reason: Refutation
% 3.91/1.32 % (195188)Time elapsed: 0.060 s
% 3.91/1.32 % (195188)Peak memory usage: 117 MB
% 3.91/1.32 % (195188)Instructions burned: 63 (million)
% 3.91/1.32 % (195188)------------------------------
% 3.91/1.32 % (195188)------------------------------
% 3.91/1.32 % (195182)Success in time 0.476 s
% 3.91/1.32 % Vampire exiting
%------------------------------------------------------------------------------