fix: `grind ring` approximation
This PR fixes an issue in the `grind` ring solver. When a ring `R` does not satisfy `[NoNatZeroDivisors R]`, polynomial simplification could lose information, affecting completeness.
This PR may increase memory consumption for examples that relied on this approximation. If this becomes a performance issue in practice, we can add a flag to control whether the approximation is used.
Here is the example that exposed the issue:
```lean
open Lean.Grind
example {R : Type u} [CommRing R] (A B : R) (Hâ‚€ : B ^ 2 = 0) (H : A * B = -2) :
B + A * B = B - 2 := by
grind
```
This is the repository for Lean 4.
See Install Lean.
Please read our Contribution Guidelines first.
See Building Lean.