Gröbner bases over ℚ via msolve

src/sage/rings/polynomial/msolve.py

@@ -64,7 +64,7 @@ def _run_msolve(ideal, options):
 
     return msolve_out.stdout
 
-def groebner_basis_degrevlex(ideal):
+def groebner_basis_degrevlex(ideal, proof=True):
     r"""
     Compute a degrevlex Gröbner basis using msolve
 
@@ -97,13 +97,13 @@ def groebner_basis_degrevlex(ideal):
         sage: I.groebner_basis(algorithm='msolve') # optional - msolve
         Traceback (most recent call last):
         ...
-        NotImplementedError: unsupported base field: Rational Field
+        ValueError: msolve relies on heuristics; please use proof=False
+        sage: I.groebner_basis(algorithm='msolve', proof=False) # optional - msolve
+        [x*y - 1, x^2 + y^2 - 4*x - 2*y + 4, y^3 - 2*y^2 + x + 4*y - 4]
     """
 
-    base = ideal.base_ring()
-    if not (isinstance(base, FiniteField) and base.is_prime_field() and
-            base.characteristic() < 2**31):
-        raise NotImplementedError(f"unsupported base field: {base}")
+    if ideal.base_ring() is QQ and sage.structure.proof.proof.get_flag(proof, "polynomial"):
+            raise ValueError("msolve relies on heuristics; please use proof=False")
 
     drlpolring = ideal.ring().change_ring(order='degrevlex')
     msolve_out = _run_msolve(ideal, ["-g", "2"])

src/sage/rings/polynomial/multi_polynomial_ideal.py

@@ -4269,8 +4269,7 @@ def groebner_basis(self, algorithm='', deg_bound=None, mult_bound=None, prot=Fal
             Macaulay2's ``GroebnerBasis`` command with the strategy "MGB" (if available)
 
         ``'msolve'``
-            `optional package msolve <../spkg/msolve.html>`_ (degrevlex order,
-            prime fields)
+            `optional package msolve <../spkg/msolve.html>`_ (degrevlex order)
 
         ``'magma:GroebnerBasis'``
             Magma's ``Groebnerbasis`` command (if available)