Do you understand the definition of local confluence? You are looking for pairs of left hand sides of rules of the form $uv$ and $vw$ for strings $u,v,w$. Then, to test local confluence, you reduce the word $uvw$ in two different ways and check that the results are the same.
The six listed words are the only possible words $uvw$ arising from the three left hand sides in the rewriting system. For example, the first one $xyzx$ comes from the left hand sides $xyz$ and $yzx$ with $u=x$, $v=yz$, $w=x$.
Do you understand the definition of local confluence? You are looking for pairs of left hand sides of rules of the form $uv$ and $vw$ for strings $u,v,w$. Then, to test local confluence, you reduce the word $uvw$ in two different ways and check that the results are the same.
The six listed words are the only possible words $uvw$ arising from the three left hand sides in the rewriting system. For example, the first one $xyzx$ comes from the left hand sides $xyz$ and $yzx$ with $u=x$, $v=yz$, $w=x$.