YES
Input TRS:
      1: l(m(x)) -> m(l(x))
      2: m(r(x)) -> r(m(x))
      3: f(m(x),y) -> f(x,m(y))
      4: b() ->= l(b())
      5: f(x,y) ->= f(x,r(y))
Number of strict rules: 3
Direct POLO(bPol) ... removes: 1
      b 	w: 0
      r 	w: x1
      l 	w: 2 * x1
      f 	w: x1 + x2 + 8365
      m 	w: x1 + 1
Number of strict rules: 2
Direct POLO(bPol) ... removes: 3
      b 	w: 0
      r 	w: x1
      l 	w: 2 * x1
      f 	w: 2 * x1 + x2 + 8365
      m 	w: x1 + 1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #m(r(x)) -> #m(x)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... succeeded.
      b 	w: 1
      r 	w: x1 + 21239
      l 	w: x1
      f 	w: 0
      #m 	w: x1
      m 	w: x1 + 11293
    Removed DPs: #1
Number of SCCs: 0, DPs: 0