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