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