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