Contradiction between best-case running time of insertion sort and $n\log n$ lower bound?
The lower bound of $\Omega(n \log(n))$ is a lower bound for the worst-case behavior of a sorting method. Both insertion sort and bubble sort have $O(n^2)$ worst-case complexity.