Reduce the universality problem on CFGs over $\{a,b\}$ to the inclusion problem between the complement of the language of a CFG and the complement of the language of another CFG, in order to prove that such problem is not semi-decidable (not recursively enumerable).