grind/grobner doesn't finish a proof for a medium-sized problem within reasonable limit

Prerequisites

• Check that your issue is not already filed:
  https://github.com/leanprover/lean4/issues
• Reduce the issue to a minimal, self-contained, reproducible test case.
  Avoid dependencies to Mathlib or Batteries.
• Test your test case against the latest nightly release, for example on
  https://live.lean-lang.org/#project=lean-nightly
  (You can also use the settings there to switch to “Lean nightly”)

Description

grind / grobner doesn't complete a proof for the following theorem (This was taken from a real-world but brute-force problem)

• lean code

I tried bumping up hearbeat limits and ring steps, but eventually it got stuck, or on my pc the OOM handler killed it after a few minutes.

Meanwhile, the equivalent computation finishes instantly in sage

• sage code

Context

I was suggested on Discord to open an issue here

Steps to Reproduce

1. Run the lean code above

Expected behavior: grind / grobner can finish the proof within reasonable time and resource limit.

Actual behavior: It times out or runs out of memory

Versions

4.27.0-rc1
OS: Ubuntu 24.04.3
RAM: 16 GiB

Impact

Add 👍 to issues you consider important. If others are impacted by this issue, please ask them to add 👍 to it.

Start by running the linked Lean code against Lean 4.27.0-rc1 and compare the grind/grobner behavior with the linked Sage computation. No source file or test is named; done means the minimal proof completes within a reasonable time and memory limit without relying on increased heartbeat or ring-step limits.