It single-shots the towers of Hanoi https://chatgpt.com/share/6848fff7-0080-8013-a032-e18c999dc3...
In move 95 the disks are
Tower 1: 10, 9, 8, 5, 4, 3, 2, 1
Tower 2: 7
Tower 3: 6
It attempts to move disk 6 from tower 2 to tower 3, but disk 6 is already at tower 3, and moving 7 on top of 6 would be illegal.
In fact this demonstrates that o3 is unable to implement a simple recursive algorithm.
Is your reasoning always perfect? No? Ever get partial credit on a test question in school? Yes? Well, maybe don't expect perfection from a model that didn't exist 5 years ago, that was considered impossible 10 years ago, and that would have gotten you burned as a witch 15 years ago.
Nobody claims that o3-pro is AGI, or even that it is going to lead up to AGI.