Reduce $\overline{K}$ to the set of pairs of natural numbers codifying programs such that the domains of the functions implemented by them share exactly two elements (roughly, the set of pairs of programs implementing functions whose domains share exactly two elements), in order to prove that such set is not semi-decidable (not recursively enumerable).