A lemma used to make the fork proof slightly quicker: If A
deterministically and silently reduces to both B and C, then either B
deterministically, silently reduces to C or vice versa, corresponding to
the deterministic orders (ABC and ACB).