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