[Bug tree-optimization/95433] Failure to completely optimize simple compare after operations

[rguenth at gcc dot gnu.org]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=95433

--- Comment #2 from Richard Biener <rguenth at gcc dot gnu.org> ---
Hmm, are we supposed to solve/simplify arbitrary linear equations?

3 * x * x * x + 5 == 8

is equal to x == 1.

3 * x * x + 5 == 8

is equal to abs(x) == 1.

But sure, simple cases.  I wonder if something more "general" can be done
by reassoc rather than dealing with this in pattern matching.