MAYBE
Input TRS:
      1: b(b(b(x1))) -> a(b(x1))
      2: a(a(x1)) -> a(b(a(x1)))
      3: a(a(a(x1))) -> a(b(b(x1)))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #a(a(x1)) -> #a(b(a(x1)))
     #2: #a(a(x1)) -> #b(a(x1))
     #3: #a(a(a(x1))) -> #a(b(b(x1)))
     #4: #a(a(a(x1))) -> #b(b(x1))
     #5: #a(a(a(x1))) -> #b(x1)
     #6: #b(b(b(x1))) -> #a(b(x1))
Number of SCCs: 1, DPs: 4
  SCC { #3..6 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.