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