perf: use recursor-based normalization in `lia` certificates

This PR makes the kernel check `lia` certificates faster. Certificates that normalize linear expressions now use variants of `Expr.toPoly'`, `Poly.insert`, and `Poly.norm` written with recursors and `Int.beq'`, which the kernel evaluates 2-3x faster than the versions defined by structural recursion.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
1 file changed