The standard halting problem proof doesn’t specify what the halting oracle is. It just shows how to construct a counter example for any halting oracle. I actually specified a halting oracle; a program which searches through all possible proofs until it finds a proof that it halts or not.
Then running it on the counterexample causes it to run forever. Therefore I’ve proved that it will run forever. The program will eventually find that proof, return false, and halt.
{All possible proofs} has infinitely many elements longer than zero, so your algorithm will (might) run forever on some programs that do halt, so it is not a halting oracle.
The standard halting problem proof doesn’t specify what the halting oracle is. It just shows how to construct a counter example for any halting oracle. I actually specified a halting oracle; a program which searches through all possible proofs until it finds a proof that it halts or not.
Then running it on the counterexample causes it to run forever. Therefore I’ve proved that it will run forever. The program will eventually find that proof, return false, and halt.
{All possible proofs} has infinitely many elements longer than zero, so your algorithm will (might) run forever on some programs that do halt, so it is not a halting oracle.
If a program halts, it’s easy to prove that it halts. Just run it until it halts. The problem is proving that some programs won’t halt.