Example of $MSO_2$ definable NP-hard problem on bounded clique-width graphs All $MSO_1$ and $MSO_2$ definable graph problems can be solved in linear time on bounded tree-width graphs by Courcelle's theorem. But it seems this theorem doesn't work for $MSO_2$ definable graph problems on bounded clique-width graphs. 

Can some provide me an 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$.