YES

We show the termination of the TRS R:

  -(|0|(),y) -> |0|()
  -(x,|0|()) -> x
  -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),|0|())
  p(|0|()) -> |0|()
  p(s(x)) -> x

-- SCC decomposition.

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

p1: -#(x,s(y)) -> -#(x,p(s(y)))
p2: -#(x,s(y)) -> p#(s(y))

and R consists of:

r1: -(|0|(),y) -> |0|()
r2: -(x,|0|()) -> x
r3: -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),|0|())
r4: p(|0|()) -> |0|()
r5: 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: -#(x,s(y)) -> -#(x,p(s(y)))

and R consists of:

r1: -(|0|(),y) -> |0|()
r2: -(x,|0|()) -> x
r3: -(x,s(y)) -> if(greater(x,s(y)),s(-(x,p(s(y)))),|0|())
r4: p(|0|()) -> |0|()
r5: p(s(x)) -> x

The set of usable rules consists of

  r5

Take the reduction pair:

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

The next rules are strictly ordered:

  p1

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