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