YES

We show the termination of the TRS R:

  qsort(nil()) -> nil()
  qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
  lowers(x,nil()) -> nil()
  lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
  greaters(x,nil()) -> nil()
  greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))

-- SCC decomposition.

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

p1: qsort#(.(x,y)) -> qsort#(lowers(x,y))
p2: qsort#(.(x,y)) -> lowers#(x,y)
p3: qsort#(.(x,y)) -> qsort#(greaters(x,y))
p4: qsort#(.(x,y)) -> greaters#(x,y)
p5: lowers#(x,.(y,z)) -> lowers#(x,z)
p6: greaters#(x,.(y,z)) -> greaters#(x,z)

and R consists of:

r1: qsort(nil()) -> nil()
r2: qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
r3: lowers(x,nil()) -> nil()
r4: lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
r5: greaters(x,nil()) -> nil()
r6: greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))

The estimated dependency graph contains the following SCCs:

  {p1, p3}
  {p5}
  {p6}


-- Reduction pair.

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

p1: qsort#(.(x,y)) -> qsort#(lowers(x,y))
p2: qsort#(.(x,y)) -> qsort#(greaters(x,y))

and R consists of:

r1: qsort(nil()) -> nil()
r2: qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
r3: lowers(x,nil()) -> nil()
r4: lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
r5: greaters(x,nil()) -> nil()
r6: greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))

The set of usable rules consists of

  r3, r4, r5, r6

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. lexicographic path order with precedence:
    
      precedence:
      
        <= > lowers > . > if > nil > greaters > qsort#
      
      argument filter:
    
        pi(qsort#) = 1
        pi(.) = [1, 2]
        pi(lowers) = 2
        pi(greaters) = [1, 2]
        pi(nil) = []
        pi(if) = []
        pi(<=) = [1, 2]
    
    2. lexicographic path order with precedence:
    
      precedence:
      
        <= > if > nil > greaters > lowers > . > qsort#
      
      argument filter:
    
        pi(qsort#) = []
        pi(.) = 1
        pi(lowers) = 2
        pi(greaters) = [1, 2]
        pi(nil) = []
        pi(if) = []
        pi(<=) = 1
    
    3. lexicographic path order with precedence:
    
      precedence:
      
        <= > if > nil > greaters > lowers > . > qsort#
      
      argument filter:
    
        pi(qsort#) = []
        pi(.) = 1
        pi(lowers) = 2
        pi(greaters) = 1
        pi(nil) = []
        pi(if) = []
        pi(<=) = 1
    

The next rules are strictly ordered:

  p1, p2

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: lowers#(x,.(y,z)) -> lowers#(x,z)

and R consists of:

r1: qsort(nil()) -> nil()
r2: qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
r3: lowers(x,nil()) -> nil()
r4: lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
r5: greaters(x,nil()) -> nil()
r6: greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))

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:
      
        . > lowers#
      
      argument filter:
    
        pi(lowers#) = [2]
        pi(.) = [1, 2]
    
    2. lexicographic path order with precedence:
    
      precedence:
      
        . > lowers#
      
      argument filter:
    
        pi(lowers#) = [2]
        pi(.) = [1, 2]
    
    3. lexicographic path order with precedence:
    
      precedence:
      
        . > lowers#
      
      argument filter:
    
        pi(lowers#) = [2]
        pi(.) = [1, 2]
    

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: greaters#(x,.(y,z)) -> greaters#(x,z)

and R consists of:

r1: qsort(nil()) -> nil()
r2: qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y))))
r3: lowers(x,nil()) -> nil()
r4: lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z))
r5: greaters(x,nil()) -> nil()
r6: greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z)))

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:
      
        . > greaters#
      
      argument filter:
    
        pi(greaters#) = [2]
        pi(.) = [1, 2]
    
    2. lexicographic path order with precedence:
    
      precedence:
      
        . > greaters#
      
      argument filter:
    
        pi(greaters#) = [2]
        pi(.) = [1, 2]
    
    3. lexicographic path order with precedence:
    
      precedence:
      
        . > greaters#
      
      argument filter:
    
        pi(greaters#) = [2]
        pi(.) = [1, 2]
    

The next rules are strictly ordered:

  p1

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