https://gcc.gnu.org/bugzilla/show_bug.cgi?id=95433
--- Comment #5 from Marc Glisse <glisse at gcc dot gnu.org> --- Patch posted at https://gcc.gnu.org/pipermail/gcc-patches/2020-August/551154.html for the original testcase. Note that solving univariate polynomial equations *in the integers* (the rationals are not much harder) is actually rather simple, just enumerate the divisors of the constant term and evaluate the polynomial on each of them to check which ones are roots. If someone wants to implement that...
