%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ARI755_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.31s 1.35s
% Output : Refutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 71 ( 35 unt; 0 typ; 0 def)
% Number of atoms : 163 ( 116 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 122 ( 30 ~; 33 |; 52 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 218 ( 46 atm; 23 fun; 34 num; 115 var)
% Number of types : 8 ( 5 usr; 2 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 36 ( 32 usr; 1 prp; 0-4 aty)
% Number of functors : 398 ( 395 usr; 32 con; 0-9 aty)
% Number of variables : 290 ( 257 !; 33 ?; 290 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
c_sorted: $tType ).
tff(type_def_6,type,
'Unit': $tType ).
tff(type_def_7,type,
c_unsorted: $tType ).
tff(type_def_8,type,
c_Boolean: $tType ).
tff(type_def_9,type,
c_type: $tType ).
tff(func_def_0,type,
lsl: ( $int * $int ) > $int ).
tff(func_def_1,type,
char_P_tag: c_unsorted ).
tff(func_def_2,type,
pset_union: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_3,type,
int_of_tag: c_sorted > $int ).
tff(func_def_4,type,
bool_not: c_Boolean > c_Boolean ).
tff(func_def_5,type,
int_min: ( $int * $int ) > $int ).
tff(func_def_6,type,
c_Boolean_true: c_Boolean ).
tff(func_def_7,type,
bitvector_of_char_P: c_sorted > c_unsorted ).
tff(func_def_8,type,
base_block: c_sorted > c_unsorted ).
tff(func_def_9,type,
downcast: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_10,type,
pset_empty: c_unsorted ).
tff(func_def_11,type,
pset_range: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_12,type,
tag_table: c_type > c_type ).
tff(func_def_13,type,
int32_of_integer: $int > c_unsorted ).
tff(func_def_14,type,
int_max: ( $int * $int ) > $int ).
tff(func_def_15,type,
c_unit: c_type ).
tff(func_def_16,type,
pset_deref: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_17,type,
tag_id: c_type > c_type ).
tff(func_def_18,type,
offset_max_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_19,type,
neq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_20,type,
store_bytes: ( c_sorted * c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_21,type,
s2bool: c_sorted > c_Boolean ).
tff(func_def_22,type,
subtag_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_23,type,
abs_real: $real > $real ).
tff(func_def_24,type,
replace_bytes: ( c_sorted * $int * $int * c_sorted ) > c_unsorted ).
tff(func_def_25,type,
neq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_26,type,
abs_int: $int > $int ).
tff(func_def_27,type,
c_Boolean_false: c_Boolean ).
tff(func_def_28,type,
bool_or: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_29,type,
eq_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_30,type,
lt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_31,type,
block: c_type > c_type ).
tff(func_def_32,type,
int32_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_33,type,
log: $real > $real ).
tff(func_def_34,type,
bitvector_of_int32: c_sorted > c_unsorted ).
tff(func_def_35,type,
pset: c_type > c_type ).
tff(func_def_36,type,
address: c_sorted > $int ).
tff(func_def_37,type,
shift: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_38,type,
exp: $real > $real ).
tff(func_def_39,type,
gt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_40,type,
offset_min_bytes: ( c_sorted * c_sorted * $int ) > $int ).
tff(func_def_41,type,
null: c_unsorted ).
tff(func_def_42,type,
eq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_43,type,
unit2u: 'Unit' > c_unsorted ).
tff(func_def_44,type,
pset_range_left: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_45,type,
le_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_46,type,
void_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_47,type,
s2real: c_sorted > $real ).
tff(func_def_48,type,
concat_bitvector: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_49,type,
pset_range_right: ( c_sorted * $int ) > c_unsorted ).
tff(func_def_50,type,
int2u: $int > c_unsorted ).
tff(func_def_51,type,
int8_of_integer: $int > c_unsorted ).
tff(func_def_52,type,
s2unit: c_sorted > 'Unit' ).
tff(func_def_53,type,
s2int: c_sorted > $int ).
tff(func_def_54,type,
void_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_55,type,
c_real: c_type ).
tff(func_def_56,type,
real_max: ( $real * $real ) > $real ).
tff(func_def_57,type,
lt_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_58,type,
offset_max: ( c_sorted * c_sorted ) > $int ).
tff(func_def_59,type,
smtlib__select: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_60,type,
memory: ( c_type * c_type ) > c_type ).
tff(func_def_61,type,
real2u: $real > c_unsorted ).
tff(func_def_62,type,
int8: c_type ).
tff(func_def_63,type,
int32: c_type ).
tff(func_def_64,type,
bw_and: ( $int * $int ) > $int ).
tff(func_def_65,type,
gt_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_66,type,
c_sort: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_67,type,
offset_min: ( c_sorted * c_sorted ) > $int ).
tff(func_def_68,type,
typeof: ( c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_69,type,
bitvector_of_int8: c_sorted > c_unsorted ).
tff(func_def_70,type,
void_P_tag: c_unsorted ).
tff(func_def_71,type,
char_P_of_pointer_address: c_sorted > c_unsorted ).
tff(func_def_72,type,
le_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_73,type,
bottom_tag: c_unsorted ).
tff(func_def_74,type,
bitvector: c_type ).
tff(func_def_75,type,
integer_of_int8: c_sorted > $int ).
tff(func_def_76,type,
lsr: ( $int * $int ) > $int ).
tff(func_def_77,type,
pset_all: c_sorted > c_unsorted ).
tff(func_def_78,type,
pointer_address: c_sorted > c_unsorted ).
tff(func_def_79,type,
extract_bytes: ( c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_80,type,
bool_and: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_81,type,
smtlib__ite: ( c_Boolean * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_82,type,
bool_xor: ( c_Boolean * c_Boolean ) > c_Boolean ).
tff(func_def_83,type,
ge_real_bool: ( $real * $real ) > c_Boolean ).
tff(func_def_84,type,
eq_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_85,type,
c_bool: c_type ).
tff(func_def_86,type,
pset_singleton: c_sorted > c_unsorted ).
tff(func_def_87,type,
bitvector_of_void_P: c_sorted > c_unsorted ).
tff(func_def_88,type,
pointer: c_type > c_type ).
tff(func_def_89,type,
select_bytes: ( c_sorted * c_sorted * $int * $int ) > c_unsorted ).
tff(func_def_90,type,
bool2u: c_Boolean > c_unsorted ).
tff(func_def_91,type,
void_P: c_type ).
tff(func_def_92,type,
integer_of_int32: c_sorted > $int ).
tff(func_def_93,type,
char_P_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_94,type,
asr: ( $int * $int ) > $int ).
tff(func_def_95,type,
c_int: c_type ).
tff(func_def_96,type,
neq_pointer_bool: ( c_sorted * c_sorted ) > c_Boolean ).
tff(func_def_97,type,
int8_of_bitvector: c_sorted > c_unsorted ).
tff(func_def_98,type,
alloc_table: c_type > c_type ).
tff(func_def_99,type,
sub_pointer: ( c_sorted * c_sorted ) > $int ).
tff(func_def_100,type,
char_P: c_type ).
tff(func_def_101,type,
real_min: ( $real * $real ) > $real ).
tff(func_def_102,type,
ge_int_bool: ( $int * $int ) > c_Boolean ).
tff(func_def_103,type,
smtlib__store: ( c_sorted * c_sorted * c_sorted ) > c_unsorted ).
tff(func_def_119,type,
sK0: ( $real * $real ) > $real ).
tff(func_def_120,type,
sK1: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_121,type,
sK2: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_122,type,
sK3: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_123,type,
sK4: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_124,type,
sK5: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_125,type,
sK6: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_126,type,
sK7: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_127,type,
sK8: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_128,type,
sK9: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_129,type,
sK10: ( c_unsorted * $int * c_unsorted * c_type ) > $int ).
tff(func_def_130,type,
sK11: ( c_unsorted * $int * c_unsorted * c_type ) > $int ).
tff(func_def_131,type,
sK12: ( c_unsorted * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_132,type,
sK13: ( c_unsorted * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_133,type,
sK14: ( c_unsorted * c_unsorted * $int * c_type ) > c_unsorted ).
tff(func_def_134,type,
sK15: ( c_unsorted * c_unsorted * $int * c_type ) > $int ).
tff(func_def_135,type,
sK16: ( c_unsorted * c_unsorted * $int * c_type ) > c_sorted ).
tff(func_def_136,type,
sK17: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_137,type,
sK18: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_138,type,
sK19: ( c_unsorted * $int * c_unsorted * c_type ) > $int ).
tff(func_def_139,type,
sK20: ( c_unsorted * $int * c_unsorted * c_type ) > $int ).
tff(func_def_140,type,
sK21: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_141,type,
sK22: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_142,type,
sK23: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_143,type,
sK24: ( c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_144,type,
sK25: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_145,type,
sK26: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_146,type,
sK27: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_147,type,
sK28: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_148,type,
sK29: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_149,type,
sK30: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_150,type,
sK31: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_151,type,
sK32: ( c_unsorted * c_type * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_152,type,
sK33: ( c_unsorted * c_type * $int * $int * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_153,type,
sK34: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_154,type,
sK35: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_155,type,
sK36: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_156,type,
sK37: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_157,type,
sK38: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_158,type,
sK39: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_159,type,
sK40: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_160,type,
sK41: ( c_type * c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_161,type,
sK42: ( $int * c_unsorted * $int * c_type * $int * $int ) > c_type ).
tff(func_def_162,type,
sK43: ( $int * c_unsorted * $int * c_type * $int * $int ) > c_sorted ).
tff(func_def_163,type,
sK44: ( c_unsorted * c_type * $int * c_unsorted ) > c_type ).
tff(func_def_164,type,
sK45: ( c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_165,type,
sK46: ( c_unsorted * c_type * $int * c_unsorted ) > c_sorted ).
tff(func_def_166,type,
sK47: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_167,type,
sK48: ( $int * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_168,type,
sK49: ( $int * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_169,type,
sK50: c_unsorted > c_sorted ).
tff(func_def_170,type,
sK51: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_171,type,
sK52: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_172,type,
sK53: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_173,type,
sK54: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_174,type,
sK55: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_175,type,
sK56: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_176,type,
sK57: ( c_type * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_177,type,
sK58: ( $int * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_178,type,
sK59: ( $int * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_179,type,
sK60: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_180,type,
sK61: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_181,type,
sK62: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_182,type,
sK63: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_183,type,
sK64: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_184,type,
sK65: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_185,type,
sK66: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_186,type,
sK67: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_187,type,
sK68: c_unsorted > c_type ).
tff(func_def_188,type,
sK69: c_unsorted > c_sorted ).
tff(func_def_189,type,
sK70: ( c_unsorted * $int * c_unsorted * $int * c_type ) > c_type ).
tff(func_def_190,type,
sK71: ( c_unsorted * $int * c_unsorted * $int * c_type ) > c_unsorted ).
tff(func_def_191,type,
sK72: ( c_unsorted * $int * c_unsorted * $int * c_type ) > $int ).
tff(func_def_192,type,
sK73: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_193,type,
sK74: ( c_unsorted * $int * c_unsorted * $int * c_type * c_unsorted * $int ) > c_sorted ).
tff(func_def_194,type,
sK75: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_195,type,
sK76: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_196,type,
sK77: ( c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_197,type,
sK78: ( c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_198,type,
sK79: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_199,type,
sK80: ( $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_200,type,
sK81: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_201,type,
sK82: ( $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_202,type,
sK83: ( c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_203,type,
sK84: ( $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_204,type,
sK85: ( $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_205,type,
sK86: ( $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_206,type,
sK87: ( $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_207,type,
sK88: ( $int * c_unsorted * c_unsorted * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_208,type,
sK89: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_209,type,
sK90: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_210,type,
sK91: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_211,type,
sK92: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_212,type,
sK93: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_213,type,
sK94: ( $int * c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_214,type,
sK95: ( $int * c_unsorted * c_unsorted * c_type ) > $int ).
tff(func_def_215,type,
sK96: ( $int * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_216,type,
sK97: ( $int * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_217,type,
sK98: c_unsorted > c_sorted ).
tff(func_def_218,type,
sK99: ( c_unsorted * c_type ) > c_type ).
tff(func_def_219,type,
sK100: ( $int * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_220,type,
sK101: ( $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_221,type,
sK102: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_222,type,
sK103: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_223,type,
sK104: ( c_unsorted * c_unsorted * c_type ) > c_unsorted ).
tff(func_def_224,type,
sK105: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_225,type,
sK106: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_226,type,
sK107: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_227,type,
sK108: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_228,type,
sK109: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_229,type,
sK110: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_230,type,
sK111: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_231,type,
sK112: ( c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_232,type,
sK113: c_unsorted > $int ).
tff(func_def_233,type,
sK114: ( c_unsorted * $int * $int * c_unsorted * $int * c_unsorted * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_234,type,
sK115: ( c_unsorted * $int * $int * c_unsorted * $int * c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_235,type,
sK116: ( c_unsorted * $int * $int * c_unsorted * $int * c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_236,type,
sK117: ( c_unsorted * $int * $int * c_unsorted * $int * c_unsorted * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_237,type,
sK118: ( c_unsorted * $int * $int * c_unsorted * $int * c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_238,type,
sK119: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_239,type,
sK120: ( $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_240,type,
sK121: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_241,type,
sK122: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_242,type,
sK123: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_243,type,
sK124: ( c_unsorted * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_244,type,
sK125: ( c_unsorted * $int * c_unsorted * c_type ) > c_type ).
tff(func_def_245,type,
sK126: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_246,type,
sK127: ( c_unsorted * $int * c_unsorted * c_type ) > c_sorted ).
tff(func_def_247,type,
sK128: c_unsorted > c_sorted ).
tff(func_def_248,type,
sK129: ( $int * $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_249,type,
sK130: ( $int * $int * c_unsorted * c_type * c_unsorted ) > $int ).
tff(func_def_250,type,
sK131: ( $int * $int * c_unsorted * c_type * c_unsorted ) > c_unsorted ).
tff(func_def_251,type,
sK132: ( $int * $int * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_252,type,
sK133: ( $int * $int * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_253,type,
sK134: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_254,type,
sK135: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_255,type,
sK136: ( c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_256,type,
sK137: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_257,type,
sK138: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_258,type,
sK139: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_259,type,
sK140: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_260,type,
sK141: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_261,type,
sK142: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_262,type,
sK143: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_263,type,
sK144: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_264,type,
sK145: ( $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_265,type,
sK146: ( c_type * c_unsorted ) > c_type ).
tff(func_def_266,type,
sK147: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_267,type,
sK148: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_268,type,
sK149: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_269,type,
sK150: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_270,type,
sK151: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_271,type,
sK152: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_272,type,
sK153: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_273,type,
sK154: ( $int * c_unsorted * c_unsorted * c_unsorted * $int * c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_274,type,
sK155: c_unsorted > c_type ).
tff(func_def_275,type,
sK156: c_unsorted > c_sorted ).
tff(func_def_276,type,
sK157: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_277,type,
sK158: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_278,type,
sK159: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_279,type,
sK160: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_280,type,
sK161: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_281,type,
sK162: c_unsorted > c_sorted ).
tff(func_def_282,type,
sK163: c_type ).
tff(func_def_283,type,
sK164: ( $int * c_unsorted * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_284,type,
sK165: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_285,type,
sK166: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_286,type,
sK167: ( $int * $int * $int * c_unsorted * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_287,type,
sK168: c_unsorted > c_type ).
tff(func_def_288,type,
sK169: c_unsorted > c_sorted ).
tff(func_def_289,type,
sK170: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_290,type,
sK171: ( c_type * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_291,type,
sK172: ( c_type * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_292,type,
sK173: c_type > c_type ).
tff(func_def_293,type,
sK174: ( c_unsorted * c_unsorted * c_unsorted * $int * c_type * $int * $int * c_unsorted * $int ) > c_type ).
tff(func_def_294,type,
sK175: ( c_unsorted * c_unsorted * c_unsorted * $int * c_type * $int * $int * c_unsorted * $int ) > c_type ).
tff(func_def_295,type,
sK176: ( c_unsorted * c_unsorted * c_unsorted * $int * c_type * $int * $int * c_unsorted * $int ) > c_type ).
tff(func_def_296,type,
sK177: ( c_unsorted * c_unsorted * c_unsorted * $int * c_type * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_297,type,
sK178: ( c_unsorted * c_unsorted * c_unsorted * $int * c_type * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_298,type,
sK179: ( c_unsorted * c_unsorted * c_unsorted * $int * c_type * $int * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_299,type,
sK180: c_unsorted > c_sorted ).
tff(func_def_300,type,
sK181: c_unsorted ).
tff(func_def_301,type,
sK182: c_unsorted ).
tff(func_def_302,type,
sK183: c_unsorted ).
tff(func_def_303,type,
sK184: c_unsorted ).
tff(func_def_304,type,
sK185: c_unsorted ).
tff(func_def_305,type,
sK186: c_unsorted ).
tff(func_def_306,type,
sK187: c_unsorted > c_type ).
tff(func_def_307,type,
sK188: c_unsorted > c_sorted ).
tff(func_def_308,type,
sK189: c_unsorted > c_sorted ).
tff(func_def_309,type,
sK190: c_type > c_type ).
tff(func_def_310,type,
sK191: ( c_type * c_unsorted ) > c_type ).
tff(func_def_311,type,
sK192: ( c_type * c_unsorted ) > c_sorted ).
tff(func_def_312,type,
sK193: ( c_type * c_unsorted * $int * $int ) > c_type ).
tff(func_def_313,type,
sK194: ( c_type * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_314,type,
sK195: ( $int * c_type * $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_315,type,
sK196: ( $int * c_type * $int * c_unsorted * $int * c_unsorted ) > c_type ).
tff(func_def_316,type,
sK197: ( $int * c_type * $int * c_unsorted * $int * c_unsorted ) > c_sorted ).
tff(func_def_317,type,
sK198: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_318,type,
sK199: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_319,type,
sK200: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_320,type,
sK201: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_321,type,
sK202: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_322,type,
sK203: ( $real * $real ) > $real ).
tff(func_def_323,type,
sK204: c_type > c_type ).
tff(func_def_324,type,
sK205: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_325,type,
sK206: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_326,type,
sK207: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_327,type,
sK208: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_328,type,
sK209: ( c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_329,type,
sK210: ( $int * c_unsorted * c_unsorted * $int * $int * $int ) > c_sorted ).
tff(func_def_330,type,
sK211: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_331,type,
sK212: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_332,type,
sK213: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_333,type,
sK214: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_334,type,
sK215: ( c_type * c_unsorted * $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_335,type,
sK216: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_336,type,
sK217: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_337,type,
sK218: ( c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_338,type,
sK219: ( c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_339,type,
sK220: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_340,type,
sK221: ( c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_341,type,
sK222: ( $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_342,type,
sK223: ( $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_343,type,
sK224: ( $int * c_unsorted * $int * $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_344,type,
sK225: c_unsorted > c_type ).
tff(func_def_345,type,
sK226: c_unsorted > c_sorted ).
tff(func_def_346,type,
sK227: c_unsorted > $int ).
tff(func_def_347,type,
sK228: ( $real * $real ) > $real ).
tff(func_def_348,type,
sK229: ( c_unsorted * c_type ) > c_sorted ).
tff(func_def_349,type,
sK230: c_type ).
tff(func_def_350,type,
sK231: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_351,type,
sK232: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_352,type,
sK233: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_353,type,
sK234: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_354,type,
sK235: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_355,type,
sK236: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_356,type,
sK237: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_type ).
tff(func_def_357,type,
sK238: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_358,type,
sK239: ( c_unsorted * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_359,type,
sK240: ( $int * $int * c_type * c_unsorted ) > c_type ).
tff(func_def_360,type,
sK241: ( $int * $int * c_type * c_unsorted ) > c_sorted ).
tff(func_def_361,type,
sK242: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_362,type,
sK243: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_363,type,
sK244: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_364,type,
sK245: ( c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_365,type,
sK246: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_366,type,
sK247: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_367,type,
sK248: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_368,type,
sK249: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_369,type,
sK250: ( c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_370,type,
sK251: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_371,type,
sK252: ( c_type * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_372,type,
sK253: ( c_unsorted * c_unsorted * c_type ) > c_sorted ).
tff(func_def_373,type,
sK254: ( $int * $int * c_unsorted * $int * $int ) > c_sorted ).
tff(func_def_374,type,
sK255: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_375,type,
sK256: ( c_unsorted * $int * c_unsorted * $int ) > c_sorted ).
tff(func_def_376,type,
sK257: ( c_unsorted * $int * c_type * c_unsorted ) > $int ).
tff(func_def_377,type,
sK258: ( c_unsorted * $int * c_type * c_unsorted * $int ) > c_type ).
tff(func_def_378,type,
sK259: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_379,type,
sK260: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_380,type,
sK261: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_381,type,
sK262: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted ) > c_unsorted ).
tff(func_def_382,type,
sK263: ( c_unsorted * c_unsorted * c_type * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_383,type,
sK264: c_unsorted > c_type ).
tff(func_def_384,type,
sK265: c_unsorted > c_sorted ).
tff(func_def_385,type,
sK266: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_386,type,
sK267: ( c_unsorted * $int * $int * c_unsorted ) > c_sorted ).
tff(func_def_387,type,
sK268: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_388,type,
sK269: ( $int * $int * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_389,type,
sK270: ( c_type * c_unsorted * c_unsorted * $int ) > c_type ).
tff(func_def_390,type,
sK271: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_391,type,
sK272: ( c_type * c_unsorted * c_unsorted * $int ) > c_sorted ).
tff(func_def_392,type,
sK273: c_type > c_type ).
tff(func_def_393,type,
sK274: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_394,type,
sK275: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_type ).
tff(func_def_395,type,
sK276: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_396,type,
sK277: ( c_unsorted * c_unsorted * c_type * c_unsorted ) > c_sorted ).
tff(func_def_397,type,
sK278: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_type ).
tff(func_def_398,type,
sK279: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_399,type,
sK280: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_400,type,
sK281: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_401,type,
sK282: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_402,type,
sK283: ( c_unsorted * c_type * c_unsorted * c_type * c_unsorted * c_unsorted * c_unsorted ) > c_sorted ).
tff(func_def_403,type,
sK284: ( $real * $real ) > $real ).
tff(func_def_408,type,
'$inst285': $int ).
tff(func_def_409,type,
'$inst286': $int ).
tff(func_def_410,type,
'$inst287': $int ).
tff(func_def_411,type,
'$inst288': $int ).
tff(func_def_412,type,
'$inst289': $real ).
tff(func_def_413,type,
'$inst290': $real ).
tff(pred_def_1,type,
left_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_2,type,
strict_valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_3,type,
root_tag: c_sorted > $o ).
tff(pred_def_4,type,
alloc_extends: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_5,type,
valid_root_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_6,type,
valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_7,type,
eq_int8: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_8,type,
same_block: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_9,type,
pset_included: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_10,type,
strict_valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_11,type,
in_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_12,type,
instanceof: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_13,type,
alloc_extends_except: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_14,type,
not_assigns: ( c_sorted * c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_15,type,
valid_bitvector_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_16,type,
parenttag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_17,type,
valid_pset: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_18,type,
right_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_19,type,
strict_valid_struct_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_20,type,
valid_bitvector_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_21,type,
right_valid_struct_void_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(pred_def_22,type,
valid: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_23,type,
full_separated: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_24,type,
strict_valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_25,type,
valid_root_char_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_26,type,
fully_packed: ( c_sorted * c_sorted * c_sorted ) > $o ).
tff(pred_def_27,type,
alloc_fresh: ( c_sorted * c_sorted * $int ) > $o ).
tff(pred_def_28,type,
eq_int32: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_29,type,
subtag: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_30,type,
valid_struct_void_P: ( c_sorted * $int * $int * c_sorted ) > $o ).
tff(pred_def_31,type,
pset_disjoint: ( c_sorted * c_sorted ) > $o ).
tff(pred_def_32,type,
left_valid_struct_char_P: ( c_sorted * $int * c_sorted ) > $o ).
tff(f47,axiom,
! [X0: c_type,X1: c_unsorted] : $lesseq(0,address(c_sort(pointer(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_47) ).
tff(f48,axiom,
! [X1: c_unsorted,X3: $int,X2: $int,X0: c_type] :
? [X4: c_type] :
( ? [X5: c_sorted] :
( ( X5 = c_sort(X4,X1) )
& ( $less(X2,X3)
<=> $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X3)))) ) )
& ( X4 = pointer(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_48) ).
tff(f62,axiom,
! [X1: c_unsorted,X0: c_type] :
? [X2: c_sorted] :
( ( sub_pointer(X2,X2) = 0 )
& ( X2 = c_sort(pointer(X0),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_62) ).
tff(f64,axiom,
! [X3: $int,X0: c_type,X2: c_unsorted,X1: c_unsorted] :
? [X4: c_type] :
( ? [X6: c_sorted,X5: c_sorted] :
( ( X5 = c_sort(X4,X1) )
& ( X6 = c_sort(X4,X2) )
& ( sub_pointer(c_sort(X4,shift(X5,X3)),X6) = $sum(sub_pointer(X5,X6),X3) ) )
& ( X4 = pointer(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_64) ).
tff(f120,axiom,
! [X0: $int,X2: $int,X5: c_unsorted,X1: $int,X4: c_unsorted,X3: $int] :
? [X6: c_sorted] :
( ( X6 = c_sort(bitvector,X5) )
& ( ( ( X0 = X2 )
& ( X1 = X3 ) )
=> ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X4),X0,X1,X6)),X2,X3)) = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_120) ).
tff(f121,axiom,
! [X4: c_unsorted,X5: c_unsorted,X3: $int,X0: $int,X2: $int,X1: $int] :
? [X6: c_sorted] :
( ( X6 = c_sort(bitvector,X4) )
& ( ( $lesseq($sum(X2,X3),X0)
| $lesseq($sum(X0,X3),X2) )
=> ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X0,X1,c_sort(bitvector,X5))),X2,X3)) = c_sort(bitvector,extract_bytes(X6,X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_121) ).
tff(f137,axiom,
! [X0: c_unsorted] :
? [X1: c_type] :
( ( X1 = pointer(char_P) )
& ? [X2: c_sorted] :
( ( c_sort(X1,char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(X2)))) = X2 )
& ( X2 = c_sort(X1,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_137) ).
tff(f184,plain,
! [X4: c_unsorted,X5: c_unsorted,X3: $int,X0: $int,X2: $int,X1: $int] :
? [X6: c_sorted] :
( ( X6 = c_sort(bitvector,X4) )
& ( ( ~ $less(X0,$sum(X2,X3))
| ~ $less(X2,$sum(X0,X3)) )
=> ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X0,X1,c_sort(bitvector,X5))),X2,X3)) = c_sort(bitvector,extract_bytes(X6,X2,X3)) ) ) ),
inference(theory_normalization,[],[f121]) ).
tff(f202,plain,
! [X0: c_type,X1: c_unsorted] : ~ $less(address(c_sort(pointer(X0),X1)),0),
inference(theory_normalization,[],[f47]) ).
tff(f336,plain,
! [X1: c_type,X3: c_unsorted,X2: c_unsorted,X0: $int] :
? [X4: c_type] :
( ( pointer(X1) = X4 )
& ? [X6: c_sorted,X5: c_sorted] :
( ( $sum(sub_pointer(X6,X5),X0) = sub_pointer(c_sort(X4,shift(X6,X0)),X5) )
& ( c_sort(X4,X3) = X6 )
& ( c_sort(X4,X2) = X5 ) ) ),
inference(rectify,[],[f64]) ).
tff(f337,plain,
! [X0: c_unsorted,X1: c_type] :
? [X2: c_sorted] :
( ( sub_pointer(X2,X2) = 0 )
& ( c_sort(pointer(X1),X0) = X2 ) ),
inference(rectify,[],[f62]) ).
tff(f338,plain,
! [X3: c_type,X0: c_unsorted,X2: $int,X1: $int] :
? [X4: c_type] :
( ? [X5: c_sorted] :
( ( $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X1))))
<=> $less(X2,X1) )
& ( c_sort(X4,X0) = X5 ) )
& ( pointer(X3) = X4 ) ),
inference(rectify,[],[f48]) ).
tff(f347,plain,
! [X1: $int,X2: c_unsorted,X0: $int,X3: $int,X4: c_unsorted,X5: $int] :
? [X6: c_sorted] :
( ( ( ( X3 = X5 )
& ( X0 = X1 ) )
=> ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X4),X0,X3,X6)),X1,X5)) = X6 ) )
& ( c_sort(bitvector,X2) = X6 ) ),
inference(rectify,[],[f120]) ).
tff(f348,plain,
! [X1: c_unsorted,X3: $int,X0: c_unsorted,X2: $int,X5: $int,X4: $int] :
? [X6: c_sorted] :
( ( c_sort(bitvector,X0) = X6 )
& ( ( ~ $less(X4,$sum(X3,X2))
| ~ $less(X3,$sum(X4,X2)) )
=> ( c_sort(bitvector,extract_bytes(X6,X4,X2)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X3,X5,c_sort(bitvector,X1))),X4,X2)) ) ) ),
inference(rectify,[],[f184]) ).
tff(f363,plain,
! [X1: $int,X2: c_unsorted,X0: $int,X3: $int,X4: c_unsorted,X5: $int] :
? [X6: c_sorted] :
( ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X4),X0,X3,X6)),X1,X5)) = X6 )
| ( X3 != X5 )
| ( X0 != X1 ) )
& ( c_sort(bitvector,X2) = X6 ) ),
inference(ennf_transformation,[],[f347]) ).
tff(f364,plain,
! [X5: $int,X4: c_unsorted,X2: c_unsorted,X3: $int,X0: $int,X1: $int] :
? [X6: c_sorted] :
( ( c_sort(bitvector,X2) = X6 )
& ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X4),X0,X3,X6)),X1,X5)) = X6 )
| ( X3 != X5 )
| ( X0 != X1 ) ) ),
inference(flattening,[],[f363]) ).
tff(f400,plain,
! [X5: $int,X0: c_unsorted,X4: $int,X1: c_unsorted,X3: $int,X2: $int] :
? [X6: c_sorted] :
( ( c_sort(bitvector,X0) = X6 )
& ( ( c_sort(bitvector,extract_bytes(X6,X4,X2)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X3,X5,c_sort(bitvector,X1))),X4,X2)) )
| ( $less(X3,$sum(X4,X2))
& $less(X4,$sum(X3,X2)) ) ) ),
inference(ennf_transformation,[],[f348]) ).
tff(f541,plain,
! [X3: c_type,X0: c_unsorted,X2: $int,X1: $int] :
? [X4: c_type] :
( ? [X5: c_sorted] :
( ( $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X1))))
| ~ $less(X2,X1) )
& ( $less(X2,X1)
| ~ $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X1)))) )
& ( c_sort(X4,X0) = X5 ) )
& ( pointer(X3) = X4 ) ),
inference(nnf_transformation,[],[f338]) ).
tff(f542,plain,
! [X3: c_type,X0: c_unsorted,X2: $int,X1: $int] :
? [X4: c_type] :
( ? [X5: c_sorted] :
( ( $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X1))))
| ~ $less(X2,X1) )
& ( $less(X2,X1)
| ~ $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X1)))) )
& ( c_sort(X4,X0) = X5 ) )
& ( pointer(X3) = X4 ) ),
inference(flattening,[],[f541]) ).
tff(f543,plain,
! [X0: c_type,X1: c_unsorted,X2: $int,X3: $int] :
? [X4: c_type] :
( ? [X5: c_sorted] :
( ( $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X3))))
| ~ $less(X2,X3) )
& ( $less(X2,X3)
| ~ $less(address(c_sort(X4,shift(X5,X2))),address(c_sort(X4,shift(X5,X3)))) )
& ( c_sort(X4,X1) = X5 ) )
& ( pointer(X0) = X4 ) ),
inference(rectify,[],[f542]) ).
tff(f544,plain,
! [X0: c_type,X1: c_unsorted,X2: $int,X3: $int] :
( ( $less(address(c_sort(sK134(X0,X1,X2,X3),shift(sK135(X0,X1,X2,X3),X2))),address(c_sort(sK134(X0,X1,X2,X3),shift(sK135(X0,X1,X2,X3),X3))))
| ~ $less(X2,X3) )
& ( $less(X2,X3)
| ~ $less(address(c_sort(sK134(X0,X1,X2,X3),shift(sK135(X0,X1,X2,X3),X2))),address(c_sort(sK134(X0,X1,X2,X3),shift(sK135(X0,X1,X2,X3),X3)))) )
& ( c_sort(sK134(X0,X1,X2,X3),X1) = sK135(X0,X1,X2,X3) )
& ( pointer(X0) = sK134(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK134,sK135]),skolemize(X4,sK134(X0,X1,X2,X3)),skolemize(X5,sK135(X0,X1,X2,X3))],[f543]) ).
tff(f581,plain,
! [X0: $int,X1: c_unsorted,X2: $int,X3: c_unsorted,X4: $int,X5: $int] :
? [X6: c_sorted] :
( ( c_sort(bitvector,X1) = X6 )
& ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(X6,X4,X0,c_sort(bitvector,X3))),X2,X5)) = c_sort(bitvector,extract_bytes(X6,X2,X5)) )
| ( $less(X4,$sum(X2,X5))
& $less(X2,$sum(X4,X5)) ) ) ),
inference(rectify,[],[f400]) ).
tff(f582,plain,
! [X0: $int,X1: c_unsorted,X2: $int,X3: c_unsorted,X4: $int,X5: $int] :
( ( sK164(X0,X1,X2,X3,X4,X5) = c_sort(bitvector,X1) )
& ( ( c_sort(bitvector,extract_bytes(sK164(X0,X1,X2,X3,X4,X5),X2,X5)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(sK164(X0,X1,X2,X3,X4,X5),X4,X0,c_sort(bitvector,X3))),X2,X5)) )
| ( $less(X4,$sum(X2,X5))
& $less(X2,$sum(X4,X5)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK164]),skolemize(X6,sK164(X0,X1,X2,X3,X4,X5))],[f581]) ).
tff(f624,plain,
! [X0: $int,X1: c_unsorted,X2: c_unsorted,X3: $int,X4: $int,X5: $int] :
? [X6: c_sorted] :
( ( c_sort(bitvector,X2) = X6 )
& ( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X4,X3,X6)),X5,X0)) = X6 )
| ( X0 != X3 )
| ( X4 != X5 ) ) ),
inference(rectify,[],[f364]) ).
tff(f625,plain,
! [X0: $int,X1: c_unsorted,X2: c_unsorted,X3: $int,X4: $int,X5: $int] :
( ( sK210(X0,X1,X2,X3,X4,X5) = c_sort(bitvector,X2) )
& ( ( sK210(X0,X1,X2,X3,X4,X5) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X4,X3,sK210(X0,X1,X2,X3,X4,X5))),X5,X0)) )
| ( X0 != X3 )
| ( X4 != X5 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK210]),skolemize(X6,sK210(X0,X1,X2,X3,X4,X5))],[f624]) ).
tff(f641,plain,
! [X0: c_unsorted] :
( ( pointer(char_P) = sK225(X0) )
& ( sK226(X0) = c_sort(sK225(X0),char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(sK226(X0))))) )
& ( sK226(X0) = c_sort(sK225(X0),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK225,sK226]),skolemize(X1,sK225(X0)),skolemize(X2,sK226(X0))],[f137]) ).
tff(f645,plain,
! [X0: c_unsorted,X1: c_type] :
( ( 0 = sub_pointer(sK229(X0,X1),sK229(X0,X1)) )
& ( c_sort(pointer(X1),X0) = sK229(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK229]),skolemize(X2,sK229(X0,X1))],[f337]) ).
tff(f697,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted,X3: $int] :
? [X4: c_type] :
( ( pointer(X0) = X4 )
& ? [X5: c_sorted,X6: c_sorted] :
( ( sub_pointer(c_sort(X4,shift(X5,X3)),X6) = $sum(sub_pointer(X5,X6),X3) )
& ( c_sort(X4,X1) = X5 )
& ( c_sort(X4,X2) = X6 ) ) ),
inference(rectify,[],[f336]) ).
tff(f698,plain,
! [X0: c_type,X1: c_unsorted,X2: c_unsorted,X3: $int] :
( ( pointer(X0) = sK270(X0,X1,X2,X3) )
& ( sub_pointer(c_sort(sK270(X0,X1,X2,X3),shift(sK271(X0,X1,X2,X3),X3)),sK272(X0,X1,X2,X3)) = $sum(sub_pointer(sK271(X0,X1,X2,X3),sK272(X0,X1,X2,X3)),X3) )
& ( c_sort(sK270(X0,X1,X2,X3),X1) = sK271(X0,X1,X2,X3) )
& ( c_sort(sK270(X0,X1,X2,X3),X2) = sK272(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK270,sK271,sK272]),skolemize(X4,sK270(X0,X1,X2,X3)),skolemize(X5,sK271(X0,X1,X2,X3)),skolemize(X6,sK272(X0,X1,X2,X3))],[f697]) ).
tff(f729,plain,
! [X0: c_type,X1: c_unsorted] : ~ $less(address(c_sort(pointer(X0),X1)),0),
inference(cnf_transformation,[],[f202]) ).
tff(f943,plain,
! [X2: $int,X3: $int,X0: c_type,X1: c_unsorted] : ( pointer(X0) = sK134(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f544]) ).
tff(f944,plain,
! [X2: $int,X3: $int,X0: c_type,X1: c_unsorted] : ( c_sort(sK134(X0,X1,X2,X3),X1) = sK135(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f544]) ).
tff(f946,plain,
! [X2: $int,X3: $int,X0: c_type,X1: c_unsorted] :
( $less(address(c_sort(sK134(X0,X1,X2,X3),shift(sK135(X0,X1,X2,X3),X2))),address(c_sort(sK134(X0,X1,X2,X3),shift(sK135(X0,X1,X2,X3),X3))))
| ~ $less(X2,X3) ),
inference(cnf_transformation,[],[f544]) ).
tff(f1008,plain,
! [X2: $int,X3: c_unsorted,X0: $int,X1: c_unsorted,X4: $int,X5: $int] :
( ( c_sort(bitvector,extract_bytes(sK164(X0,X1,X2,X3,X4,X5),X2,X5)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(sK164(X0,X1,X2,X3,X4,X5),X4,X0,c_sort(bitvector,X3))),X2,X5)) )
| $less(X4,$sum(X2,X5)) ),
inference(cnf_transformation,[],[f582]) ).
tff(f1009,plain,
! [X2: $int,X3: c_unsorted,X0: $int,X1: c_unsorted,X4: $int,X5: $int] : ( sK164(X0,X1,X2,X3,X4,X5) = c_sort(bitvector,X1) ),
inference(cnf_transformation,[],[f582]) ).
tff(f1081,plain,
! [X2: c_unsorted,X3: $int,X0: $int,X1: c_unsorted,X4: $int,X5: $int] :
( ( sK210(X0,X1,X2,X3,X4,X5) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X4,X3,sK210(X0,X1,X2,X3,X4,X5))),X5,X0)) )
| ( X0 != X3 )
| ( X4 != X5 ) ),
inference(cnf_transformation,[],[f625]) ).
tff(f1082,plain,
! [X2: c_unsorted,X3: $int,X0: $int,X1: c_unsorted,X4: $int,X5: $int] : ( sK210(X0,X1,X2,X3,X4,X5) = c_sort(bitvector,X2) ),
inference(cnf_transformation,[],[f625]) ).
tff(f1114,plain,
! [X0: c_unsorted] : ( sK226(X0) = c_sort(sK225(X0),X0) ),
inference(cnf_transformation,[],[f641]) ).
tff(f1115,plain,
! [X0: c_unsorted] : ( sK226(X0) = c_sort(sK225(X0),char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(sK226(X0))))) ),
inference(cnf_transformation,[],[f641]) ).
tff(f1116,plain,
! [X0: c_unsorted] : ( pointer(char_P) = sK225(X0) ),
inference(cnf_transformation,[],[f641]) ).
tff(f1124,plain,
! [X0: c_unsorted,X1: c_type] : ( c_sort(pointer(X1),X0) = sK229(X0,X1) ),
inference(cnf_transformation,[],[f645]) ).
tff(f1125,plain,
! [X0: c_unsorted,X1: c_type] : ( 0 = sub_pointer(sK229(X0,X1),sK229(X0,X1)) ),
inference(cnf_transformation,[],[f645]) ).
tff(f1202,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( c_sort(sK270(X0,X1,X2,X3),X2) = sK272(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f698]) ).
tff(f1203,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( c_sort(sK270(X0,X1,X2,X3),X1) = sK271(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f698]) ).
tff(f1204,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( sub_pointer(c_sort(sK270(X0,X1,X2,X3),shift(sK271(X0,X1,X2,X3),X3)),sK272(X0,X1,X2,X3)) = $sum(sub_pointer(sK271(X0,X1,X2,X3),sK272(X0,X1,X2,X3)),X3) ),
inference(cnf_transformation,[],[f698]) ).
tff(f1205,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( pointer(X0) = sK270(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f698]) ).
tff(f1272,plain,
! [X2: $int,X3: $int,X0: c_type,X1: c_unsorted] : ( c_sort(pointer(X0),X1) = sK135(X0,X1,X2,X3) ),
inference(definition_unfolding,[],[f944,f943]) ).
tff(f1301,plain,
! [X0: c_unsorted] : ( c_sort(pointer(char_P),X0) = sK226(X0) ),
inference(definition_unfolding,[],[f1114,f1116]) ).
tff(f1321,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( c_sort(pointer(X0),X1) = sK271(X0,X1,X2,X3) ),
inference(definition_unfolding,[],[f1203,f1205]) ).
tff(f1322,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( c_sort(pointer(X0),X2) = sK272(X0,X1,X2,X3) ),
inference(definition_unfolding,[],[f1202,f1205]) ).
tff(f1430,plain,
! [X2: $int,X3: $int,X0: c_type,X1: c_unsorted] :
( $less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X2))),address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X3))))
| ~ $less(X2,X3) ),
inference(definition_unfolding,[],[f946,f943,f1272,f943,f1272]) ).
tff(f1451,plain,
! [X2: $int,X3: c_unsorted,X0: $int,X1: c_unsorted,X4: $int,X5: $int] :
( $less(X4,$sum(X2,X5))
| ( c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),X2,X5)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X4,X0,c_sort(bitvector,X3))),X2,X5)) ) ),
inference(definition_unfolding,[],[f1008,f1009,f1009]) ).
tff(f1479,plain,
! [X2: c_unsorted,X3: $int,X0: $int,X1: c_unsorted,X4: $int,X5: $int] :
( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X4,X3,c_sort(bitvector,X2))),X5,X0)) = c_sort(bitvector,X2) )
| ( X0 != X3 )
| ( X4 != X5 ) ),
inference(definition_unfolding,[],[f1081,f1082,f1082]) ).
tff(f1487,plain,
! [X0: c_unsorted] : ( c_sort(pointer(char_P),X0) = c_sort(pointer(char_P),char_P_of_bitvector(c_sort(bitvector,bitvector_of_char_P(c_sort(pointer(char_P),X0))))) ),
inference(definition_unfolding,[],[f1115,f1301,f1116,f1301]) ).
tff(f1490,plain,
! [X0: c_unsorted,X1: c_type] : ( 0 = sub_pointer(c_sort(pointer(X1),X0),c_sort(pointer(X1),X0)) ),
inference(definition_unfolding,[],[f1125,f1124,f1124]) ).
tff(f1525,plain,
! [X2: c_unsorted,X3: $int,X0: c_type,X1: c_unsorted] : ( $sum(sub_pointer(c_sort(pointer(X0),X1),c_sort(pointer(X0),X2)),X3) = sub_pointer(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X3)),c_sort(pointer(X0),X2)) ),
inference(definition_unfolding,[],[f1204,f1205,f1321,f1322,f1321,f1322]) ).
tff(f1583,plain,
! [X2: c_unsorted,X3: $int,X1: c_unsorted,X4: $int,X5: $int] :
( ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X4,X3,c_sort(bitvector,X2))),X5,X3)) = c_sort(bitvector,X2) )
| ( X4 != X5 ) ),
inference(equality_resolution,[],[f1479]) ).
tff(f1584,plain,
! [X2: c_unsorted,X3: $int,X1: c_unsorted,X5: $int] : ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),X5,X3,c_sort(bitvector,X2))),X5,X3)) = c_sort(bitvector,X2) ),
inference(equality_resolution,[],[f1583]) ).
tff(f1751,plain,
! [X0: c_type,X1: c_unsorted] :
( $less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),-1))),address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),0))))
| ~ $less(-1,0) ),
inference(instantiation,[],[f1430]) ).
tff(f1752,plain,
! [X0: c_type,X1: c_unsorted] : $less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),-1))),address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),0)))),
inference(interpreted_simplification,[],[f1751]) ).
tff(f1800,plain,
! [X2: $int,X0: c_type,X1: c_unsorted] : ( 0 = $sum(sub_pointer(c_sort(pointer(X0),X1),c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),X2))),X2) ),
inference(superposition,[],[f1525,f1490]) ).
tff(f1821,plain,
! [X3: c_unsorted,X0: $int,X1: c_unsorted] :
( $less(0,$sum(0,0))
| ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),0,X0,c_sort(bitvector,X3))),0,0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),0,0)) ) ),
inference(instantiation,[],[f1451]) ).
tff(f1822,plain,
! [X3: c_unsorted,X0: $int,X1: c_unsorted] : ( c_sort(bitvector,extract_bytes(c_sort(bitvector,replace_bytes(c_sort(bitvector,X1),0,X0,c_sort(bitvector,X3))),0,0)) = c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),0,0)) ),
inference(interpreted_simplification,[],[f1821]) ).
tff(f1835,plain,
! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(bitvector,X0) = c_sort(bitvector,extract_bytes(c_sort(bitvector,X1),0,0)) ),
inference(superposition,[],[f1822,f1584]) ).
tff(f1857,plain,
! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(bitvector,X0) = c_sort(bitvector,X1) ),
inference(superposition,[],[f1835,f1584]) ).
tff(f1915,plain,
! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(pointer(char_P),X1) = c_sort(pointer(char_P),char_P_of_bitvector(c_sort(bitvector,X0))) ),
inference(superposition,[],[f1487,f1857]) ).
tff(f1962,plain,
! [X0: c_unsorted,X1: c_unsorted] : ( c_sort(pointer(char_P),X0) = c_sort(pointer(char_P),X1) ),
inference(superposition,[],[f1915,f1487]) ).
tff(f2058,plain,
! [X2: $int,X0: c_unsorted,X1: c_unsorted] : ( 0 = $sum(sub_pointer(c_sort(pointer(char_P),X1),c_sort(pointer(char_P),X0)),X2) ),
inference(superposition,[],[f1800,f1962]) ).
tff(f2316,plain,
! [X2: $int] : ( 0 = X2 ),
inference(arithmetic_subterm_generalization,[],[f2058]) ).
tff(f2341,plain,
! [X0: c_type,X1: c_unsorted] : $less(address(c_sort(pointer(X0),shift(c_sort(pointer(X0),X1),-1))),0),
inference(superposition,[],[f1752,f2316]) ).
tff(f2360,plain,
$false,
inference(forward_subsumption_resolution,[],[f2341,f729]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ARI755_1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.23 % Computer : n006.cluster.edu
% 0.12/0.23 % Model : x86_64 x86_64
% 0.12/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.23 % Memory : 8046.5625MB
% 0.12/0.23 % OS : Linux 6.8.0-71-generic
% 0.12/0.23 % CPULimit : 300
% 0.12/0.23 % WCLimit : 300
% 0.12/0.23 % DateTime : Mon Sep 28 21:02:10 UTC 2026
% 0.12/0.24 % CPUTime :
% 0.12/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.29 Running first-order theorem proving
% 0.27/0.29 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.31/1.35 % (195918)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 3.31/1.35 % (195987)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=1400844794:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 3.31/1.35 % (195987)Instruction limit reached!
% 3.31/1.35 % (195987)------------------------------
% 3.31/1.35 % (195987)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (195987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (195987)CaDiCaL version: 2.1.3
% 3.31/1.35 % (195987)Termination reason: Instruction limit
% 3.31/1.35 % (195987)Termination phase: Preprocessing 1
% 3.31/1.35 % (195987)Time elapsed: 0.003 s
% 3.31/1.35 % (195987)Peak memory usage: 86 MB
% 3.31/1.35 % (195987)Instructions burned: 9 (million)
% 3.31/1.35 % (195982)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=2519218251:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 3.31/1.35 % (195984)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=1630703527:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 3.31/1.35 % (195989)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=4105754824:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 3.31/1.35 % (195993)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=2977533065:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 3.31/1.35 % (195982)Instruction limit reached!
% 3.31/1.35 % (195982)------------------------------
% 3.31/1.35 % (195982)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (195982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (195982)CaDiCaL version: 2.1.3
% 3.31/1.35 % (195982)Termination reason: Instruction limit
% 3.31/1.35 % (195982)Termination phase: Property scanning
% 3.31/1.35 % (195982)Time elapsed: 0.006 s
% 3.31/1.35 % (195982)Peak memory usage: 86 MB
% 3.31/1.35 % (195982)Instructions burned: 12 (million)
% 3.31/1.35 % (195989)Instruction limit reached!
% 3.31/1.35 % (195989)------------------------------
% 3.31/1.35 % (195989)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (195989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (195989)CaDiCaL version: 2.1.3
% 3.31/1.35 % (195989)Termination reason: Instruction limit
% 3.31/1.35 % (195989)Termination phase: Property scanning
% 3.31/1.35 % (195989)Time elapsed: 0.003 s
% 3.31/1.35 % (195989)Peak memory usage: 85 MB
% 3.31/1.35 % (195989)Instructions burned: 5 (million)
% 3.31/1.35 % (195986)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=324638587:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 3.31/1.35 % (195991)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3566269641:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 3.31/1.35 % (195993)Instruction limit reached!
% 3.31/1.35 % (195993)------------------------------
% 3.31/1.35 % (195993)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (195993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (195993)CaDiCaL version: 2.1.3
% 3.31/1.35 % (195993)Termination reason: Instruction limit
% 3.31/1.35 % (195993)Termination phase: Equality resolution with deletion
% 3.31/1.35 % (195993)Time elapsed: 0.018 s
% 3.31/1.35 % (195993)Peak memory usage: 87 MB
% 3.31/1.35 % (195993)Instructions burned: 33 (million)
% 3.31/1.35 % (195991)Instruction limit reached!
% 3.31/1.35 % (195991)------------------------------
% 3.31/1.35 % (195991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (195991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (195991)CaDiCaL version: 2.1.3
% 3.31/1.35 % (195991)Termination reason: Instruction limit
% 3.31/1.35 % (195991)Termination phase: Saturation
% 3.31/1.35 % (195991)Time elapsed: 0.048 s
% 3.31/1.35 % (195991)Peak memory usage: 113 MB
% 3.31/1.35 % (195991)Instructions burned: 46 (million)
% 3.31/1.35 % (196031)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=1438058776:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 3.31/1.35 % (196031)Refutation not found, incomplete strategy
% 3.31/1.35 % (196031)------------------------------
% 3.31/1.35 % (196031)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196031)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196031)Termination reason: Refutation not found, incomplete strategy
% 3.31/1.35 % (196031)Time elapsed: 0.002 s
% 3.31/1.35 % (196031)Peak memory usage: 88 MB
% 3.31/1.35 % (196031)Instructions burned: 6 (million)
% 3.31/1.35 % (195986)First to succeed.
% 3.31/1.35 % (195986)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-195918"
% 3.31/1.35 % (196042)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=237976331:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 3.31/1.35 % (196044)ott+21_1024_to=lakbo:sil=128000:bsd=on:si=on:alasca=on:uwa=alasca_main:nwc=0.5:random_seed=2082239201:cond=on:i=16:fgj=on:ep=RS:asg=force:nm=10:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/16Mi)
% 3.31/1.35 % (196042)Instruction limit reached!
% 3.31/1.35 % (196042)------------------------------
% 3.31/1.35 % (196042)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196042)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196042)Termination reason: Instruction limit
% 3.31/1.35 % (196042)Termination phase: Property scanning
% 3.31/1.35 % (196042)Time elapsed: 0.017 s
% 3.31/1.35 % (196042)Peak memory usage: 87 MB
% 3.31/1.35 % (196042)Instructions burned: 32 (million)
% 3.31/1.35 % (196051)dis+1011_1_prc=on:drc=off:si=on:sac=on:random_seed=1953692001:i=24:canc=force:rtra=on_2998 on theBenchmark for (2998ds/24Mi)
% 3.31/1.35 % (196044)Instruction limit reached!
% 3.31/1.35 % (196044)------------------------------
% 3.31/1.35 % (196044)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196044)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196044)Termination reason: Instruction limit
% 3.31/1.35 % (196044)Termination phase: Preprocessing 3
% 3.31/1.35 % (196044)Time elapsed: 0.011 s
% 3.31/1.35 % (196044)Peak memory usage: 87 MB
% 3.31/1.35 % (196044)Instructions burned: 16 (million)
% 3.31/1.35 % (196051)Instruction limit reached!
% 3.31/1.35 % (196051)------------------------------
% 3.31/1.35 % (196051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196051)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196051)Termination reason: Instruction limit
% 3.31/1.35 % (196051)Termination phase: Property scanning
% 3.31/1.35 % (196051)Time elapsed: 0.015 s
% 3.31/1.35 % (196051)Peak memory usage: 87 MB
% 3.31/1.35 % (196051)Instructions burned: 26 (million)
% 3.31/1.35 % (196053)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=3472545845:i=27:canc=cautious:fsr=off:rtra=on_2997 on theBenchmark for (2997ds/27Mi)
% 3.31/1.35 % (196053)Instruction limit reached!
% 3.31/1.35 % (196053)------------------------------
% 3.31/1.35 % (196053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196053)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196053)Termination reason: Instruction limit
% 3.31/1.35 % (196053)Termination phase: Function definition elimination
% 3.31/1.35 % (196053)Time elapsed: 0.016 s
% 3.31/1.35 % (196053)Peak memory usage: 87 MB
% 3.31/1.35 % (196053)Instructions burned: 29 (million)
% 3.31/1.35 % (195984)Instruction limit reached!
% 3.31/1.35 % (195984)------------------------------
% 3.31/1.35 % (195984)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (195984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (195984)CaDiCaL version: 2.1.3
% 3.31/1.35 % (195984)Termination reason: Instruction limit
% 3.31/1.35 % (195984)Termination phase: Saturation
% 3.31/1.35 % (195984)Time elapsed: 0.212 s
% 3.31/1.35 % (195984)Peak memory usage: 118 MB
% 3.31/1.35 % (195984)Instructions burned: 307 (million)
% 3.31/1.35 % (196031)------------------------------
% 3.31/1.35 % (196031)------------------------------
% 3.31/1.35 % (196064)dis+1002_24_to=kbo:sil=128000:si=on:random_seed=4099180423:i=85:gtgl=4:rtra=on:gtg=exists_sym_2997 on theBenchmark for (2997ds/85Mi)
% 3.31/1.35 % (196066)ott+1002_1_si=on:sp=occurrence:spb=goal:lcm=predicate:random_seed=4290663643:i=2:bd=preordered:nm=2:ins=3:rtra=on:inst=on:tar=off_2996 on theBenchmark for (2996ds/2Mi)
% 3.31/1.35 % (196066)Instruction limit reached!
% 3.31/1.35 % (196066)------------------------------
% 3.31/1.35 % (196066)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196066)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196066)Termination reason: Instruction limit
% 3.31/1.35 % (196066)Termination phase: Property scanning
% 3.31/1.35 % (196066)Time elapsed: 0.002 s
% 3.31/1.35 % (196066)Peak memory usage: 85 MB
% 3.31/1.35 % (196066)Instructions burned: 3 (million)
% 3.31/1.35 % (196075)dis+1010_1_to=kbo:sil=128000:tgt=full:si=on:tha=off:random_seed=2385427676:i=181:rtra=on:ss=axioms:ev=cautious_2996 on theBenchmark for (2996ds/181Mi)
% 3.31/1.35 % (196075)Refutation not found, incomplete strategy
% 3.31/1.35 % (196075)------------------------------
% 3.31/1.35 % (196075)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196075)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196075)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196075)Termination reason: Refutation not found, incomplete strategy
% 3.31/1.35 % (196075)Time elapsed: 0.004 s
% 3.31/1.35 % (196075)Peak memory usage: 88 MB
% 3.31/1.35 % (196075)Instructions burned: 5 (million)
% 3.31/1.35 % (196107)lrs+10_1_thi=all:si=on:fd=off:random_seed=1152477386:i=53:rtra=on:gtg=all_2996 on theBenchmark for (2996ds/53Mi)
% 3.31/1.35 % (196064)Instruction limit reached!
% 3.31/1.35 % (196064)------------------------------
% 3.31/1.35 % (196064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196064)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196064)Termination reason: Instruction limit
% 3.31/1.35 % (196064)Termination phase: Saturation
% 3.31/1.35 % (196064)Time elapsed: 0.047 s
% 3.31/1.35 % (196064)Peak memory usage: 90 MB
% 3.31/1.35 % (196064)Instructions burned: 85 (million)
% 3.31/1.35 % (196107)Instruction limit reached!
% 3.31/1.35 % (196107)------------------------------
% 3.31/1.35 % (196107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196107)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196107)Termination reason: Instruction limit
% 3.31/1.35 % (196107)Termination phase: Saturation
% 3.31/1.35 % (196107)Time elapsed: 0.027 s
% 3.31/1.35 % (196107)Peak memory usage: 113 MB
% 3.31/1.35 % (196107)Instructions burned: 53 (million)
% 3.31/1.35 % (196103)lrs+10_2_to=lpo:sil=64000:si=on:sos=on:gve=force:lcm=reverse:uwa=one_side_interpreted:random_seed=2831308293:i=4:ep=RST:ins=2:rtra=on_2996 on theBenchmark for (2996ds/4Mi)
% 3.31/1.35 % (196103)Instruction limit reached!
% 3.31/1.35 % (196103)------------------------------
% 3.31/1.35 % (196103)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.35 % (196103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.35 % (196103)CaDiCaL version: 2.1.3
% 3.31/1.35 % (196103)Termination reason: Instruction limit
% 3.31/1.35 % (196103)Termination phase: Property scanning
% 3.31/1.35 % (196103)Time elapsed: 0.003 s
% 3.31/1.35 % (196103)Peak memory usage: 86 MB
% 3.31/1.35 % (196103)Instructions burned: 5 (million)
% 3.31/1.35 % (196105)dis+1010_128_isp=bottom:to=lpo:thi=overlap:prc=on:sas=z3:si=on:fd=preordered:random_seed=3993441503:i=66:thsqd=64:thsqc=16:rtra=on:thsq=on:ev=force_2996 on theBenchmark for (2996ds/66Mi)
% 3.31/1.35 % (195986)Refutation found. Thanks to Tanya!
% 3.31/1.35 % SZS status Unsatisfiable for theBenchmark
% 3.31/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 4.39/1.54 % (195986)------------------------------
% 4.39/1.54 % (195986)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.39/1.54 % (195986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.39/1.54 % (195986)CaDiCaL version: 2.1.3
% 4.39/1.54 % (195986)Termination reason: Refutation
% 4.39/1.54 % (195986)Time elapsed: 0.094 s
% 4.39/1.54 % (195986)Peak memory usage: 119 MB
% 4.39/1.54 % (195986)Instructions burned: 116 (million)
% 4.39/1.54 % (195986)------------------------------
% 4.39/1.54 % (195986)------------------------------
% 4.39/1.54 % (195918)Success in time 0.508 s
% 4.39/1.54 % Vampire exiting
%------------------------------------------------------------------------------