  The aim of this note is to prove that monoids $\mathrm{Mon}\langle
a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete
rewriting systems. This is some advance in the understanding the long-standing
open problem whether the word problem for one-relator monoids is soluble.
