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