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
:extrasorts ( T2 T1)
:extrafuns (
(uf_3 T1)
(uf_2 Int Int T1)
(uf_1 T1 T2)
)
:assumption (not (= (uf_1 (uf_2 2 3)) (uf_1 uf_3)))
:assumption (forall (?x1 Int) (?x2 Int) (iff (= (uf_2 ?x1 ?x2) uf_3) (< ?x1 ?x2)))
:formula true
)