YES
Input TRS:
      1: a(s(x1)) -> s(a(x1))
      2: b(a(b(s(x1)))) -> a(b(s(a(x1))))
      3: b(a(b(b(x1)))) -> c(s(x1))
      4: c(s(x1)) -> a(b(a(b(x1))))
      5: a(b(a(a(x1)))) -> b(a(b(a(x1))))
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying c
      1: a(s(x1)) -> s(a(x1))
      2: b(a(b(s(x1)))) -> a(b(s(a(x1))))
      3: b(a(b(b(x1)))) -> c^1_s(x1)
      4: c^1_s(x1) -> a(b(a(b(x1))))
      5: a(b(a(a(x1)))) -> b(a(b(a(x1))))
      6: c(s(_1)) ->= c^1_s(_1)
Number of strict rules: 5
Direct POLO(bPol) ... removes: 6
      a 	w: x1 + 1
      s 	w: x1 + 1
      b 	w: x1 + 1
      c 	w: x1 + 4
      c^1_s	w: x1 + 4
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #b(a(b(s(x1)))) -> #a(b(s(a(x1))))
     #2: #b(a(b(s(x1)))) -> #b(s(a(x1)))
     #3: #b(a(b(s(x1)))) -> #a(x1)
     #4: #a(b(a(a(x1)))) -> #b(a(b(a(x1))))
     #5: #a(b(a(a(x1)))) -> #a(b(a(x1)))
     #6: #a(b(a(a(x1)))) -> #b(a(x1))
     #7: #b(a(b(b(x1)))) -> #c^1_s(x1)
     #8: #a(s(x1)) -> #a(x1)
     #9: #c^1_s(x1) -> #a(b(a(b(x1))))
     #10: #c^1_s(x1) -> #b(a(b(x1)))
     #11: #c^1_s(x1) -> #a(b(x1))
     #12: #c^1_s(x1) -> #b(x1)
Number of SCCs: 1, DPs: 10
  SCC { #3..12 }
POLO(Sum)... succeeded.
      a 	w: x1 + 20163
      s 	w: x1 + 8856
      b 	w: x1 + 20163
      c 	w: 0
      #c^1_s	w: x1 + 60489
      #a 	w: x1
      c^1_s	w: x1 + 80652
      #b 	w: x1
    USABLE RULES: { 1..5 }
    Removed DPs: #3 #5 #6 #8 #10..12
Number of SCCs: 1, DPs: 3
  SCC { #4 #7 #9 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [1,0;1,0] * x1 + [3871;3703]
      s 	w: [1,0;0,0] * x1 + [1;622]
      b 	w: [0,1;0,1] * x1 + [168;3871]
      c 	w: [0;0]
      #c^1_s	w: [0,1;0,1] * x1 + [4041;4039]
      #a 	w: [1,0;1,0] * x1 + [1;0]
      c^1_s	w: [0,1;0,1] * x1 + [7910;7742]
      #b 	w: [1,0;1,0] * x1
    USABLE RULES: { 1..5 }
    Removed DPs: #4 #7 #9
Number of SCCs: 0, DPs: 0