YES
Input TRS:
      1: a(x,y) -> b(x,b(0(),c(y)))
      2: c(b(y,c(x))) -> c(c(b(a(0(),0()),y)))
      3: b(y,0()) -> y
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #c(b(y,c(x))) -> #c(c(b(a(0(),0()),y)))
     #2: #c(b(y,c(x))) -> #c(b(a(0(),0()),y))
     #3: #c(b(y,c(x))) -> #b(a(0(),0()),y)
     #4: #c(b(y,c(x))) -> #a(0(),0())
     #5: #a(x,y) -> #b(x,b(0(),c(y)))
     #6: #a(x,y) -> #b(0(),c(y))
     #7: #a(x,y) -> #c(y)
Number of SCCs: 1, DPs: 3
  SCC { #2 #4 #7 }
POLO(Sum)... succeeded.
      a 	w: x1 + 11799
      b 	w: x1 + x2
      c 	w: 11799
      0 	w: 0
      #c 	w: x1
      #a 	w: x2 + 1
      #b 	w: 0
    USABLE RULES: { 1..3 }
    Removed DPs: #4 #7
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [1,1;1,1] * x1 + [1,0;1,0] * x2 + [39827;43114]
      b 	w: x1 + [0,0;1,0] * x2 + [23493;19620]
      c 	w: [82948;1]
      0 	w: [1;1]
      #c 	w: [1,1;0,0] * x1
      #a 	w: [0;0]
      #b 	w: [0;0]
    USABLE RULES: { 1..3 }
    Removed DPs: #2
Number of SCCs: 0, DPs: 0