right, it's a typo, it doesn't matter, and there was already a reply 4 hours before yours that said as much, so i'm not sure what you were aiming to contribute with the reply that doesn't acknowledge that it is a typo
"all the people complaining" = up to 1 person
"This conjecture says that 47,176,870 is the maximum number of steps that a 5-state Turing machine can run before halting (starting from all-0 memory tape)."
So, we can run up to this number and either the machine will stop - and we'll go to the next one until exhaust the whole set - or the machine won't stop, and we'll refute the conjecture.
No, you do not refute the conjecture if you run up to this number and a machine does not stop. Finding a machine that runs for more than 47,176,870 steps is easy - there are plenty of machines that run forever. The trick is that it needs to stop.