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