A little more: I realized its's a "limit case" that couldn't be compared with transferable vote because it's not possible to transfer, so I considers the case of 2 votes and the behavior as the limit is approached.
Even with 2 votes, transferable votes are still better than non/transferable, and non-transferable is still less gerrymander-resistant than single winner plurality.
Now behavior as it approaches - 2 transferable votes is worse than 4 is worse than 8.... It gets worse monotonically.
So that's about what those 5 seconds consisted of.
Now to read what you wrote...
Second part - when I used an extreme case, I did not mean to imply that all cases were extreme, only to elucidate a pathology.
Second part: an exception, even multiple exceptions, do not disprove a rule.
I can run it in my free time on SNTV an share the results, but before doing so I must caution:
The results of a simulation are inexorably biased to the scenarios that one simulates.
In matters like this, logic always trumps evidence.
That may sound backwards. But it is how science works. Th evidence is used to INFORM the reasoning. If it contradicts a deduction, that deduction is wrong. Yes. But a deduction that is not contradicted by any evidence, and reasoned soundly from valid premises, is still, at least tentatively, correct.
This is programming. This is algorithms. One does not verify an algorithm by testing a small subset of possible inputs. One verified an algorithm by confirming that the business rules are correct, and that the logic of the algorithm exactly matches the business rules.
In our case, we have 1 business rule: count each ballot exactly once.
That rule is violated.
I don't think you're making an honest effort to understand, so I'm not going to waste my time anymore.
It's like you feel that you can contradict what I said by saying THE EXACT SAME THING THAT I SAID!