YES

We show the termination of the TRS 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)))

-- SCC decomposition.

Consider the 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)))

The estimated dependency graph contains the following SCCs:

  {p2}
  {p1}


-- Reduction pair.

Consider the 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)))

The set of usable rules consists of

  r1, r2

Take the reduction pair:

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

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: 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)))

The set of usable rules consists of

  (no rules)

Take the reduction pair:

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

The next rules are strictly ordered:

  p1

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