Reduce the universality problem on CFGs over $\{a,b\}$ to the problem of whether a CFG generates the words over $\{a,b\}$ with as many occurrences of $a$ as occurrences of $b$, in order to prove that such problem is not semi-decidable (not recursively enumerable).