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