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