YES
Input TRS:
      1: f(a(),f(b(),x)) -> f(b(),f(a(),x))
      2: f(b(),f(c(),x)) -> f(c(),f(b(),x))
      3: f(c(),f(a(),x)) -> f(a(),f(c(),x))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying f
      1: f^1_a(f^1_b(x)) -> f^1_b(f^1_a(x))
      2: f^1_b(f^1_c(x)) -> f^1_c(f^1_b(x))
      3: f^1_c(f^1_a(x)) -> f^1_a(f^1_c(x))
      4: f(a(),_1) ->= f^1_a(_1)
      5: f(c(),_1) ->= f^1_c(_1)
      6: f(b(),_1) ->= f^1_b(_1)
Number of strict rules: 3
Direct POLO(bPol) ... removes: 4 5 6 2
      a 	w: 0
      b 	w: 1
      f^1_b	w: 2 * x1 + 1
      c 	w: 0
      f 	w: x1 + 2 * x2 + 3
      f^1_a	w: x1
      f^1_c	w: 2 * x1 + 2
Number of strict rules: 2
Direct POLO(bPol) ... removes: 3
      a 	w: 1
      b 	w: 0
      f^1_b	w: x1
      c 	w: 0
      f 	w: 2 * x1 + 2 * x2 + 3
      f^1_a	w: x1 + 1
      f^1_c	w: 2 * x1 + 2
Number of strict rules: 1
Direct POLO(bPol) ... removes: 1
      a 	w: 1
      b 	w: 0
      f^1_b	w: x1 + 3
      c 	w: 0
      f 	w: 2 * x1 + 2 * x2 + 3
      f^1_a	w: 2 * x1 + 1
      f^1_c	w: x1
Number of strict rules: 0