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