On solutions of systems consisting both of word equationa and of word length inequalities

It is proved that systems named in the title are undecidable. Moreover some undecidable set $M$ can be represented in the form $a\in M\Leftrightarrow\exists x_1\dots x_n P$ where $P$ is a system of the above mentioned form. However some recursive set cannot be represented in this form.