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