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:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: standard order
        interpretations:
          quot#_A(x1,x2) = x1
          s_A(x1) = x1
          minus_A(x1,x2) = x1
          |0|_A() = (0,1)
          quot_A(x1,x2) = x1 + (1,1)
          rand_A(x1) = x1 + (1,1)
  
    precedence:
    
      quot > s > quot# = |0| > minus > rand
    
    partial status:
  
      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:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: standard order
        interpretations:
          minus#_A(x1,x2) = x1
          s_A(x1) = x1
          minus_A(x1,x2) = x1
          |0|_A() = (1,1)
          quot_A(x1,x2) = x1 + ((0,0),(1,0)) x2 + (0,1)
          rand_A(x1) = x1 + (1,1)
  
    precedence:
    
      quot > minus# = s = |0| > minus > rand
    
    partial status:
  
      pi(minus#) = [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.