YES

We show the termination of the TRS R:

  cond(true(),x,y) -> cond(gr(x,y),p(x),y)
  gr(|0|(),x) -> false()
  gr(s(x),|0|()) -> true()
  gr(s(x),s(y)) -> gr(x,y)
  p(|0|()) -> |0|()
  p(s(x)) -> x

-- SCC decomposition.

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

p1: cond#(true(),x,y) -> cond#(gr(x,y),p(x),y)
p2: cond#(true(),x,y) -> gr#(x,y)
p3: cond#(true(),x,y) -> p#(x)
p4: gr#(s(x),s(y)) -> gr#(x,y)

and R consists of:

r1: cond(true(),x,y) -> cond(gr(x,y),p(x),y)
r2: gr(|0|(),x) -> false()
r3: gr(s(x),|0|()) -> true()
r4: gr(s(x),s(y)) -> gr(x,y)
r5: p(|0|()) -> |0|()
r6: p(s(x)) -> x

The estimated dependency graph contains the following SCCs:

  {p1}
  {p4}


-- Reduction pair.

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

p1: cond#(true(),x,y) -> cond#(gr(x,y),p(x),y)

and R consists of:

r1: cond(true(),x,y) -> cond(gr(x,y),p(x),y)
r2: gr(|0|(),x) -> false()
r3: gr(s(x),|0|()) -> true()
r4: gr(s(x),s(y)) -> gr(x,y)
r5: p(|0|()) -> |0|()
r6: p(s(x)) -> x

The set of usable rules consists of

  r2, r3, r4, r5, r6

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          cond#_A(x1,x2,x3) = max{x1 + 1, x2 + 4}
          true_A = 7
          gr_A(x1,x2) = x1 + 2
          p_A(x1) = max{3, x1 - 1}
          |0|_A = 2
          false_A = 3
          s_A(x1) = x1 + 8
    
      precedence:
      
        true = gr > cond# = p = |0| = false = s
      
      partial status:
    
        pi(cond#) = [1]
        pi(true) = []
        pi(gr) = []
        pi(p) = []
        pi(|0|) = []
        pi(false) = []
        pi(s) = [1]
    
    2. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          cond#_A(x1,x2,x3) = x1 + 1
          true_A = 3
          gr_A(x1,x2) = 5
          p_A(x1) = 1
          |0|_A = 2
          false_A = 6
          s_A(x1) = x1 + 4
    
      precedence:
      
        cond# = true = gr = p = |0| = false = s
      
      partial status:
    
        pi(cond#) = [1]
        pi(true) = []
        pi(gr) = []
        pi(p) = []
        pi(|0|) = []
        pi(false) = []
        pi(s) = [1]
    

The next rules are strictly ordered:

  p1

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

-- Reduction pair.

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

p1: gr#(s(x),s(y)) -> gr#(x,y)

and R consists of:

r1: cond(true(),x,y) -> cond(gr(x,y),p(x),y)
r2: gr(|0|(),x) -> false()
r3: gr(s(x),|0|()) -> true()
r4: gr(s(x),s(y)) -> gr(x,y)
r5: p(|0|()) -> |0|()
r6: p(s(x)) -> x

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          gr#_A(x1,x2) = max{2, x1 - 1, x2 + 1}
          s_A(x1) = max{1, x1}
    
      precedence:
      
        gr# = s
      
      partial status:
    
        pi(gr#) = [2]
        pi(s) = [1]
    
    2. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          gr#_A(x1,x2) = 0
          s_A(x1) = max{2, x1}
    
      precedence:
      
        gr# = s
      
      partial status:
    
        pi(gr#) = []
        pi(s) = [1]
    

The next rules are strictly ordered:

  p1

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