There are some machines in the busy-beaver-competition for turing machines with $5$ states and $2$ symbols for which it is not known whether they halt or not.
Is it possible that among those machines, there is a halting machine beating the current record with respect to the number of steps, but not being a busy beaver beacuse it doesn't write down more ones than the currect record ? Or do we know that such a halting machine would also be a new record holder with respect to the number of ones ?
I tend to believe that we cannot rule out this possibility. In fact, I am not sure whether we can even rule out any final output (except trivial ones like an empty tape, if the machine contains $1RH$ forcing at least one $1$ on the tape).
I don't know the exact machines in the competition, but in general the answer could be "we have a machine which isn't known to halt or diverge, which we've been running for years but has written down fewer 1's so far than the best-known busy-beaver candidate". In that case, exactly one of the following is true, but we don't know which: