YES
Input TRS:
      1: a(l(x1)) -> l(a(x1))
      2: r(a(a(x1))) -> a(a(r(x1)))
      3: b(l(x1)) -> b(a(r(x1)))
      4: r(b(x1)) -> l(b(x1))
Number of strict rules: 4
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #r(a(a(x1))) -> #a(a(r(x1)))
     #2: #r(a(a(x1))) -> #a(r(x1))
     #3: #r(a(a(x1))) -> #r(x1)
     #4: #b(l(x1)) -> #b(a(r(x1)))
     #5: #b(l(x1)) -> #a(r(x1))
     #6: #b(l(x1)) -> #r(x1)
     #7: #a(l(x1)) -> #a(x1)
Number of SCCs: 3, DPs: 3
  SCC { #7 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: 0
      r 	w: 0
      l 	w: x1 + 1
      #r 	w: 0
      #a 	w: x1
      #b 	w: 0
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 2, DPs: 2
  SCC { #3 }
POLO(Sum)... succeeded.
      a 	w: x1 + 1
      b 	w: 0
      r 	w: 0
      l 	w: 1
      #r 	w: x1
      #a 	w: 0
      #b 	w: 0
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 1
  SCC { #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [0,1;1,0] * x1 + [1;1]
      b 	w: [1,0;1,0] * x1 + [4;2]
      r 	w: [1,1;1,0] * x1
      l 	w: x1 + [2;2]
      #r 	w: [0;0]
      #a 	w: [0;0]
      #b 	w: [1,0;0,0] * x1
    USABLE RULES: { 1..4 }
    Removed DPs: #4
Number of SCCs: 0, DPs: 0