YES

Problem:
 p(s(x)) -> x
 fac(0()) -> s(0())
 fac(s(x)) -> times(s(x),fac(p(s(x))))

Proof:
 DP Processor:
  DPs:
   fac#(s(x)) -> p#(s(x))
   fac#(s(x)) -> fac#(p(s(x)))
  TRS:
   p(s(x)) -> x
   fac(0()) -> s(0())
   fac(s(x)) -> times(s(x),fac(p(s(x))))
  EDG Processor:
   DPs:
    fac#(s(x)) -> p#(s(x))
    fac#(s(x)) -> fac#(p(s(x)))
   TRS:
    p(s(x)) -> x
    fac(0()) -> s(0())
    fac(s(x)) -> times(s(x),fac(p(s(x))))
   graph:
    fac#(s(x)) -> fac#(p(s(x))) -> fac#(s(x)) -> p#(s(x))
    fac#(s(x)) -> fac#(p(s(x))) -> fac#(s(x)) -> fac#(p(s(x)))
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 2/4
    DPs:
     fac#(s(x)) -> fac#(p(s(x)))
    TRS:
     p(s(x)) -> x
     fac(0()) -> s(0())
     fac(s(x)) -> times(s(x),fac(p(s(x))))
    Usable Rule Processor:
     DPs:
      fac#(s(x)) -> fac#(p(s(x)))
     TRS:
      p(s(x)) -> x
     Bounds Processor:
      bound: 1
      enrichment: match
      automaton:
       final states: {5}
       transitions:
        s1(10) -> 11*
        fac{#,0}(4) -> 5*
        s0(4) -> 4*
        p0(4) -> 4*
        fac{#,1}(12) -> 13*
        p1(11) -> 12*
        4 -> 10*
        10 -> 12*
        13 -> 5*
      problem:
       DPs:
        
       TRS:
        p(s(x)) -> x
      Qed