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