YES
Input TRS:
      1: a(b(x1)) -> b(b(a(x1)))
      2: c(b(x1)) -> b(c(c(x1)))
Number of strict rules: 2
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #c(b(x1)) -> #c(c(x1))
     #2: #c(b(x1)) -> #c(x1)
     #3: #a(b(x1)) -> #a(x1)
Number of SCCs: 2, DPs: 3
  SCC { #3 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: x1 + 1
      c 	w: 0
      #c 	w: 0
      #a 	w: x1
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 2
  SCC { #1 #2 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: x1 + 1
      c 	w: x1
      #c 	w: x1
      #a 	w: 0
    USABLE RULES: { 2 }
    Removed DPs: #1 #2
Number of SCCs: 0, DPs: 0