YES
Input TRS:
      1: a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1))))))))))
      2: b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
      3: c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1)))))))))
      4: p(p(s(x1))) -> p(x1)
      5: p(s(x1)) -> x1
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying p
      1: a(s(x1)) -> s(s(s(p^1_s(b(p(p^1_s(s(x1))))))))
      2: b(s(x1)) -> s(s(s(p(p^1_s(s(c(p^1_s(p^1_s(x1)))))))))
      3: c(s(x1)) -> p^1_s(p^1_s(a(p^1_s(p^1_s(x1)))))
      4: p(p^1_s(x1)) -> p(x1)
      5: p^1_s(x1) -> x1
      6: p(s(_1)) ->= p^1_s(_1)
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
     #1: #b(s(x1)) -> #p(p^1_s(s(c(p^1_s(p^1_s(x1))))))
     #2: #b(s(x1)) -> #p^1_s(s(c(p^1_s(p^1_s(x1)))))
     #3: #b(s(x1)) -> #c(p^1_s(p^1_s(x1)))
     #4: #b(s(x1)) -> #p^1_s(p^1_s(x1))
     #5: #b(s(x1)) -> #p^1_s(x1)
     #6: #p(s(_1)) ->? #p^1_s(_1)
     #7: #c(s(x1)) -> #p^1_s(p^1_s(a(p^1_s(p^1_s(x1)))))
     #8: #c(s(x1)) -> #p^1_s(a(p^1_s(p^1_s(x1))))
     #9: #c(s(x1)) -> #a(p^1_s(p^1_s(x1)))
     #10: #c(s(x1)) -> #p^1_s(p^1_s(x1))
     #11: #c(s(x1)) -> #p^1_s(x1)
     #12: #a(s(x1)) -> #p^1_s(b(p(p^1_s(s(x1)))))
     #13: #a(s(x1)) -> #b(p(p^1_s(s(x1))))
     #14: #a(s(x1)) -> #p(p^1_s(s(x1)))
     #15: #a(s(x1)) -> #p^1_s(s(x1))
     #16: #p(p^1_s(x1)) -> #p(x1)
Number of SCCs: 2, DPs: 4
  SCC { #16 }
POLO(Sum)... succeeded.
      a 	w: 0
      s 	w: 0
      b 	w: 0
      #p^1_s	w: 0
      p^1_s	w: x1 + 1
      c 	w: 0
      #p 	w: x1
      p 	w: 0
      #c 	w: 0
      #a 	w: 0
      #b 	w: 0
    USABLE RULES: { }
    Removed DPs: #16
Number of SCCs: 1, DPs: 3
  SCC { #3 #9 #13 }
POLO(Sum)... succeeded.
      a 	w: 0
      s 	w: x1 + 11801
      b 	w: 0
      #p^1_s	w: 0
      p^1_s	w: x1 + 1
      c 	w: 0
      #p 	w: 0
      p 	w: x1 + 23594
      #c 	w: x1 + 11798
      #a 	w: x1 + 23596
      #b 	w: x1
    USABLE RULES: { 4..6 }
    Removed DPs: #3 #9 #13
Number of SCCs: 0, DPs: 0