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