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