Yes I am not aware of any proof on that one. Do you think it will suffice to generalize the statement to just "NP problem" instead?
(You can't just try all possible programs, because some of them never terminate and some others run for a very long time and you can't tell in advance which are which.)