MAYBE
Input TRS:
      1: c(c(c(y))) -> c(c(a(y,0())))
      2: c(a(a(0(),x),y)) -> a(c(c(c(0()))),y)
      3: c(y) -> y
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #c(a(a(0(),x),y)) -> #c(c(c(0())))
     #2: #c(a(a(0(),x),y)) -> #c(c(0()))
     #3: #c(a(a(0(),x),y)) -> #c(0())
     #4: #c(c(c(y))) -> #c(c(a(y,0())))
     #5: #c(c(c(y))) -> #c(a(y,0()))
Number of SCCs: 1, DPs: 4
  SCC { #1 #2 #4 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [0;29272]
      c 	w: [1,0;1,1] * x1 + [29272;0]
      0 	w: [0;0]
      #c 	w: [0,1;0,0] * x1
    USABLE RULES: { 1..3 }
    Removed DPs: #2
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.