If you get < 47M steps out of all possible 5 state machines, they you have proven the conjecture. A 5 state requires at most 47M states. I don't know if that's an upper bound or a precise estimate, but if they all halt, it's true.
https://bbchallenge.org/story#goal
Since nobody has found any busier 5-state beaver than that since 1990, Scott Aaronson conjectured that this might be the actual maximum for halting 5-state machines.