MAYBE
Input TRS:
      1: a(a(b(a(a(a(a(a(x1)))))))) -> a(a(a(a(a(a(a(b(a(a(a(a(b(x1)))))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(a(a(a(a(b(a(a(a(a(b(x1)))))))))))))
     #2: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))
     #3: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(a(a(b(a(a(a(a(b(x1)))))))))))
     #4: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(a(b(a(a(a(a(b(x1))))))))))
     #5: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(b(a(a(a(a(b(x1)))))))))
     #6: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(b(a(a(a(a(b(x1))))))))
     #7: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(b(a(a(a(a(b(x1)))))))
     #8: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(a(b(x1)))))
     #9: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(a(b(x1))))
     #10: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(a(b(x1)))
     #11: #a(a(b(a(a(a(a(a(x1)))))))) -> #a(b(x1))
Number of SCCs: 1, DPs: 9
  SCC { #1..6 #8..10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 - 64396, 0)
      b 	w: 97193
      #a 	w: max(x1 + 31598, 0)
    USABLE RULES: { 1 }
    Removed DPs: #1..5 #8 #9
Number of SCCs: 1, DPs: 2
  SCC { #6 #10 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.