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 it's worth saying, but not worth its own post (even in Discussion), then it goes here.
Notes for future OT posters:
1. Please add the 'open_thread' tag.
2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)
3. Open Threads should be posted in Discussion, and not Main.
4. Open Threads should start on Monday, and end on Sunday.