faster preprocessing: before applying a step, test if it is applicable (normalization of binders, unfolding of abs/min/max definitions, lambda lifting, explicit application, monomorphization),
custom-made (top-down) atomize_conv,
store predicate and function symbols in a table instead of a list for faster lookup,
updated certificates
(benchmark Isabelle
:extrafuns (
(uf_1 BitVec[4])
)
:assumption (= uf_1 bv5[4])
:assumption (not (= (bvmul bv4[4] uf_1) bv4[4]))
:formula true
)