This PR implements several modifications for the cutsat procedure in `grind`. - The maximal variable is now at the beginning of linear polynomials. - The old `LinearArith.Solver` was deleted, and the normalizer was moved to `Simp`. - cutsat first files were created, and basic infrastructure for representing divisibility constraints was added. |
||
|---|---|---|
| .. | ||
| Int | ||
| Nat | ||
| Int.lean | ||
| Nat.lean | ||
| Util.lean | ||