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