MAYBE
Input TRS:
      1: a(b(b(a(a(b(a(b(a(b(x1)))))))))) -> a(b(a(b(a(b(a(b(b(a(a(b(b(a(x1))))))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying a
      1: a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> a^1_b(a^1_b(a^1_b(a^1_b(b(a(a^1_b(b(a(x1)))))))))
      2: a(b(_1)) ->= a^1_b(_1)
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #a(b(_1)) ->? #a^1_b(_1)
     #2: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a^1_b(a^1_b(a^1_b(a^1_b(b(a(a^1_b(b(a(x1)))))))))
     #3: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a^1_b(a^1_b(a^1_b(b(a(a^1_b(b(a(x1))))))))
     #4: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a^1_b(a^1_b(b(a(a^1_b(b(a(x1)))))))
     #5: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a^1_b(b(a(a^1_b(b(a(x1))))))
     #6: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a(a^1_b(b(a(x1))))
     #7: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a^1_b(b(a(x1)))
     #8: #a^1_b(b(a(a^1_b(a^1_b(a^1_b(x1)))))) -> #a(x1)
Number of SCCs: 1, DPs: 4
  SCC { #1 #5 #7 #8 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 - 11799, 0)
      b 	w: max(x1 + 11799, 0)
      #a^1_b	w: max(x1 + 1, 0)
      a^1_b	w: max(x1, 0)
      #a 	w: max(x1 - 11798, 0)
    USABLE RULES: { 1 2 }
    Removed DPs: #8
Number of SCCs: 1, DPs: 2
  SCC { #5 #7 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.