Reduce $\overline{K}$ to the set of natural numbers such that the program codified by them halt with input $1$ and do not halt with input $2$ (roughly, the set of programs that halt with input $1$ and do not halt with input $2$), in order to prove that such set is not semi-decidable (not recursively enumerable).