  We prove that every Condorcet-consistent voting rule can be manipulated by a
voter who completely reverses their preference ranking, assuming that there are
at least 4 alternatives. This corrects an error and improves a result of
[Sanver, M. R. and Zwicker, W. S. (2009). One-way monotonicity as a form of
strategy-proofness. Int J Game Theory 38(4), 553-574.] For the case of
precisely 4 alternatives, we exactly characterise the number of voters for
which this impossibility result can be proven. We also show analogues of our
result for irresolute voting rules. We then leverage our result to state a
strong form of the Gibbard-Satterthwaite Theorem.
