YES
Input TRS:
      1: t(f(x1)) -> t(c(n(x1)))
      2: n(f(x1)) -> f(n(x1))
      3: o(f(x1)) -> f(o(x1))
      4: n(s(x1)) -> f(s(x1))
      5: o(s(x1)) -> f(s(x1))
      6: c(f(x1)) -> f(c(x1))
      7: c(n(x1)) -> n(c(x1))
      8: c(o(x1)) -> o(c(x1))
      9: c(o(x1)) -> o(x1)
Number of strict rules: 9
Direct POLO(bPol) ... removes: 5
      s 	w: 2 * x1 + 28882
      n 	w: x1 + 1
      t 	w: x1 + 2240
      c 	w: x1
      f 	w: x1 + 1
      o 	w: x1 + 2
Number of strict rules: 8
Direct POLO(bPol) ... removes: 3
      s 	w: 2 * x1 + 32279
      n 	w: x1 + 1
      t 	w: x1 + 4686
      c 	w: x1
      f 	w: x1 + 1
      o 	w: 2 * x1 + 2
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #n(f(x1)) -> #n(x1)
     #2: #c(f(x1)) -> #c(x1)
     #3: #c(n(x1)) -> #n(c(x1))
     #4: #c(n(x1)) -> #c(x1)
     #5: #t(f(x1)) -> #t(c(n(x1)))
     #6: #t(f(x1)) -> #c(n(x1))
     #7: #t(f(x1)) -> #n(x1)
     #8: #c(o(x1)) -> #c(x1)
Number of SCCs: 3, DPs: 5
  SCC { #1 }
POLO(Sum)... succeeded.
      s 	w: 0
      n 	w: 0
      t 	w: 0
      c 	w: 0
      f 	w: x1 + 1
      o 	w: 0
      #c 	w: 0
      #t 	w: 0
      #n 	w: x1
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 4
  SCC { #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      s 	w: [1,0;0,0] * x1 + [2;1]
      n 	w: [1,0;1,1] * x1 + [0;52937]
      t 	w: [0;0]
      c 	w: [0,0;0,1] * x1 + [0;1]
      f 	w: x1 + [0;52939]
      o 	w: [0,0;0,1] * x1 + [0;40990]
      #c 	w: [0;0]
      #t 	w: [1,1;0,0] * x1
      #n 	w: [0;0]
    USABLE RULES: { 2 4 6..9 }
    Removed DPs: #5
Number of SCCs: 1, DPs: 3
  SCC { #2 #4 #8 }
POLO(Sum)... succeeded.
      s 	w: 1
      n 	w: x1 + 20539
      t 	w: 0
      c 	w: 282
      f 	w: x1 + 20539
      o 	w: x1 + 283
      #c 	w: x1
      #t 	w: 0
      #n 	w: 0
    USABLE RULES: { 2 4 }
    Removed DPs: #2 #4 #8
Number of SCCs: 0, DPs: 0