Path-prefix inference: treat ties as ambiguous only when the rules disagree on the result

When inferring a prefix mapping between two hierarchies (for example a waveform dump and an RTL design) by scoring candidate roots on how many children they share, a rule like "a tie at the best score means ambiguous, return nothing" also rejects ties between rules that agree. Root r mapped to dump d and r's own child r.c mapped to d.c send the same path to the same place, yet they count as two rules. Scores are small integers (for example 2 per shared scope, 1 per signal), so a parent and one of its children tie often, and inference that used to work starts returning nothing. Fix: apply each tied rule to the path you are resolving, merge the rules that give the same result (keep the broadest), and treat it as ambiguous only if different results remain. Copies of one module (u_core0 and u_core1 with identical children) still come out ambiguous, which is the case the tie rule was meant to catch.