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)))
  le(|0|(),y) -> true()
  le(s(x),|0|()) -> false()
  le(s(x),s(y)) -> le(x,y)
  app(nil(),y) -> y
  app(add(n,x),y) -> add(n,app(x,y))
  low(n,nil()) -> nil()
  low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
  if_low(true(),n,add(m,x)) -> add(m,low(n,x))
  if_low(false(),n,add(m,x)) -> low(n,x)
  high(n,nil()) -> nil()
  high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
  if_high(true(),n,add(m,x)) -> high(n,x)
  if_high(false(),n,add(m,x)) -> add(m,high(n,x))
  quicksort(nil()) -> nil()
  quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))


-- 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)
p4: le#(s(x),s(y)) -> le#(x,y)
p5: app#(add(n,x),y) -> app#(x,y)
p6: low#(n,add(m,x)) -> if_low#(le(m,n),n,add(m,x))
p7: low#(n,add(m,x)) -> le#(m,n)
p8: if_low#(true(),n,add(m,x)) -> low#(n,x)
p9: if_low#(false(),n,add(m,x)) -> low#(n,x)
p10: high#(n,add(m,x)) -> if_high#(le(m,n),n,add(m,x))
p11: high#(n,add(m,x)) -> le#(m,n)
p12: if_high#(true(),n,add(m,x)) -> high#(n,x)
p13: if_high#(false(),n,add(m,x)) -> high#(n,x)
p14: quicksort#(add(n,x)) -> app#(quicksort(low(n,x)),add(n,quicksort(high(n,x))))
p15: quicksort#(add(n,x)) -> quicksort#(low(n,x))
p16: quicksort#(add(n,x)) -> low#(n,x)
p17: quicksort#(add(n,x)) -> quicksort#(high(n,x))
p18: quicksort#(add(n,x)) -> high#(n,x)

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The estimated dependency graph contains the following SCCs:

  {p2}
  {p1}
  {p15, p17}
  {p10, p12, p13}
  {p6, p8, p9}
  {p4}
  {p5}


-- 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)))
r5: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  r1, r2

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          quot#_A(x1,x2) = x1 + x2
          s_A(x1) = x1 + 6
          minus_A(x1,x2) = x1 + 1
          |0|_A() = 5
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            quot#_A(x1,x2) = x1
            s_A(x1) = x1 + 2
            minus_A(x1,x2) = x1 + 1
            |0|_A() = 2
            quot#!_A(x1,x2) = x2 + 4
            s!_A(x1) = 5
            minus!_A(x1,x2) = x2 + 4
            |0|!_A() = 4
  
    partial status:
  
      pi(quot#) = [1]
      pi(s) = []
      pi(minus) = [1]
      pi(|0|) = []

The following rules are removed:

  p1

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)))
r5: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          minus#_A(x1,x2) = x1 + x2
          s_A(x1) = x1 + 12
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            minus#_A(x1,x2) = x1 + x2
            s_A(x1) = x1 + 2
            minus#!_A(x1,x2) = 0
            s!_A(x1) = 4
  
    partial status:
  
      pi(minus#) = []
      pi(s) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

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

p1: quicksort#(add(n,x)) -> quicksort#(high(n,x))
p2: quicksort#(add(n,x)) -> quicksort#(low(n,x))

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  r10, r11, r12, r13, r14, r15, r16, r17

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          quicksort#_A(x1) = 0
          add_A(x1,x2) = x1 + x2 + 5
          high_A(x1,x2) = x2 + 3
          low_A(x1,x2) = x1 + x2 + 1
          nil_A() = 1
          if_low_A(x1,x2,x3) = x2 + x3 + 1
          le_A(x1,x2) = x1 + 9
          true_A() = 13
          false_A() = 2
          if_high_A(x1,x2,x3) = x3 + 3
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            quicksort#_A(x1) = x1
            add_A(x1,x2) = x1 + x2 + 7
            high_A(x1,x2) = x1 + x2 + 6
            low_A(x1,x2) = x1 + x2 + 7
            nil_A() = 2
            if_low_A(x1,x2,x3) = x2 + x3 + 7
            le_A(x1,x2) = x1 + x2 + 1
            true_A() = 4
            false_A() = 5
            if_high_A(x1,x2,x3) = x2 + x3 + 6
            quicksort#!_A(x1) = x1
            add!_A(x1,x2) = 13
            high!_A(x1,x2) = x1 + x2 + 8
            low!_A(x1,x2) = x2 + 12
            nil!_A() = 10
            if_low!_A(x1,x2,x3) = x3 + 7
            le!_A(x1,x2) = x1 + x2 + 14
            true!_A() = 7
            false!_A() = 5
            if_high!_A(x1,x2,x3) = x3 + 6
  
    partial status:
  
      pi(quicksort#) = []
      pi(add) = []
      pi(high) = [2]
      pi(low) = [1]
      pi(nil) = []
      pi(if_low) = []
      pi(le) = []
      pi(true) = []
      pi(false) = []
      pi(if_high) = [3]

The following rules are removed:

  p1



-- SCC decomposition.

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

p1: quicksort#(add(n,x)) -> quicksort#(low(n,x))

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: quicksort#(add(n,x)) -> quicksort#(low(n,x))

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  r5, r6, r7, r10, r11, r12, r13

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          quicksort#_A(x1) = 0
          add_A(x1,x2) = x2 + 4
          low_A(x1,x2) = x1 + x2 + 6
          le_A(x1,x2) = 3
          |0|_A() = 6
          true_A() = 3
          s_A(x1) = 4
          false_A() = 1
          nil_A() = 1
          if_low_A(x1,x2,x3) = x1 + x2 + x3 + 3
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            quicksort#_A(x1) = x1
            add_A(x1,x2) = x1 + x2 + 2
            low_A(x1,x2) = x1 + x2 + 1
            le_A(x1,x2) = x1 + x2 + 1
            |0|_A() = 1
            true_A() = 1
            s_A(x1) = x1 + 3
            false_A() = 1
            nil_A() = 4
            if_low_A(x1,x2,x3) = x2 + x3 + 1
            quicksort#!_A(x1) = x1 + 4
            add!_A(x1,x2) = 4
            low!_A(x1,x2) = x2 + 7
            le!_A(x1,x2) = 4
            |0|!_A() = 7
            true!_A() = 0
            s!_A(x1) = 5
            false!_A() = 6
            nil!_A() = 2
            if_low!_A(x1,x2,x3) = x3 + 6
  
    partial status:
  
      pi(quicksort#) = []
      pi(add) = []
      pi(low) = []
      pi(le) = []
      pi(|0|) = []
      pi(true) = []
      pi(s) = []
      pi(false) = []
      pi(nil) = []
      pi(if_low) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

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

p1: if_high#(false(),n,add(m,x)) -> high#(n,x)
p2: high#(n,add(m,x)) -> if_high#(le(m,n),n,add(m,x))
p3: if_high#(true(),n,add(m,x)) -> high#(n,x)

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  r3

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          if_high#_A(x1,x2,x3) = 4
          false_A() = 2
          add_A(x1,x2) = x2 + 5
          high#_A(x1,x2) = 4
          le_A(x1,x2) = 3
          true_A() = 5
          quot_A(x1,x2) = x1 + x2
          |0|_A() = 6
          s_A(x1) = x1 + 7
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            if_high#_A(x1,x2,x3) = x3
            false_A() = 12
            add_A(x1,x2) = x1 + x2 + 3
            high#_A(x1,x2) = x2
            le_A(x1,x2) = x1 + x2 + 1
            true_A() = 11
            quot_A(x1,x2) = x1
            |0|_A() = 9
            s_A(x1) = x1 + 1
            if_high#!_A(x1,x2,x3) = x2 + x3 + 3
            false!_A() = 13
            add!_A(x1,x2) = 8
            high#!_A(x1,x2) = x1 + x2 + 4
            le!_A(x1,x2) = x1 + x2 + 3
            true!_A() = 11
            quot!_A(x1,x2) = 15
            |0|!_A() = 14
            s!_A(x1) = 16
  
    partial status:
  
      pi(if_high#) = []
      pi(false) = []
      pi(add) = []
      pi(high#) = []
      pi(le) = []
      pi(true) = []
      pi(quot) = []
      pi(|0|) = []
      pi(s) = []

The following rules are removed:

  p1, p2, p3

Then no dependency pair remains.

-- Reduction pair.

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

p1: if_low#(false(),n,add(m,x)) -> low#(n,x)
p2: low#(n,add(m,x)) -> if_low#(le(m,n),n,add(m,x))
p3: if_low#(true(),n,add(m,x)) -> low#(n,x)

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  r5, r6, r7

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          if_low#_A(x1,x2,x3) = x1 + x3
          false_A() = 2
          add_A(x1,x2) = x2 + 3
          low#_A(x1,x2) = x2 + 4
          le_A(x1,x2) = 4
          true_A() = 1
          |0|_A() = 3
          s_A(x1) = x1 + 5
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            if_low#_A(x1,x2,x3) = x3
            false_A() = 1
            add_A(x1,x2) = x2 + 6
            low#_A(x1,x2) = x2
            le_A(x1,x2) = x1 + x2 + 1
            true_A() = 1
            |0|_A() = 1
            s_A(x1) = x1 + 1
            if_low#!_A(x1,x2,x3) = 8
            false!_A() = 11
            add!_A(x1,x2) = 7
            low#!_A(x1,x2) = 8
            le!_A(x1,x2) = x2 + 10
            true!_A() = 9
            |0|!_A() = 12
            s!_A(x1) = 14
  
    partial status:
  
      pi(if_low#) = []
      pi(false) = []
      pi(add) = []
      pi(low#) = []
      pi(le) = []
      pi(true) = []
      pi(|0|) = []
      pi(s) = []

The following rules are removed:

  p1



-- SCC decomposition.

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

p1: low#(n,add(m,x)) -> if_low#(le(m,n),n,add(m,x))
p2: if_low#(true(),n,add(m,x)) -> low#(n,x)

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The estimated dependency graph contains the following SCCs:

  {p1, p2}


-- Reduction pair.

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

p1: low#(n,add(m,x)) -> if_low#(le(m,n),n,add(m,x))
p2: if_low#(true(),n,add(m,x)) -> low#(n,x)

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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          low#_A(x1,x2) = x1 + x2 + 7
          add_A(x1,x2) = x1 + x2 + 6
          if_low#_A(x1,x2,x3) = x2 + x3 + 6
          le_A(x1,x2) = x1 + 9
          true_A() = 1
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            low#_A(x1,x2) = 0
            add_A(x1,x2) = x1 + 3
            if_low#_A(x1,x2,x3) = 0
            le_A(x1,x2) = x1 + x2 + 1
            true_A() = 4
            low#!_A(x1,x2) = 3
            add!_A(x1,x2) = 7
            if_low#!_A(x1,x2,x3) = x3 + 5
            le!_A(x1,x2) = x1 + x2 + 6
            true!_A() = 2
  
    partial status:
  
      pi(low#) = []
      pi(add) = []
      pi(if_low#) = []
      pi(le) = []
      pi(true) = []

The following rules are removed:

  p1, p2

Then no dependency pair remains.

-- Reduction pair.

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

p1: le#(s(x),s(y)) -> le#(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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          le#_A(x1,x2) = x1 + x2
          s_A(x1) = x1 + 12
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            le#_A(x1,x2) = x1 + x2
            s_A(x1) = x1 + 2
            le#!_A(x1,x2) = 0
            s!_A(x1) = 4
  
    partial status:
  
      pi(le#) = []
      pi(s) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

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

p1: app#(add(n,x),y) -> app#(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: le(|0|(),y) -> true()
r6: le(s(x),|0|()) -> false()
r7: le(s(x),s(y)) -> le(x,y)
r8: app(nil(),y) -> y
r9: app(add(n,x),y) -> add(n,app(x,y))
r10: low(n,nil()) -> nil()
r11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x))
r12: if_low(true(),n,add(m,x)) -> add(m,low(n,x))
r13: if_low(false(),n,add(m,x)) -> low(n,x)
r14: high(n,nil()) -> nil()
r15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x))
r16: if_high(true(),n,add(m,x)) -> high(n,x)
r17: if_high(false(),n,add(m,x)) -> add(m,high(n,x))
r18: quicksort(nil()) -> nil()
r19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x))))

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      matrix interpretation with standard point-wise order:
      
        carrier: N^1
        order: standard order
        interpretations:
          app#_A(x1,x2) = x1
          add_A(x1,x2) = x1 + x2 + 5
  
    base order 2:
  
      marked-algebra reduction triple (>=A, >=A!, >A!):
      
        matrix interpretation with standard point-wise order:
        
          carrier: N^1
          order: standard order
          interpretations:
            app#_A(x1,x2) = x1
            add_A(x1,x2) = x1 + x2 + 6
            app#!_A(x1,x2) = 13
            add!_A(x1,x2) = x1 + x2 + 14
  
    partial status:
  
      pi(app#) = [1]
      pi(add) = []

The following rules are removed:

  p1

Then no dependency pair remains.