YES(?,O(n^1))
TRS:
 {  f 0() -> cons 0(),
  f s 0() -> f p s 0(),
    p s X -> X}
 DUP: We consider a non-duplicating system.
  Trs:
   {  f 0() -> cons 0(),
    f s 0() -> f p s 0(),
      p s X -> X}
  BOUND:
   Bound: match(-raise)-bounded by 2
   Automaton:
    {
       s_1(4) -> 5*
       s_0(1) -> 1*
       p_1(5) -> 6*
       p_0(1) -> 1*
        0_2() -> 8*
        0_1() -> 2*
        0_0() -> 1*
       cons_2(8) -> 9*
       cons_1(2) -> 3*
       cons_0(1) -> 1*
       f_1(6) -> 7*
     f_0(1) -> 1*
          9 -> 7*
          7 -> 1*
          4 -> 6*
          3 -> 1*
          2 -> 4*
    }
   Strict:
    {}
   Qed