I was asked to prove that the next language is recursive enumerable :
$$L= \{ \langle G \rangle \mid SAT<L(G) \} $$
where $G$ is a context free grammar and there is a polynomial reduction from the SAT problem to the language that's accepted by $G$.
I can't seem to understand why this problem is in RE. Isn't determining whether a word is accepted by a certain CFG done in a polynomial time? What am I missing here?