Example of $MSO_2$ definable NP-hard problem on bounded clique-width graphs
One example is the vertex disjoint paths problem, which is linear time solvable in graphs of bounded tree width but NPC in graphs of clique width at most $6$.