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