YES

We show the termination of the relative TRS R/S:

  R:
  minus(x,|0|()) -> x
  minus(s(x),s(y)) -> minus(x,y)
  quot(|0|(),s(y)) -> |0|()
  quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))

  S:
  rand(x) -> x
  rand(x) -> rand(s(x))

-- SCC decomposition.

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

p1: minus#(s(x),s(y)) -> minus#(x,y)
p2: quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))
p3: quot#(s(x),s(y)) -> minus#(x,y)

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: rand(x) -> x
r6: rand(x) -> rand(s(x))

The estimated dependency graph contains the following SCCs:

  {p2}
  {p1}


-- Reduction pair.

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

p1: quot#(s(x),s(y)) -> quot#(minus(x,y),s(y))

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: rand(x) -> x
r6: rand(x) -> rand(s(x))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. lexicographic path order with precedence:
    
      precedence:
      
        rand > quot > s > |0| > minus > quot#
      
      argument filter:
    
        pi(quot#) = [1]
        pi(s) = 1
        pi(minus) = 1
        pi(|0|) = []
        pi(quot) = 1
        pi(rand) = [1]
    
    2. lexicographic path order with precedence:
    
      precedence:
      
        rand > minus > quot > s > |0| > quot#
      
      argument filter:
    
        pi(quot#) = [1]
        pi(s) = [1]
        pi(minus) = 1
        pi(|0|) = []
        pi(quot) = 1
        pi(rand) = []
    

The next rules are strictly ordered:

  p1

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

-- Reduction pair.

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

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

and R consists of:

r1: minus(x,|0|()) -> x
r2: minus(s(x),s(y)) -> minus(x,y)
r3: quot(|0|(),s(y)) -> |0|()
r4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
r5: rand(x) -> x
r6: rand(x) -> rand(s(x))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. lexicographic path order with precedence:
    
      precedence:
      
        s > rand > |0| > minus > quot > minus#
      
      argument filter:
    
        pi(minus#) = [1, 2]
        pi(s) = 1
        pi(minus) = 1
        pi(|0|) = []
        pi(quot) = [1]
        pi(rand) = [1]
    
    2. lexicographic path order with precedence:
    
      precedence:
      
        quot > s > rand > |0| > minus > minus#
      
      argument filter:
    
        pi(minus#) = [2]
        pi(s) = [1]
        pi(minus) = 1
        pi(|0|) = []
        pi(quot) = [1]
        pi(rand) = []
    

The next rules are strictly ordered:

  p1

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