MAYBE
Input TRS:
      1: a(a(L(x))) -> L(a(a(x)))
      2: R(a(x)) -> a(R(x))
      3: b(L(x)) -> b(R(x))
      4: R(b(x)) -> L(a(b(x)))
      5: R(b(x)) -> a(L(b(x)))
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #R(a(x)) -> #a(R(x))
     #2: #R(a(x)) -> #R(x)
     #3: #R(b(x)) -> #a(L(b(x)))
     #4: #b(L(x)) -> #b(R(x))
     #5: #b(L(x)) -> #R(x)
     #6: #a(a(L(x))) -> #a(a(x))
     #7: #a(a(L(x))) -> #a(x)
     #8: #R(b(x)) -> #a(b(x))
Number of SCCs: 3, DPs: 4
  SCC { #2 }
POLO(Sum)... succeeded.
      a 	w: x1 + 1
      b 	w: 0
      #R 	w: x1
      R 	w: 0
      L 	w: 0
      #a 	w: 0
      #b 	w: 0
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 2, DPs: 3
  SCC { #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.