MAYBE
Input TRS:
      1: b(a(a(b(a(b(a(b(b(a(x1)))))))))) -> a(b(a(b(a(b(b(a(a(b(a(b(a(b(x1))))))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying b
      1: b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> a(b^1_a(b^1_a(b(b^1_a(a(b^1_a(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(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b^1_a(b^1_a(b(b^1_a(a(b^1_a(b^1_a(b(x1))))))))
     #3: #b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b^1_a(b(b^1_a(a(b^1_a(b^1_a(b(x1)))))))
     #4: #b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b(b^1_a(a(b^1_a(b^1_a(b(x1))))))
     #5: #b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b^1_a(a(b^1_a(b^1_a(b(x1)))))
     #6: #b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b^1_a(b^1_a(b(x1)))
     #7: #b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b^1_a(b(x1))
     #8: #b^1_a(a(b^1_a(b^1_a(b(b^1_a(x1)))))) -> #b(x1)
Number of SCCs: 1, DPs: 8
  SCC { #1..8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 + 10452, 0)
      b 	w: max(x1 - 10452, 0)
      b^1_a	w: max(x1, 0)
      #b 	w: max(x1 - 20903, 0)
      #b^1_a	w: max(x1 - 10451, 0)
    USABLE RULES: { 1 2 }
    Removed DPs: #2..4 #6..8
Number of SCCs: 1, DPs: 1
  SCC { #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.