Feature request. Please add the F4 and F5 algorithms in order to compute the Grőbner base in order to simplify the solving of polynomial equation systems.

[ytrezq]

If the problem to solve is a system of polynomial equation, the best way to simplify it in order to solve it is to compute the Grőbner base after all simplification passes ended.

While this doesn t works most of the time (compared to when the Grőbner bases are found using manual work), the best and fastest way to do it to use the F4 or F5 algorithms. See https://en.wikipedia.org/wiki/Faug%C3%A8re%27s_F4_and_F5_algorithms
If done using GMP library, this should allow to solve systems where a solution would not be computable otherwise.

Such approaches are already implemented in less powerful and less interroperable systems such as SageMath.