The problem with Horner’s scheme is that it creates a long chain of data dependencies, instead of making full use of all execution units. Usually you’d want more of a binary tree than a chain.
Still, it's no worse than the naïve formula, which has exactly the same data dependencies and then more.
_Can_ you even make a reasonable high-ILP scheme for a polynomial, unless it's of extremely high degree?
Not in this case because the dependencies are the same:
Naive: https://godbolt.org/z/Gzf1KM9Tc
Horner's: https://godbolt.org/z/jhvGqcxj1