%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ARI748_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 : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:33:47 AM UTC 2026
% Result : Unsatisfiable 11.26s 2.45s
% Output : Refutation 12.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 107 ( 84 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 123 ( 46 ~; 31 |; 42 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 8 ( 5 usr; 2 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 41 ( 39 usr; 1 prp; 0-4 aty)
% Number of functors : 428 ( 428 usr; 23 con; 0-9 aty)
% Number of variables : 97 ( 67 !; 30 ?; 97 :)
% 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,
int_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_11,type,
pset_empty: c_unsorted ).
tff(func_def_12,type,
pset_range: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_13,type,
tag_table: c_type > c_type ).
tff(func_def_14,type,
int32_of_integer: $int > c_unsorted ).
tff(func_def_15,type,
int_max: ( $int * $int ) > $int ).
tff(func_def_16,type,
c_unit: c_type ).
tff(func_def_17,type,
pset_deref: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_18,type,
tag_id: c_type > c_type ).
tff(func_def_19,type,
offset_max_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_20,type,
neq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_21,type,
store_bytes: ( c_sorted * c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_22,type,
s2bool: c_sorted > c_Boolean ).
tff(func_def_23,type,
subtag_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_24,type,
abs_real: $real > $real ).
tff(func_def_25,type,
replace_bytes: ( c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_26,type,
neq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_27,type,
abs_int: $int > $int ).
tff(func_def_28,type,
c_Boolean_false: c_Boolean ).
tff(func_def_29,type,
bool_or: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_30,type,
eq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_31,type,
lt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_32,type,
block: c_type > c_type ).
tff(func_def_33,type,
int32_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_34,type,
log: $real > $real ).
tff(func_def_35,type,
bitvector_of_int32: c_sorted > c_unsorted ).
tff(func_def_36,type,
bitvector_of_int_P: c_sorted > c_unsorted ).
tff(func_def_37,type,
pset: c_type > c_type ).
tff(func_def_38,type,
address: c_sorted > $int ).
tff(func_def_39,type,
shift: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_40,type,
exp: $real > $real ).
tff(func_def_41,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_42,type,
offset_min_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_43,type,
null: c_unsorted ).
tff(func_def_44,type,
eq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_45,type,
unit2u: 'Unit' > c_unsorted ).
tff(func_def_46,type,
pset_range_left: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_47,type,
le_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_48,type,
void_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_49,type,
s2real: c_sorted > $real ).
tff(func_def_50,type,
concat_bitvector: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_51,type,
pset_range_right: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_52,type,
int2u: $int > c_unsorted ).
tff(func_def_53,type,
int8_of_integer: $int > 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,
c_real: c_type ).
tff(func_def_58,type,
real_max: ( $real * $real ) > $real ).
tff(func_def_59,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_60,type,
offset_max: ( c_sorted * c_sorted ) > $int ).
tff(func_def_61,type,
smtlib__select: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_62,type,
memory: ( c_type * c_type ) > c_type ).
tff(func_def_63,type,
real2u: $real > c_unsorted ).
tff(func_def_64,type,
int8: c_type ).
tff(func_def_65,type,
int32: c_type ).
tff(func_def_66,type,
bw_and: ( $int * $int ) > $int ).
tff(func_def_67,type,
gt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_68,type,
c_sort: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_69,type,
offset_min: ( c_sorted * c_sorted ) > $int ).
tff(func_def_70,type,
typeof: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_71,type,
bitvector_of_int8: c_sorted > c_unsorted ).
tff(func_def_72,type,
void_P_tag: c_unsorted ).
tff(func_def_73,type,
char_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_74,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_75,type,
bottom_tag: c_unsorted ).
tff(func_def_76,type,
bitvector: c_type ).
tff(func_def_77,type,
integer_of_int8: c_sorted > $int ).
tff(func_def_78,type,
lsr: ( $int * $int ) > $int ).
tff(func_def_79,type,
pset_all: c_sorted > c_unsorted ).
tff(func_def_80,type,
pointer_address: c_sorted > c_unsorted ).
tff(func_def_81,type,
extract_bytes: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_82,type,
bool_and: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_83,type,
smtlib__ite: ( c_Boolean * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_84,type,
bool_xor: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_85,type,
int_P: c_type ).
tff(func_def_86,type,
ge_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_87,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_88,type,
int_P_tag: c_unsorted ).
tff(func_def_89,type,
c_bool: c_type ).
tff(func_def_90,type,
pset_singleton: c_sorted > c_unsorted ).
tff(func_def_91,type,
bitvector_of_void_P: c_sorted > c_unsorted ).
tff(func_def_92,type,
pointer: c_type > c_type ).
tff(func_def_93,type,
select_bytes: ( c_sorted * c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_94,type,
int_P_of_pointer_address: c_sorted > 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_124,type,
sK0: ( c_unsorted * c_type ) > c_type ).
tff(func_def_125,type,
sK1: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_126,type,
sK2: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_127,type,
sK3: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_128,type,
sK4: ( c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_129,type,
sK5: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_130,type,
sK6: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_131,type,
sK7: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_132,type,
sK8: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_133,type,
sK9: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_134,type,
sK10: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_135,type,
sK11: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_136,type,
sK12: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_137,type,
sK13: ( c_type * c_unsorted * c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_138,type,
sK14: ( c_unsorted * $int * $int * $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_139,type,
sK15: ( c_unsorted * $int * $int * $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_140,type,
sK16: ( c_unsorted * $int * $int * $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_141,type,
sK17: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_142,type,
sK18: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_143,type,
sK19: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_144,type,
sK20: c_unsorted > c_sorted ).
tff(func_def_145,type,
sK21: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_146,type,
sK22: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_147,type,
sK23: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_148,type,
sK24: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_149,type,
sK25: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_150,type,
sK26: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_151,type,
sK27: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_152,type,
sK28: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_153,type,
sK29: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_154,type,
sK30: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_155,type,
sK31: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_156,type,
sK32: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_157,type,
sK33: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_158,type,
sK34: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_159,type,
sK35: ( c_type * c_unsorted * $int * c_unsorted ) > $int ).
tff(func_def_160,type,
sK36: ( c_type * c_unsorted * $int * c_unsorted ) > c_unsorted ).
tff(func_def_161,type,
sK37: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_162,type,
sK38: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_163,type,
sK39: ( c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_164,type,
sK40: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_165,type,
sK41: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_166,type,
sK42: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_167,type,
sK43: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_168,type,
sK44: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_169,type,
sK45: ( $int * c_type * c_unsorted * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_170,type,
sK46: ( $int * c_type * c_unsorted * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_171,type,
sK47: ( $int * c_type * c_unsorted * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int ) > c_type ).
tff(func_def_172,type,
sK48: ( $int * c_type * c_unsorted * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_173,type,
sK49: ( $int * c_type * c_unsorted * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_174,type,
sK50: ( $int * c_type * c_unsorted * c_unsorted * $int * c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_175,type,
sK51: c_unsorted > c_type ).
tff(func_def_176,type,
sK52: c_unsorted > c_sorted ).
tff(func_def_177,type,
sK53: ( c_unsorted * c_unsorted * c_type * $int ) > c_type ).
tff(func_def_178,type,
sK54: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_179,type,
sK55: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_180,type,
sK56: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_181,type,
sK57: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_182,type,
sK58: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_183,type,
sK59: ( $int * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_184,type,
sK60: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_185,type,
sK61: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_186,type,
sK62: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_187,type,
sK63: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_188,type,
sK64: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_189,type,
sK65: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_190,type,
sK66: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_191,type,
sK67: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_192,type,
sK68: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_193,type,
sK69: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_194,type,
sK70: c_unsorted > c_type ).
tff(func_def_195,type,
sK71: c_unsorted > c_sorted ).
tff(func_def_196,type,
sK72: c_unsorted > c_sorted ).
tff(func_def_197,type,
sK73: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_198,type,
sK74: ( c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_199,type,
sK75: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_200,type,
sK76: ( c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_201,type,
sK77: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_202,type,
sK78: c_unsorted > c_type ).
tff(func_def_203,type,
sK79: c_unsorted > c_sorted ).
tff(func_def_204,type,
sK80: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_205,type,
sK81: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_206,type,
sK82: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_207,type,
sK83: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_208,type,
sK84: ( $int * c_type * $int * c_unsorted * $int * $int ) > c_type ).
tff(func_def_209,type,
sK85: ( $int * c_type * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_210,type,
sK86: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_211,type,
sK87: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_212,type,
sK88: c_unsorted > c_type ).
tff(func_def_213,type,
sK89: c_unsorted > c_sorted ).
tff(func_def_214,type,
sK90: ( $int * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_215,type,
sK91: ( $int * c_unsorted * $int * c_type ) > c_sorted ).
tff(func_def_216,type,
sK92: c_unsorted > $int ).
tff(func_def_217,type,
sK93: c_unsorted > $int ).
tff(func_def_218,type,
sK94: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_219,type,
sK95: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_220,type,
sK96: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_221,type,
sK97: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_222,type,
sK98: ( $real * $real ) > $real ).
tff(func_def_223,type,
sK99: c_type > c_type ).
tff(func_def_224,type,
sK100: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_225,type,
sK101: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_226,type,
sK102: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_227,type,
sK103: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_228,type,
sK104: ( c_type * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_229,type,
sK105: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_230,type,
sK106: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_231,type,
sK107: c_type ).
tff(func_def_232,type,
sK108: c_unsorted > c_type ).
tff(func_def_233,type,
sK109: c_unsorted > c_sorted ).
tff(func_def_234,type,
sK110: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_235,type,
sK111: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_236,type,
sK112: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_237,type,
sK113: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_238,type,
sK114: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_239,type,
sK115: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_240,type,
sK116: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_241,type,
sK117: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_242,type,
sK118: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_243,type,
sK119: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_244,type,
sK120: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_245,type,
sK121: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_246,type,
sK122: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_247,type,
sK123: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_248,type,
sK124: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_249,type,
sK125: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_250,type,
sK126: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_251,type,
sK127: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_252,type,
sK128: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_253,type,
sK129: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_254,type,
sK130: c_type > c_type ).
tff(func_def_255,type,
sK131: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_256,type,
sK132: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_257,type,
sK133: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_258,type,
sK134: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_259,type,
sK135: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_260,type,
sK136: ( c_unsorted * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_261,type,
sK137: ( c_unsorted * c_unsorted * c_type * $int ) > $int ).
tff(func_def_262,type,
sK138: ( c_unsorted * c_unsorted * c_type * $int ) > $int ).
tff(func_def_263,type,
sK139: ( $int * $int * c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_264,type,
sK140: ( $int * $int ) > $int ).
tff(func_def_265,type,
sK141: ( c_unsorted * c_unsorted * $int * $int * c_type ) > c_type ).
tff(func_def_266,type,
sK142: ( c_unsorted * c_unsorted * $int * $int * c_type ) > c_unsorted ).
tff(func_def_267,type,
sK143: ( c_unsorted * c_unsorted * $int * $int * c_type ) > c_type ).
tff(func_def_268,type,
sK144: ( c_unsorted * c_unsorted * $int * $int * c_type ) > $int ).
tff(func_def_269,type,
sK145: ( c_unsorted * c_unsorted * $int * $int * c_type ) > c_sorted ).
tff(func_def_270,type,
sK146: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_271,type,
sK147: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_272,type,
sK148: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_273,type,
sK149: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_274,type,
sK150: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_275,type,
sK151: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_276,type,
sK152: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_277,type,
sK153: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_278,type,
sK154: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_279,type,
sK155: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_280,type,
sK156: c_type > c_type ).
tff(func_def_281,type,
sK157: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_282,type,
sK158: c_unsorted > c_type ).
tff(func_def_283,type,
sK159: c_unsorted > c_sorted ).
tff(func_def_284,type,
sK160: ( c_unsorted * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_285,type,
sK161: ( c_unsorted * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_286,type,
sK162: ( c_unsorted * $int * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_287,type,
sK163: ( c_unsorted * $int * c_type * c_unsorted ) > $int ).
tff(func_def_288,type,
sK164: ( c_unsorted * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_289,type,
sK165: ( c_unsorted * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_290,type,
sK166: ( c_unsorted * c_unsorted * $int * c_type ) > c_sorted ).
tff(func_def_291,type,
sK167: ( c_unsorted * c_unsorted * $int * c_type ) > c_sorted ).
tff(func_def_292,type,
sK168: ( $int * $int ) > $int ).
tff(func_def_293,type,
sK169: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_294,type,
sK170: ( $int * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_295,type,
sK171: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_296,type,
sK172: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_297,type,
sK173: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_298,type,
sK174: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_299,type,
sK175: ( $int * c_unsorted * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_300,type,
sK176: ( $int * c_unsorted * $int * c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_301,type,
sK177: ( $int * c_unsorted * $int * c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_302,type,
sK178: ( $int * c_unsorted * $int * c_type * c_unsorted ) > $int ).
tff(func_def_303,type,
sK179: ( $int * c_unsorted * $int * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_304,type,
sK180: c_unsorted > c_type ).
tff(func_def_305,type,
sK181: c_unsorted > c_sorted ).
tff(func_def_306,type,
sK182: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_307,type,
sK183: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_308,type,
sK184: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_309,type,
sK185: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_310,type,
sK186: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_311,type,
sK187: ( $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * $int * $int * $int ) > c_type ).
tff(func_def_312,type,
sK188: ( $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * $int * $int * $int ) > c_type ).
tff(func_def_313,type,
sK189: ( $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * $int * $int * $int ) > c_sorted ).
tff(func_def_314,type,
sK190: ( $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * $int * $int * $int ) > c_sorted ).
tff(func_def_315,type,
sK191: ( $int * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type * $int * $int * $int ) > c_sorted ).
tff(func_def_316,type,
sK192: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_317,type,
sK193: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_318,type,
sK194: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_319,type,
sK195: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_320,type,
sK196: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_321,type,
sK197: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_322,type,
sK198: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_323,type,
sK199: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_324,type,
sK200: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_325,type,
sK201: ( $int * c_unsorted * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_326,type,
sK202: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_327,type,
sK203: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_328,type,
sK204: ( c_unsorted * $int * c_type * $int ) > c_type ).
tff(func_def_329,type,
sK205: ( c_unsorted * $int * c_type * $int ) > c_sorted ).
tff(func_def_330,type,
sK206: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_331,type,
sK207: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_332,type,
sK208: ( c_type * $int * c_unsorted * $int ) > c_type ).
tff(func_def_333,type,
sK209: ( c_type * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_334,type,
sK210: c_type ).
tff(func_def_335,type,
sK211: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_336,type,
sK212: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_337,type,
sK213: c_unsorted > c_type ).
tff(func_def_338,type,
sK214: c_unsorted > c_sorted ).
tff(func_def_339,type,
sK215: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_340,type,
sK216: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_341,type,
sK217: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_342,type,
sK218: c_unsorted > c_type ).
tff(func_def_343,type,
sK219: c_unsorted > c_sorted ).
tff(func_def_344,type,
sK220: c_unsorted > c_sorted ).
tff(func_def_345,type,
sK221: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_346,type,
sK222: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_347,type,
sK223: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_348,type,
sK224: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_349,type,
sK225: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_350,type,
sK226: ( c_unsorted * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_351,type,
sK227: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_352,type,
sK228: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_353,type,
sK229: c_unsorted > c_sorted ).
tff(func_def_354,type,
sK230: c_unsorted > c_sorted ).
tff(func_def_355,type,
sK231: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_356,type,
sK232: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_357,type,
sK233: ( c_type * c_unsorted ) > c_type ).
tff(func_def_358,type,
sK234: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_359,type,
sK235: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * $int ) > c_sorted ).
tff(func_def_360,type,
sK236: ( c_unsorted * $int * c_unsorted * $int * $int * c_type * $int ) > c_sorted ).
tff(func_def_361,type,
sK237: ( c_type * $int * c_unsorted * $int ) > c_type ).
tff(func_def_362,type,
sK238: ( c_type * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_363,type,
sK239: ( c_type * c_unsorted ) > c_type ).
tff(func_def_364,type,
sK240: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_365,type,
sK241: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_366,type,
sK242: ( c_unsorted * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_367,type,
sK243: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_368,type,
sK244: ( c_unsorted * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_369,type,
sK245: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_370,type,
sK246: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_371,type,
sK247: ( $int * $int ) > $int ).
tff(func_def_372,type,
sK248: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_373,type,
sK249: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_374,type,
sK250: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_375,type,
sK251: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_376,type,
sK252: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_377,type,
sK253: c_unsorted > c_sorted ).
tff(func_def_378,type,
sK254: ( $int * c_unsorted * c_type * $int ) > c_type ).
tff(func_def_379,type,
sK255: ( $int * c_unsorted * c_type * $int ) > c_sorted ).
tff(func_def_380,type,
sK256: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_381,type,
sK257: ( c_type * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_382,type,
sK258: ( c_type * $int * c_unsorted * c_unsorted ) > $int ).
tff(func_def_383,type,
sK259: ( c_type * $int * c_unsorted * c_unsorted ) > $int ).
tff(func_def_384,type,
sK260: c_unsorted ).
tff(func_def_385,type,
sK261: c_unsorted ).
tff(func_def_386,type,
sK262: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_387,type,
sK263: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_388,type,
sK264: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_389,type,
sK265: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_390,type,
sK266: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_391,type,
sK267: ( $int * c_type * c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_392,type,
sK268: ( $int * c_type * c_unsorted * $int * c_unsorted * $int ) > c_type ).
tff(func_def_393,type,
sK269: ( $int * c_type * c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_394,type,
sK270: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_395,type,
sK271: ( c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_396,type,
sK272: ( c_unsorted * $int * c_type * c_unsorted ) > $int ).
tff(func_def_397,type,
sK273: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_398,type,
sK274: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_399,type,
sK275: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_400,type,
sK276: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_401,type,
sK277: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_402,type,
sK278: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_403,type,
sK279: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_404,type,
sK280: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_405,type,
sK281: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_406,type,
sK282: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_407,type,
sK283: ( $real * $real ) > $real ).
tff(func_def_408,type,
sK284: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_409,type,
sK285: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_410,type,
sK286: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_411,type,
sK287: c_type > c_type ).
tff(func_def_412,type,
sK288: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_413,type,
sK289: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_414,type,
sK290: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_415,type,
sK291: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_416,type,
sK292: ( c_type * c_unsorted * c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_417,type,
sK293: ( $real * $real ) > $real ).
tff(func_def_418,type,
sK294: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_419,type,
sK295: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_420,type,
sK296: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_421,type,
sK297: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_422,type,
sK298: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_423,type,
sK299: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_424,type,
sK300: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_425,type,
sK301: ( c_unsorted * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_426,type,
sK302: ( c_unsorted * $int * c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_427,type,
sK303: ( c_unsorted * $int * c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_428,type,
sK304: ( c_unsorted * $int * c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_429,type,
sK305: ( c_unsorted * $int * c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_430,type,
sK306: ( c_unsorted * $int * c_unsorted * c_type * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_431,type,
sK307: ( $real * $real ) > $real ).
tff(func_def_432,type,
sK308: c_type ).
tff(func_def_433,type,
sK309: ( $int * $int ) > $int ).
tff(func_def_434,type,
sK310: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_435,type,
sK311: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_436,type,
sK312: ( c_unsorted * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_437,type,
sK313: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_438,type,
sK314: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_439,type,
sK315: c_unsorted > c_sorted ).
tff(func_def_440,type,
sK316: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_441,type,
sK317: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_442,type,
sK318: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(pred_def_1,type,
left_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_2,type,
right_valid_struct_int_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_3,type,
strict_valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_4,type,
root_tag: c_sorted > $o ).
tff(pred_def_5,type,
alloc_extends: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_6,type,
valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_7,type,
valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_8,type,
valid_root_int_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_9,type,
eq_int8: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_10,type,
same_block: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_11,type,
pset_included: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_12,type,
strict_valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_13,type,
in_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_14,type,
instanceof: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_15,type,
alloc_extends_except: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_16,type,
strict_valid_root_int_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_17,type,
not_assigns: ( c_sorted * c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_18,type,
valid_bitvector_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_19,type,
valid_bitvector_struct_int_P: ( 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,
right_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_23,type,
strict_valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_24,type,
valid_bitvector_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_25,type,
valid_struct_int_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,
strict_valid_struct_int_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_28,type,
valid: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_29,type,
full_separated: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_30,type,
strict_valid_struct_void_P: ( c_sorted * $int * $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,
subtag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_36,type,
valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_37,type,
left_valid_struct_int_P: ( c_sorted * $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(f44,axiom,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted] :
? [X3: c_type] :
( ( X3 = pointer(X0) )
& ? [X5: c_sorted,X4: c_sorted,X6: c_type] :
( ( X5 = c_sort(X3,X2) )
& ( X6 = block(X0) )
& ( same_block(X4,X5)
<=> ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) ) )
& ( X4 = c_sort(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_44) ).
tff(f184,negated_conjecture,
~ ! [X1: c_unsorted,X0: c_unsorted] :
? [X2: c_type] :
( ( X2 = pointer(int_P) )
& ? [X3: c_sorted,X4: c_sorted] :
( ( X3 = c_sort(X2,X0) )
& ( ( ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
=> ( X3 != X4 ) )
& ( X4 = c_sort(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_184) ).
tff(f325,plain,
~ ! [X0: c_unsorted,X1: c_unsorted] :
? [X2: c_type] :
( ? [X4: c_sorted,X3: c_sorted] :
( ( c_sort(X2,X1) = X3 )
& ( ( ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
=> ( X3 != X4 ) )
& ( c_sort(X2,X0) = X4 ) )
& ( X2 = pointer(int_P) ) ),
inference(rectify,[],[f184]) ).
tff(f340,plain,
! [X1: c_unsorted,X2: c_unsorted,X0: c_type] :
? [X3: c_type] :
( ( X3 = pointer(X0) )
& ? [X6: c_type,X5: c_sorted,X4: c_sorted] :
( ( same_block(X5,X4)
<=> ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) ) )
& ( c_sort(X3,X1) = X5 )
& ( X6 = block(X0) )
& ( c_sort(X3,X2) = X4 ) ) ),
inference(rectify,[],[f44]) ).
tff(f416,plain,
? [X0: c_unsorted,X1: c_unsorted] :
! [X2: c_type] :
( ! [X4: c_sorted,X3: c_sorted] :
( ( c_sort(X2,X1) != X3 )
| ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) )
| ( c_sort(X2,X0) != X4 ) )
| ( pointer(int_P) != X2 ) ),
inference(ennf_transformation,[],[f325]) ).
tff(f417,plain,
? [X0: c_unsorted,X1: c_unsorted] :
! [X2: c_type] :
( ! [X3: c_sorted,X4: c_sorted] :
( ( c_sort(X2,X0) != X4 )
| ( c_sort(X2,X1) != X3 )
| ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) ) )
| ( pointer(int_P) != X2 ) ),
inference(flattening,[],[f416]) ).
tff(f585,plain,
! [X1: c_unsorted,X2: c_unsorted,X0: c_type] :
? [X3: c_type] :
( ( X3 = pointer(X0) )
& ? [X6: c_type,X5: c_sorted,X4: c_sorted] :
( ( same_block(X5,X4)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X5,X4) )
& ( c_sort(X3,X1) = X5 )
& ( X6 = block(X0) )
& ( c_sort(X3,X2) = X4 ) ) ),
inference(nnf_transformation,[],[f340]) ).
tff(f586,plain,
! [X1: c_unsorted,X2: c_unsorted,X0: c_type] :
? [X3: c_type] :
( ( X3 = pointer(X0) )
& ? [X6: c_type,X5: c_sorted,X4: c_sorted] :
( ( same_block(X5,X4)
| ( c_sort(X6,base_block(X4)) != c_sort(X6,base_block(X5)) ) )
& ( ( c_sort(X6,base_block(X4)) = c_sort(X6,base_block(X5)) )
| ~ same_block(X5,X4) )
& ( c_sort(X3,X1) = X5 )
& ( X6 = block(X0) )
& ( c_sort(X3,X2) = X4 ) ) ),
inference(flattening,[],[f585]) ).
tff(f587,plain,
! [X0: c_unsorted,X1: c_unsorted,X2: c_type] :
? [X3: c_type] :
( ( pointer(X2) = X3 )
& ? [X4: c_type,X5: c_sorted,X6: c_sorted] :
( ( same_block(X5,X6)
| ( c_sort(X4,base_block(X5)) != c_sort(X4,base_block(X6)) ) )
& ( ( c_sort(X4,base_block(X5)) = c_sort(X4,base_block(X6)) )
| ~ same_block(X5,X6) )
& ( c_sort(X3,X0) = X5 )
& ( block(X2) = X4 )
& ( c_sort(X3,X1) = X6 ) ) ),
inference(rectify,[],[f586]) ).
tff(f588,plain,
! [X0: c_unsorted,X1: c_unsorted,X2: c_type] :
( ( sK117(X0,X1,X2) = pointer(X2) )
& ( same_block(sK119(X0,X1,X2),sK120(X0,X1,X2))
| ( c_sort(sK118(X0,X1,X2),base_block(sK119(X0,X1,X2))) != c_sort(sK118(X0,X1,X2),base_block(sK120(X0,X1,X2))) ) )
& ( ( c_sort(sK118(X0,X1,X2),base_block(sK119(X0,X1,X2))) = c_sort(sK118(X0,X1,X2),base_block(sK120(X0,X1,X2))) )
| ~ same_block(sK119(X0,X1,X2),sK120(X0,X1,X2)) )
& ( c_sort(sK117(X0,X1,X2),X0) = sK119(X0,X1,X2) )
& ( sK118(X0,X1,X2) = block(X2) )
& ( sK120(X0,X1,X2) = c_sort(sK117(X0,X1,X2),X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK117,sK118,sK119,sK120]),skolemize(X3,sK117(X0,X1,X2)),skolemize(X4,sK118(X0,X1,X2)),skolemize(X5,sK119(X0,X1,X2)),skolemize(X6,sK120(X0,X1,X2))],[f587]) ).
tff(f756,plain,
! [X2: c_type] :
( ! [X3: c_sorted,X4: c_sorted] :
( ( c_sort(X2,sK260) != X4 )
| ( c_sort(X2,sK261) != X3 )
| ( ( X3 = X4 )
& ~ same_block(X3,X4)
& ( c_Boolean_true = c_Boolean_true ) ) )
| ( pointer(int_P) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK260,sK261]),skolemize(X0,sK260),skolemize(X1,sK261)],[f417]) ).
tff(f1038,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] : ( sK120(X0,X1,X2) = c_sort(sK117(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f588]) ).
tff(f1039,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] : ( sK118(X0,X1,X2) = block(X2) ),
inference(cnf_transformation,[],[f588]) ).
tff(f1040,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] : ( c_sort(sK117(X0,X1,X2),X0) = sK119(X0,X1,X2) ),
inference(cnf_transformation,[],[f588]) ).
tff(f1042,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] :
( same_block(sK119(X0,X1,X2),sK120(X0,X1,X2))
| ( c_sort(sK118(X0,X1,X2),base_block(sK119(X0,X1,X2))) != c_sort(sK118(X0,X1,X2),base_block(sK120(X0,X1,X2))) ) ),
inference(cnf_transformation,[],[f588]) ).
tff(f1043,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] : ( sK117(X0,X1,X2) = pointer(X2) ),
inference(cnf_transformation,[],[f588]) ).
tff(f1312,plain,
! [X2: c_type,X3: c_sorted,X4: c_sorted] :
( ( c_sort(X2,sK260) != X4 )
| ( c_sort(X2,sK261) != X3 )
| ~ same_block(X3,X4)
| ( pointer(int_P) != X2 ) ),
inference(cnf_transformation,[],[f756]) ).
tff(f1313,plain,
! [X2: c_type,X3: c_sorted,X4: c_sorted] :
( ( c_sort(X2,sK260) != X4 )
| ( c_sort(X2,sK261) != X3 )
| ( X3 = X4 )
| ( pointer(int_P) != X2 ) ),
inference(cnf_transformation,[],[f756]) ).
tff(f1470,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] : ( c_sort(pointer(X2),X0) = sK119(X0,X1,X2) ),
inference(definition_unfolding,[],[f1040,f1043]) ).
tff(f1471,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] : ( sK120(X0,X1,X2) = c_sort(pointer(X2),X1) ),
inference(definition_unfolding,[],[f1038,f1043]) ).
tff(f1626,plain,
! [X2: c_type,X0: c_unsorted,X1: c_unsorted] :
( ( c_sort(block(X2),base_block(c_sort(pointer(X2),X1))) != c_sort(block(X2),base_block(c_sort(pointer(X2),X0))) )
| same_block(c_sort(pointer(X2),X0),c_sort(pointer(X2),X1)) ),
inference(definition_unfolding,[],[f1042,f1470,f1471,f1039,f1470,f1039,f1471]) ).
tff(f1847,plain,
! [X2: c_type,X3: c_sorted] :
( ( c_sort(X2,sK261) != X3 )
| ( c_sort(X2,sK260) = X3 )
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f1313]) ).
tff(f1848,plain,
! [X2: c_type] :
( ( c_sort(X2,sK260) = c_sort(X2,sK261) )
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f1847]) ).
tff(f1849,plain,
c_sort(pointer(int_P),sK261) = c_sort(pointer(int_P),sK260),
inference(equality_resolution,[],[f1848]) ).
tff(f1850,plain,
! [X2: c_type,X3: c_sorted] :
( ( c_sort(X2,sK261) != X3 )
| ~ same_block(X3,c_sort(X2,sK260))
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f1312]) ).
tff(f1851,plain,
! [X2: c_type] :
( ~ same_block(c_sort(X2,sK261),c_sort(X2,sK260))
| ( pointer(int_P) != X2 ) ),
inference(equality_resolution,[],[f1850]) ).
tff(f1852,plain,
~ same_block(c_sort(pointer(int_P),sK261),c_sort(pointer(int_P),sK260)),
inference(equality_resolution,[],[f1851]) ).
tff(f1873,plain,
~ same_block(c_sort(pointer(int_P),sK260),c_sort(pointer(int_P),sK260)),
inference(forward_demodulation,[],[f1852,f1849]) ).
tff(f2048,plain,
c_sort(block(int_P),base_block(c_sort(pointer(int_P),sK260))) != c_sort(block(int_P),base_block(c_sort(pointer(int_P),sK260))),
inference(unit_resulting_resolution,[],[f1626,f1873]) ).
tff(f2049,plain,
$false,
inference(trivial_inequality_removal,[],[f2048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ARI748_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.07/0.18 % Computer : n020.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 21:03:04 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running first-order theorem proving
% 0.07/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.51/1.28 % (553919)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.51/1.28 % (554007)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2398494729:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.51/1.28 % (554007)Instruction limit reached!
% 3.51/1.28 % (554007)------------------------------
% 3.51/1.28 % (554007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.28 % (554007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.28 % (554007)CaDiCaL version: 2.1.3
% 3.51/1.28 % (554007)Termination reason: Instruction limit
% 3.51/1.28 % (554007)Termination phase: Preprocessing 3
% 3.51/1.28 % (554007)Time elapsed: 0.004 s
% 3.51/1.28 % (554007)Peak memory usage: 86 MB
% 3.51/1.28 % (554007)Instructions burned: 15 (million)
% 3.51/1.28 % (554008)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=1049253757:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.51/1.28 % (554009)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2826043796:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.51/1.28 % (554011)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=3568815465:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.51/1.28 % (554012)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=2971099080:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.51/1.28 % (554011)Instruction limit reached!
% 3.51/1.28 % (554011)------------------------------
% 3.51/1.28 % (554011)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.28 % (554011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.28 % (554011)CaDiCaL version: 2.1.3
% 3.51/1.28 % (554011)Termination reason: Instruction limit
% 3.51/1.28 % (554011)Termination phase: Property scanning
% 3.51/1.28 % (554011)Time elapsed: 0.003 s
% 3.51/1.28 % (554011)Peak memory usage: 85 MB
% 3.51/1.28 % (554011)Instructions burned: 5 (million)
% 3.51/1.28 % (554013)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=3030879873:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.51/1.28 % (554010)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=3481249480:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.51/1.28 % (554013)Instruction limit reached!
% 3.51/1.28 % (554013)------------------------------
% 3.51/1.28 % (554013)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.28 % (554013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.28 % (554013)CaDiCaL version: 2.1.3
% 3.51/1.28 % (554013)Termination reason: Instruction limit
% 3.51/1.28 % (554013)Termination phase: Function definition elimination
% 3.51/1.28 % (554013)Time elapsed: 0.018 s
% 3.51/1.28 % (554013)Peak memory usage: 88 MB
% 3.51/1.28 % (554013)Instructions burned: 33 (million)
% 3.51/1.28 % (554010)Instruction limit reached!
% 3.51/1.28 % (554010)------------------------------
% 3.51/1.28 % (554010)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.28 % (554010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.28 % (554010)CaDiCaL version: 2.1.3
% 3.51/1.28 % (554010)Termination reason: Instruction limit
% 3.51/1.28 % (554010)Termination phase: Property scanning
% 3.51/1.28 % (554010)Time elapsed: 0.004 s
% 3.51/1.28 % (554010)Peak memory usage: 86 MB
% 3.51/1.28 % (554010)Instructions burned: 7 (million)
% 3.51/1.28 % (554012)Instruction limit reached!
% 3.51/1.28 % (554012)------------------------------
% 3.51/1.28 % (554012)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.28 % (554012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.28 % (554012)CaDiCaL version: 2.1.3
% 3.51/1.28 % (554012)Termination reason: Instruction limit
% 3.51/1.28 % (554012)Termination phase: Saturation
% 3.51/1.28 % (554012)Time elapsed: 0.045 s
% 3.51/1.28 % (554012)Peak memory usage: 112 MB
% 3.51/1.28 % (554012)Instructions burned: 46 (million)
% 3.51/1.28 % (554039)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=1288688714:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.51/1.28 % (554058)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=3045058107:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 4.64/1.44 % (554039)Refutation not found, incomplete strategy
% 4.64/1.44 % (554039)------------------------------
% 4.64/1.44 % (554039)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.64/1.44 % (554039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.64/1.44 % (554039)CaDiCaL version: 2.1.3
% 4.64/1.44 % (554039)Termination reason: Refutation not found, incomplete strategy
% 4.64/1.44 % (554039)Time elapsed: 0.004 s
% 4.64/1.44 % (554039)Peak memory usage: 88 MB
% 4.64/1.44 % (554039)Instructions burned: 6 (million)
% 4.64/1.44 % (554058)Instruction limit reached!
% 4.64/1.44 % (554058)------------------------------
% 4.64/1.44 % (554058)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.64/1.44 % (554058)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.64/1.44 % (554058)CaDiCaL version: 2.1.3
% 4.64/1.44 % (554058)Termination reason: Instruction limit
% 4.64/1.44 % (554058)Termination phase: Property scanning
% 4.64/1.44 % (554058)Time elapsed: 0.009 s
% 4.64/1.44 % (554058)Peak memory usage: 88 MB
% 4.64/1.44 % (554058)Instructions burned: 34 (million)
% 4.64/1.44 % (554009)Instruction limit reached!
% 4.64/1.44 % (554009)------------------------------
% 4.64/1.44 % (554009)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.64/1.44 % (554009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.64/1.44 % (554009)CaDiCaL version: 2.1.3
% 4.64/1.44 % (554009)Termination reason: Instruction limit
% 4.64/1.44 % (554009)Termination phase: Saturation
% 4.64/1.44 % (554009)Time elapsed: 0.149 s
% 4.64/1.44 % (554009)Peak memory usage: 118 MB
% 4.64/1.44 % (554009)Instructions burned: 201 (million)
% 4.64/1.44 % (554065)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=1783850264:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2997 on theBenchmark for (2997ds/16Mi)
% 4.64/1.44 % (554065)Instruction limit reached!
% 4.64/1.44 % (554065)------------------------------
% 4.64/1.44 % (554065)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.64/1.44 % (554065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.64/1.44 % (554065)CaDiCaL version: 2.1.3
% 4.64/1.44 % (554065)Termination reason: Instruction limit
% 4.64/1.44 % (554065)Termination phase: Preprocessing 3
% 4.64/1.44 % (554065)Time elapsed: 0.011 s
% 4.64/1.44 % (554065)Peak memory usage: 87 MB
% 4.64/1.44 % (554065)Instructions burned: 17 (million)
% 4.64/1.44 % (554072)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=1476964498:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 4.64/1.44 % (554008)Instruction limit reached!
% 4.64/1.44 % (554008)------------------------------
% 4.64/1.44 % (554008)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.64/1.44 % (554008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.64/1.44 % (554008)CaDiCaL version: 2.1.3
% 4.64/1.44 % (554008)Termination reason: Instruction limit
% 4.64/1.44 % (554008)Termination phase: Saturation
% 4.64/1.44 % (554008)Time elapsed: 0.212 s
% 4.64/1.44 % (554008)Peak memory usage: 118 MB
% 4.64/1.44 % (554008)Instructions burned: 308 (million)
% 4.64/1.44 % (554072)Instruction limit reached!
% 4.64/1.44 % (554072)------------------------------
% 4.64/1.44 % (554072)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.64/1.44 % (554072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.64/1.44 % (554072)CaDiCaL version: 2.1.3
% 4.64/1.44 % (554072)Termination reason: Instruction limit
% 4.64/1.44 % (554072)Termination phase: Property scanning
% 4.64/1.44 % (554072)Time elapsed: 0.016 s
% 4.64/1.44 % (554072)Peak memory usage: 87 MB
% 4.64/1.44 % (554072)Instructions burned: 29 (million)
% 4.64/1.44 % (554075)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=3590353736:i=85:gtgl=4:rtra=on:gtg=exists_sym_2996 on theBenchmark for (2996ds/85Mi)
% 4.64/1.44 % (554067)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=1902939265:i=24:canc=force:rtra=on_2997 on theBenchmark for (2997ds/24Mi)
% 4.64/1.44 % (554075)Instruction limit reached!
% 4.64/1.44 % (554075)------------------------------
% 4.64/1.44 % (554075)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554075)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554075)CaDiCaL version: 2.1.3
% 6.28/1.71 % (554075)Termination reason: Instruction limit
% 6.28/1.71 % (554075)Termination phase: Saturation
% 6.28/1.71 % (554075)Time elapsed: 0.025 s
% 6.28/1.71 % (554075)Peak memory usage: 90 MB
% 6.28/1.71 % (554075)Instructions burned: 86 (million)
% 6.28/1.71 % (554067)Instruction limit reached!
% 6.28/1.71 % (554067)------------------------------
% 6.28/1.71 % (554067)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554067)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554067)CaDiCaL version: 2.1.3
% 6.28/1.71 % (554067)Termination reason: Instruction limit
% 6.28/1.71 % (554067)Termination phase: Property scanning
% 6.28/1.71 % (554067)Time elapsed: 0.014 s
% 6.28/1.71 % (554067)Peak memory usage: 87 MB
% 6.28/1.71 % (554067)Instructions burned: 24 (million)
% 6.28/1.71 % (554076)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=1526683315:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 6.28/1.71 % (554076)Instruction limit reached!
% 6.28/1.71 % (554076)------------------------------
% 6.28/1.71 % (554076)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554076)CaDiCaL version: 2.1.3
% 6.28/1.71 % (554076)Termination reason: Instruction limit
% 6.28/1.71 % (554076)Termination phase: Property scanning
% 6.28/1.71 % (554076)Time elapsed: 0.004 s
% 6.28/1.71 % (554076)Peak memory usage: 86 MB
% 6.28/1.71 % (554076)Instructions burned: 6 (million)
% 6.28/1.71 % (554078)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=2220692656:i=181:rtra=on:ss=axioms:ev=cautious_2996 on theBenchmark for (2996ds/181Mi)
% 6.28/1.71 % (554078)Refutation not found, incomplete strategy
% 6.28/1.71 % (554078)------------------------------
% 6.28/1.71 % (554078)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554078)CaDiCaL version: 2.1.3
% 6.28/1.71 % (554078)Termination reason: Refutation not found, incomplete strategy
% 6.28/1.71 % (554078)Time elapsed: 0.004 s
% 6.28/1.71 % (554078)Peak memory usage: 88 MB
% 6.28/1.71 % (554078)Instructions burned: 6 (million)
% 6.28/1.71 % (554081)dis+1010_128_isp=bottom:to=lpo:thi=overlap:prc=on:sas=z3:si=on:fd=preordered:random_seed=338835230:i=66:thsqd=64:thsqc=16:rtra=on:thsq=on:ev=force_2996 on theBenchmark for (2996ds/66Mi)
% 6.28/1.71 % (554039)------------------------------
% 6.28/1.71 % (554039)------------------------------
% 6.28/1.71 % (554080)lrs+10_2_to=lpo:sil=64000:si=on:sos=on:gve=force:lcm=reverse:uwa=one_side_interpreted:random_seed=1759191735:i=4:ep=RST:ins=2:rtra=on_2996 on theBenchmark for (2996ds/4Mi)
% 6.28/1.71 % (554080)Instruction limit reached!
% 6.28/1.71 % (554080)------------------------------
% 6.28/1.71 % (554080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554080)CaDiCaL version: 2.1.3
% 6.28/1.71 % (554080)Termination reason: Instruction limit
% 6.28/1.71 % (554080)Termination phase: Property scanning
% 6.28/1.71 % (554080)Time elapsed: 0.003 s
% 6.28/1.71 % (554080)Peak memory usage: 85 MB
% 6.28/1.71 % (554080)Instructions burned: 5 (million)
% 6.28/1.71 % (554084)lrs+10_1_thi=all:si=on:fd=off:random_seed=3471316107:i=53:rtra=on:gtg=all_2995 on theBenchmark for (2995ds/53Mi)
% 6.28/1.71 % (554084)Instruction limit reached!
% 6.28/1.71 % (554084)------------------------------
% 6.28/1.71 % (554084)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554084)CaDiCaL version: 2.1.3
% 6.28/1.71 % (554084)Termination reason: Instruction limit
% 6.28/1.71 % (554084)Termination phase: Saturation
% 6.28/1.71 % (554084)Time elapsed: 0.017 s
% 6.28/1.71 % (554084)Peak memory usage: 94 MB
% 6.28/1.71 % (554084)Instructions burned: 53 (million)
% 6.28/1.71 % (554081)Instruction limit reached!
% 6.28/1.71 % (554081)------------------------------
% 6.28/1.71 % (554081)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.28/1.71 % (554081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.28/1.71 % (554081)CaDiCaL version: 2.1.3
% 7.55/2.05 % (554081)Termination reason: Instruction limit
% 7.55/2.05 % (554081)Termination phase: Saturation
% 7.55/2.05 % (554081)Time elapsed: 0.076 s
% 7.55/2.05 % (554081)Peak memory usage: 131 MB
% 7.55/2.05 % (554081)Instructions burned: 66 (million)
% 7.55/2.05 % (554087)lrs+10_1_to=lakbo:sil=128000:si=on:alasca=on:sp=occurrence:random_seed=1791846535:st=3:i=2:rtra=on:ss=axioms_2995 on theBenchmark for (2995ds/2Mi)
% 7.55/2.05 % (554087)Instruction limit reached!
% 7.55/2.05 % (554087)------------------------------
% 7.55/2.05 % (554087)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.05 % (554087)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.05 % (554087)CaDiCaL version: 2.1.3
% 7.55/2.05 % (554087)Termination reason: Instruction limit
% 7.55/2.05 % (554087)Termination phase: Property scanning
% 7.55/2.05 % (554087)Time elapsed: 0.002 s
% 7.55/2.05 % (554087)Peak memory usage: 85 MB
% 7.55/2.05 % (554087)Instructions burned: 2 (million)
% 7.55/2.05 % (554085)ott+1011_1_to=kbo:plsq=on:drc=off:si=on:plsqr=32,1:sp=const_frequency:sos=all:uwa=one_side_interpreted:sac=on:random_seed=2649172179:i=8:ep=RST:nm=16:rtra=on:gtg=exists_top_2995 on theBenchmark for (2995ds/8Mi)
% 7.55/2.05 % (554085)Instruction limit reached!
% 7.55/2.05 % (554085)------------------------------
% 7.55/2.05 % (554085)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.05 % (554085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.05 % (554085)CaDiCaL version: 2.1.3
% 7.55/2.05 % (554085)Termination reason: Instruction limit
% 7.55/2.05 % (554085)Termination phase: Property scanning
% 7.55/2.05 % (554085)Time elapsed: 0.005 s
% 7.55/2.05 % (554085)Peak memory usage: 85 MB
% 7.55/2.05 % (554085)Instructions burned: 10 (million)
% 7.55/2.05 % (554091)dis+1002_1_to=lpo:sil=64000:si=on:flr=on:random_seed=3787332638:i=2:doe=on:canc=force:asg=cautious:rtra=on_2994 on theBenchmark for (2994ds/2Mi)
% 7.55/2.05 % (554092)lrs+1011_16:1_to=kbo:sil=128000:sas=z3:si=on:sos=theory:erd=off:urr=full:random_seed=407923626:i=127:doe=on:rtra=on_2994 on theBenchmark for (2994ds/127Mi)
% 7.55/2.05 % (554094)dis+10_1_si=on:random_seed=3340828994:i=10:ep=R:rtra=on_2994 on theBenchmark for (2994ds/10Mi)
% 7.55/2.05 % (554091)Instruction limit reached!
% 7.55/2.05 % (554091)------------------------------
% 7.55/2.05 % (554091)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.05 % (554091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.05 % (554091)CaDiCaL version: 2.1.3
% 7.55/2.05 % (554091)Termination reason: Instruction limit
% 7.55/2.05 % (554091)Termination phase: Property scanning
% 7.55/2.05 % (554091)Time elapsed: 0.002 s
% 7.55/2.05 % (554091)Peak memory usage: 85 MB
% 7.55/2.05 % (554091)Instructions burned: 4 (million)
% 7.55/2.05 % (554094)Instruction limit reached!
% 7.55/2.05 % (554094)------------------------------
% 7.55/2.05 % (554094)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.05 % (554094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.05 % (554094)CaDiCaL version: 2.1.3
% 7.55/2.05 % (554094)Termination reason: Instruction limit
% 7.55/2.05 % (554094)Termination phase: Preprocessing 3
% 7.55/2.05 % (554094)Time elapsed: 0.003 s
% 7.55/2.05 % (554094)Peak memory usage: 87 MB
% 7.55/2.05 % (554094)Instructions burned: 11 (million)
% 7.55/2.05 % (554095)lrs-1011_64_to=lpo:si=on:sp=unary_first:sos=on:br=off:random_seed=2915899945:i=26:canc=cautious:av=off:rtra=on_2993 on theBenchmark for (2993ds/26Mi)
% 7.55/2.05 % (554095)Instruction limit reached!
% 7.55/2.05 % (554095)------------------------------
% 7.55/2.05 % (554095)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.05 % (554095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.05 % (554095)CaDiCaL version: 2.1.3
% 7.55/2.05 % (554095)Termination reason: Instruction limit
% 7.55/2.05 % (554095)Termination phase: Property scanning
% 7.55/2.05 % (554095)Time elapsed: 0.016 s
% 7.55/2.05 % (554095)Peak memory usage: 87 MB
% 7.55/2.05 % (554095)Instructions burned: 28 (million)
% 7.55/2.05 % (554078)------------------------------
% 7.55/2.05 % (554078)------------------------------
% 7.55/2.05 % (554097)dis+1011_5_anc=all:tgt=full:si=on:sp=const_frequency:spb=non_intro:fd=preordered:sac=on:random_seed=1903933920:avsq=on:i=35:doe=on:thsqd=64:nm=64:fsr=off:thsqc=32:rtra=on:tac=light:ss=included:thsq=on:ev=off:sgt=32_2993 on theBenchmark for (2993ds/35Mi)
% 10.51/2.31 % (554099)ott+10_8:1_to=lpo:sil=128000:si=on:fs=off:spb=goal_then_units:uwa=alasca_main:random_seed=1838476221:i=2:fsr=off:rtra=on:inst=on_2993 on theBenchmark for (2993ds/2Mi)
% 10.51/2.31 % (554097)Instruction limit reached!
% 10.51/2.31 % (554097)------------------------------
% 10.51/2.31 % (554097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.51/2.31 % (554097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.51/2.31 % (554097)CaDiCaL version: 2.1.3
% 10.51/2.31 % (554097)Termination reason: Instruction limit
% 10.51/2.31 % (554097)Termination phase: Function definition elimination
% 10.51/2.31 % (554097)Time elapsed: 0.020 s
% 10.51/2.31 % (554097)Peak memory usage: 87 MB
% 10.51/2.31 % (554097)Instructions burned: 36 (million)
% 10.51/2.31 % (554099)Instruction limit reached!
% 10.51/2.31 % (554099)------------------------------
% 10.51/2.31 % (554099)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.51/2.31 % (554099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.51/2.31 % (554099)CaDiCaL version: 2.1.3
% 10.51/2.31 % (554099)Termination reason: Instruction limit
% 10.51/2.31 % (554099)Termination phase: Property scanning
% 10.51/2.31 % (554099)Time elapsed: 0.002 s
% 10.51/2.31 % (554099)Peak memory usage: 85 MB
% 10.51/2.31 % (554099)Instructions burned: 3 (million)
% 10.51/2.31 % (554092)Instruction limit reached!
% 10.51/2.31 % (554092)------------------------------
% 10.51/2.31 % (554092)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.51/2.31 % (554092)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.51/2.31 % (554092)CaDiCaL version: 2.1.3
% 10.51/2.31 % (554092)Termination reason: Instruction limit
% 10.51/2.31 % (554092)Termination phase: Saturation
% 10.51/2.31 % (554092)Time elapsed: 0.109 s
% 10.51/2.31 % (554092)Peak memory usage: 118 MB
% 10.51/2.31 % (554092)Instructions burned: 127 (million)
% 10.51/2.31 % (554104)lrs-1011_1_to=kbo:sil=128000:prc=on:si=on:fs=off:tha=off:random_seed=2686655252:i=370:ep=RS:fsr=off:rtra=on_2993 on theBenchmark for (2993ds/370Mi)
% 10.51/2.31 % (554103)dis+21_1_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=off:s2agt=16:random_seed=1617624780:s2a=on:i=8:kws=inv_precedence:doe=on:rtra=on_2993 on theBenchmark for (2993ds/8Mi)
% 10.51/2.31 % (554103)Instruction limit reached!
% 10.51/2.31 % (554103)------------------------------
% 10.51/2.31 % (554103)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.51/2.31 % (554103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.51/2.31 % (554103)CaDiCaL version: 2.1.3
% 10.51/2.31 % (554103)Termination reason: Instruction limit
% 10.51/2.31 % (554103)Termination phase: Preprocessing 1
% 10.51/2.31 % (554103)Time elapsed: 0.008 s
% 10.51/2.31 % (554103)Peak memory usage: 86 MB
% 10.51/2.31 % (554103)Instructions burned: 9 (million)
% 10.51/2.31 % (554112)lrs+1002_1_to=lpo:sil=128000:sas=z3:si=on:sos=on:urr=on:tha=off:random_seed=625053065:i=226:rtra=on:gtg=position:ss=axioms_2992 on theBenchmark for (2992ds/226Mi)
% 10.51/2.31 % (554104)Instruction limit reached!
% 10.51/2.31 % (554104)------------------------------
% 10.51/2.31 % (554104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.51/2.31 % (554104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.51/2.31 % (554104)CaDiCaL version: 2.1.3
% 10.51/2.31 % (554104)Termination reason: Instruction limit
% 10.51/2.31 % (554104)Termination phase: Saturation
% 10.51/2.31 % (554104)Time elapsed: 0.172 s
% 10.51/2.31 % (554104)Peak memory usage: 93 MB
% 10.51/2.31 % (554104)Instructions burned: 371 (million)
% 10.51/2.31 % (554112)Refutation not found, incomplete strategy
% 10.51/2.31 % (554112)------------------------------
% 10.51/2.31 % (554112)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.51/2.31 % (554112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.51/2.31 % (554112)CaDiCaL version: 2.1.3
% 10.51/2.31 % (554112)Termination reason: Refutation not found, incomplete strategy
% 10.51/2.31 % (554112)Time elapsed: 0.039 s
% 10.51/2.31 % (554112)Peak memory usage: 111 MB
% 10.51/2.31 % (554112)Instructions burned: 13 (million)
% 10.51/2.31 % (554109)ott+1002_1_to=lpo:thi=overlap:prc=on:bsd=on:si=on:gve=cautious:thigen=on:tha=some:random_seed=1589875363:i=13:av=off:rtra=on:gtg=exists_sym:ev=force_2992 on theBenchmark for (2992ds/13Mi)
% 10.51/2.31 % (554109)Instruction limit reached!
% 10.51/2.31 % (554109)------------------------------
% 10.51/2.31 % (554109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554109)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554109)Termination reason: Instruction limit
% 11.26/2.45 % (554109)Termination phase: Property scanning
% 11.26/2.45 % (554109)Time elapsed: 0.013 s
% 11.26/2.45 % (554109)Peak memory usage: 86 MB
% 11.26/2.45 % (554109)Instructions burned: 13 (million)
% 11.26/2.45 % (554118)lrs+1010_5_to=lpo:sil=128000:si=on:sp=const_frequency:sos=theory:tha=off:random_seed=2042167089:i=10:rtra=on_2992 on theBenchmark for (2992ds/10Mi)
% 11.26/2.45 % (554120)lrs+1002_1_to=lpo:thi=strong:sas=z3:si=on:sp=const_frequency:tha=off:random_seed=2102268298:i=71:rtra=on:gtg=exists_top_2991 on theBenchmark for (2991ds/71Mi)
% 11.26/2.45 % (554118)Instruction limit reached!
% 11.26/2.45 % (554118)------------------------------
% 11.26/2.45 % (554118)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554118)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554118)Termination reason: Instruction limit
% 11.26/2.45 % (554118)Termination phase: Preprocessing 3
% 11.26/2.45 % (554118)Time elapsed: 0.012 s
% 11.26/2.45 % (554118)Peak memory usage: 86 MB
% 11.26/2.45 % (554118)Instructions burned: 11 (million)
% 11.26/2.45 % (554121)lrs+1010_1_to=lpo:prlc=on:sil=128000:prc=on:drc=off:si=on:sp=const_max:thsqr=8,1:tha=some:nwc=5:random_seed=967359279:i=75:doe=on:thsqd=64:canc=force:thsqc=64:rtra=on:thsq=on_2991 on theBenchmark for (2991ds/75Mi)
% 11.26/2.45 % (554121)Instruction limit reached!
% 11.26/2.45 % (554121)------------------------------
% 11.26/2.45 % (554121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554121)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554121)Termination reason: Instruction limit
% 11.26/2.45 % (554121)Termination phase: Saturation
% 11.26/2.45 % (554121)Time elapsed: 0.068 s
% 11.26/2.45 % (554121)Peak memory usage: 91 MB
% 11.26/2.45 % (554121)Instructions burned: 76 (million)
% 11.26/2.45 % (554120)Instruction limit reached!
% 11.26/2.45 % (554120)------------------------------
% 11.26/2.45 % (554120)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554120)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554120)Termination reason: Instruction limit
% 11.26/2.45 % (554120)Termination phase: Saturation
% 11.26/2.45 % (554120)Time elapsed: 0.121 s
% 11.26/2.45 % (554120)Peak memory usage: 130 MB
% 11.26/2.45 % (554120)Instructions burned: 71 (million)
% 11.26/2.45 % (554124)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=2330592191:i=294:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2990 on theBenchmark for (2990ds/294Mi)
% 11.26/2.45 % (554129)ott+21_1_to=kbo:tgt=full:sas=z3:si=on:tha=off:random_seed=1883258341:i=130:kws=inv_frequency:nm=0:rtra=on:gtg=exists_all_2990 on theBenchmark for (2990ds/130Mi)
% 11.26/2.45 % (554140)lrs+21_1_to=kbo:sil=64000:thi=all:sas=z3:si=on:spb=goal_then_units:tha=off:nwc=3:random_seed=3201149909:i=131:rtra=on_2989 on theBenchmark for (2989ds/131Mi)
% 11.26/2.45 % (554129)Instruction limit reached!
% 11.26/2.45 % (554129)------------------------------
% 11.26/2.45 % (554129)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554129)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554129)Termination reason: Instruction limit
% 11.26/2.45 % (554129)Termination phase: Saturation
% 11.26/2.45 % (554129)Time elapsed: 0.080 s
% 11.26/2.45 % (554129)Peak memory usage: 118 MB
% 11.26/2.45 % (554129)Instructions burned: 130 (million)
% 11.26/2.45 % (554141)dis+1010_16_to=lpo:sil=64000:thi=strong:sas=z3:si=on:nwc=5:random_seed=1629668422:i=40:gtgl=2:rtra=on:gtg=exists_sym:ev=force_2989 on theBenchmark for (2989ds/40Mi)
% 11.26/2.45 % (554112)------------------------------
% 11.26/2.45 % (554112)------------------------------
% 11.26/2.45 % (554140)Instruction limit reached!
% 11.26/2.45 % (554140)------------------------------
% 11.26/2.45 % (554140)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554140)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554140)Termination reason: Instruction limit
% 11.26/2.45 % (554140)Termination phase: Saturation
% 11.26/2.45 % (554140)Time elapsed: 0.132 s
% 11.26/2.45 % (554140)Peak memory usage: 135 MB
% 11.26/2.45 % (554140)Instructions burned: 133 (million)
% 11.26/2.45 % (554141)Instruction limit reached!
% 11.26/2.45 % (554141)------------------------------
% 11.26/2.45 % (554141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554141)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554141)Termination reason: Instruction limit
% 11.26/2.45 % (554141)Termination phase: Function definition elimination
% 11.26/2.45 % (554141)Time elapsed: 0.037 s
% 11.26/2.45 % (554141)Peak memory usage: 88 MB
% 11.26/2.45 % (554141)Instructions burned: 40 (million)
% 11.26/2.45 % (554145)lrs+10_1_to=lpo:sil=64000:si=on:sos=on:urr=on:random_seed=1059371567:i=307:rtra=on:gtg=exists_top_2988 on theBenchmark for (2988ds/307Mi)
% 11.26/2.45 % (554124)Instruction limit reached!
% 11.26/2.45 % (554124)------------------------------
% 11.26/2.45 % (554124)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554124)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554124)Termination reason: Instruction limit
% 11.26/2.45 % (554124)Termination phase: Saturation
% 11.26/2.45 % (554124)Time elapsed: 0.284 s
% 11.26/2.45 % (554124)Peak memory usage: 93 MB
% 11.26/2.45 % (554124)Instructions burned: 295 (million)
% 11.26/2.45 % (554149)ott+1010_3:1_to=kbo:sil=128000:thi=overlap:sas=z3:si=on:urr=on:tha=off:s2agt=32:random_seed=43976392:s2a=on:i=598:doe=on:bs=on:canc=cautious:fsr=off:rtra=on_2988 on theBenchmark for (2988ds/598Mi)
% 11.26/2.45 % (554145)First to succeed.
% 11.26/2.45 % (554145)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-553919"
% 11.26/2.45 % (554159)lrs+1011_5:1_to=kbo:sil=64000:thi=all:si=on:uwa=ground:br=off:random_seed=3446766765:i=131:canc=cautious:fsr=off:rtra=on_2987 on theBenchmark for (2987ds/131Mi)
% 11.26/2.45 % (554164)dis+11_1_to=lpo:pum=on:sas=z3:si=on:sp=reverse_arity:sos=theory:thsqr=2,1:tha=some:s2agt=20:random_seed=1403597259:s2pl=no:i=259:sd=10:thsqd=64:thsqc=64:rtra=on:ss=axioms:thsq=on_2986 on theBenchmark for (2986ds/259Mi)
% 11.26/2.45 % (554166)dis+10_1_si=on:random_seed=2793055665:s2a=on:i=1000:rtra=on:gtg=exists_all_2986 on theBenchmark for (2986ds/1000Mi)
% 11.26/2.45 % (554175)lrs+10_1_to=kbo:sil=64000:si=on:norm_ineq=on:sp=unary_frequency:random_seed=1806684777:i=141:doe=on:rtra=on_2985 on theBenchmark for (2985ds/141Mi)
% 11.26/2.45 % (554167)dis+1010_1_to=lpo:sil=128000:tgt=full:si=on:sp=const_frequency:uwa=off:tha=off:nwc=1:random_seed=2456323736:i=383:fsr=off:rtra=on:ev=force_2986 on theBenchmark for (2986ds/383Mi)
% 11.26/2.45 % (554164)Refutation not found, incomplete strategy
% 11.26/2.45 % (554164)------------------------------
% 11.26/2.45 % (554164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554164)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554164)Termination reason: Refutation not found, incomplete strategy
% 11.26/2.45 % (554164)Time elapsed: 0.030 s
% 11.26/2.45 % (554164)Peak memory usage: 111 MB
% 11.26/2.45 % (554164)Instructions burned: 14 (million)
% 11.26/2.45 % (554166)Also succeeded, but the first one will report.
% 11.26/2.45 % (554159)Instruction limit reached!
% 11.26/2.45 % (554159)------------------------------
% 11.26/2.45 % (554159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554159)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554159)Termination reason: Instruction limit
% 11.26/2.45 % (554159)Termination phase: Saturation
% 11.26/2.45 % (554159)Time elapsed: 0.101 s
% 11.26/2.45 % (554159)Peak memory usage: 118 MB
% 11.26/2.45 % (554159)Instructions burned: 131 (million)
% 11.26/2.45 % (554175)Instruction limit reached!
% 11.26/2.45 % (554175)------------------------------
% 11.26/2.45 % (554175)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.26/2.45 % (554175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.26/2.45 % (554175)CaDiCaL version: 2.1.3
% 11.26/2.45 % (554175)Termination reason: Instruction limit
% 11.26/2.45 % (554175)Termination phase: Saturation
% 11.26/2.45 % (554175)Time elapsed: 0.047 s
% 11.26/2.45 % (554175)Peak memory usage: 91 MB
% 11.26/2.45 % (554175)Instructions burned: 143 (million)
% 11.26/2.45 % (554145)Refutation found. Thanks to Tanya!
% 11.26/2.45 % SZS status Unsatisfiable for theBenchmark
% 11.26/2.45 % SZS output start Proof for theBenchmark
% See solution above
% 12.78/2.56 % (554145)------------------------------
% 12.78/2.56 % (554145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.78/2.56 % (554145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.78/2.56 % (554145)CaDiCaL version: 2.1.3
% 12.78/2.56 % (554145)Termination reason: Refutation
% 12.78/2.56 % (554145)Time elapsed: 0.082 s
% 12.78/2.56 % (554145)Peak memory usage: 91 MB
% 12.78/2.56 % (554145)Instructions burned: 87 (million)
% 12.78/2.56 % (554145)------------------------------
% 12.78/2.56 % (554145)------------------------------
% 12.78/2.56 % (553919)Success in time 1.782 s
% 12.78/2.56 % Vampire exiting
%------------------------------------------------------------------------------