Leonardo de Moura befee896b3 feat: linear integer inequality normalization using gcd of coefficients (#7030) ... This PR adds completes the linear integer inequality normalizer for `grind`. The missing normalization step replaces a linear inequality of the form `a_1*x_1 + ... + a_n*x_n + b <= 0` with `a_1/k * x_1 + ... + a_n/k * x_n + ceil(b/k) <= 0` where `k = gcd(a_1, ..., a_n)`. `ceil(b/k)` is implemented using the helper `cdiv b k`.		2025-02-11 03:45:25 +00:00
..
bench
compiler	feat: Simp.Config.implicitDefEqProofs (#4595)	2024-11-29 22:29:27 +00:00
elabissues
ir
lean	feat: linear integer inequality normalization using gcd of coefficients (#7030)	2025-02-11 03:45:25 +00:00
pkg
playground
plugin
simpperf
.gitignore
common.sh
lean-toolchain