YES
Input TRS:
      1: c(a(b(a(b(x1))))) -> a(b(a(b(b(a(b(b(c(a(b(c(a(x1)))))))))))))
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying c^1_a c
      1: c^1_a^1_b(a(b(x1))) -> a(b(a(b(b(a(b(b(c^1_a^1_b(c^1_a(x1))))))))))
      2: c(a(_1)) ->= c^1_a(_1)
      3: c^1_a(b(_1)) ->= c^1_a^1_b(_1)
Number of strict rules: 1
Direct POLO(bPol) ... removes: 2
      a 	w: x1
      b 	w: x1
      c^1_a	w: x1
      c 	w: x1 + 2
      c^1_a^1_b	w: x1
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #c^1_a(b(_1)) ->? #c^1_a^1_b(_1)
     #2: #c^1_a^1_b(a(b(x1))) -> #c^1_a^1_b(c^1_a(x1))
     #3: #c^1_a^1_b(a(b(x1))) -> #c^1_a(x1)
Number of SCCs: 1, DPs: 3
  SCC { #1..3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      a 	w: max(x1 - 44740, 0)
      b 	w: max(x1 + 26844, 0)
      c^1_a	w: 1
      c 	w: max(x1 - 1, 0)
      c^1_a^1_b	w: 1
      #c^1_a	w: max(x1 - 26843, 0)
      #c^1_a^1_b	w: max(x1 - 1, 0)
    USABLE RULES: { 1 3 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [0,0;1,0] * x1 + [1;45101]
      b 	w: [1,0;0,0] * x1 + [1;0]
      c^1_a	w: [1,0;1,0] * x1 + [8924;45101]
      c 	w: [0;0]
      c^1_a^1_b	w: [1,0;1,0] * x1 + [0;45102]
      #c^1_a	w: [0;0]
      #c^1_a^1_b	w: [0,1;0,1] * x1
    USABLE RULES: { 1 3 }
    Removed DPs: #2
Number of SCCs: 0, DPs: 0