YES

We show the termination of the TRS R:

  f(s(x)) -> s(s(f(p(s(x)))))
  f(|0|()) -> |0|()
  p(s(x)) -> x

-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

p1: f#(s(x)) -> f#(p(s(x)))
p2: f#(s(x)) -> p#(s(x))

and R consists of:

r1: f(s(x)) -> s(s(f(p(s(x)))))
r2: f(|0|()) -> |0|()
r3: p(s(x)) -> x

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

Consider the dependency pair problem (P, R), where P consists of

p1: f#(s(x)) -> f#(p(s(x)))

and R consists of:

r1: f(s(x)) -> s(s(f(p(s(x)))))
r2: f(|0|()) -> |0|()
r3: p(s(x)) -> x

The set of usable rules consists of

  r3

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. lexicographic path order with precedence:
    
      precedence:
      
        s > p > f#
      
      argument filter:
    
        pi(f#) = [1]
        pi(s) = [1]
        pi(p) = 1
    
    2. lexicographic path order with precedence:
    
      precedence:
      
        p > s > f#
      
      argument filter:
    
        pi(f#) = 1
        pi(s) = 1
        pi(p) = 1
    
    3. lexicographic path order with precedence:
    
      precedence:
      
        s > p > f#
      
      argument filter:
    
        pi(f#) = [1]
        pi(s) = [1]
        pi(p) = []
    

The next rules are strictly ordered:

  p1

We remove them from the problem.  Then no dependency pair remains.