to the set of pairs of natural numbers codifying programs
such that the domains of the functions implemented by them are infinite and
share no element (roughly, the set of pairs of programs implementing functions
whose domains are infinite and share no element), in order to prove that such
set is not semi-decidable (not recursively enumerable).