YES

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

  R:
  app(nil(),k) -> k
  app(l,nil()) -> l
  app(cons(x,l),k) -> cons(x,app(l,k))
  sum(cons(x,nil())) -> cons(x,nil())
  sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
  sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
  plus(|0|(),y) -> y
  plus(s(x),y) -> s(plus(x,y))

  S:
  cons(x,cons(y,l)) -> cons(y,cons(x,l))

-- SCC decomposition.

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

p1: app#(cons(x,l),k) -> app#(l,k)
p2: sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))
p3: sum#(cons(x,cons(y,l))) -> plus#(x,y)
p4: sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
p5: sum#(app(l,cons(x,cons(y,k)))) -> app#(l,sum(cons(x,cons(y,k))))
p6: sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
p7: plus#(s(x),y) -> plus#(x,y)

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The estimated dependency graph contains the following SCCs:

  {p2, p4, p6}
  {p1}
  {p7}


-- Reduction pair.

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

p1: sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k)))
p2: sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
p3: sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          sum#_A(x1) = max{5, x1 + 4}
          app_A(x1,x2) = max{72, x1 + 29, x2 + 12}
          cons_A(x1,x2) = 4
          sum_A(x1) = 32
          plus_A(x1,x2) = max{x1 + 28, x2 + 3}
          nil_A = 3
          |0|_A = 0
          s_A(x1) = max{29, x1}
    
      precedence:
      
        app > sum > cons > plus = nil = s > sum# = |0|
      
      partial status:
    
        pi(sum#) = [1]
        pi(app) = []
        pi(cons) = []
        pi(sum) = []
        pi(plus) = [2]
        pi(nil) = []
        pi(|0|) = []
        pi(s) = []
    
    2. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          sum#_A(x1) = max{6, x1 - 13}
          app_A(x1,x2) = 0
          cons_A(x1,x2) = 8
          sum_A(x1) = 9
          plus_A(x1,x2) = 78
          nil_A = 0
          |0|_A = 0
          s_A(x1) = 5
    
      precedence:
      
        sum# = app = cons = sum = plus = nil = |0| = s
      
      partial status:
    
        pi(sum#) = []
        pi(app) = []
        pi(cons) = []
        pi(sum) = []
        pi(plus) = []
        pi(nil) = []
        pi(|0|) = []
        pi(s) = []
    

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
p2: sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The estimated dependency graph contains the following SCCs:

  {p1, p2}


-- Reduction pair.

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

p1: sum#(app(l,cons(x,cons(y,k)))) -> sum#(app(l,sum(cons(x,cons(y,k)))))
p2: sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        matrix interpretations:
        
          carrier: N^2
          order: lexicographic order
          interpretations:
            sum#_A(x1) = ((1,0),(1,1)) x1 + (2,1)
            app_A(x1,x2) = x1 + x2 + (5,3)
            cons_A(x1,x2) = x2 + (4,0)
            sum_A(x1) = (5,2)
            plus_A(x1,x2) = ((1,0),(0,0)) x1 + x2 + (11,10)
            nil_A() = (0,1)
            |0|_A() = (1,1)
            s_A(x1) = (12,1)
    
      precedence:
      
        app > plus > sum > cons > sum# > nil = |0| > s
      
      partial status:
    
        pi(sum#) = [1]
        pi(app) = [2]
        pi(cons) = [2]
        pi(sum) = []
        pi(plus) = [2]
        pi(nil) = []
        pi(|0|) = []
        pi(s) = []
    
    2. weighted path order
    
      base order:
    
        matrix interpretations:
        
          carrier: N^2
          order: lexicographic order
          interpretations:
            sum#_A(x1) = x1
            app_A(x1,x2) = ((1,0),(1,0)) x2 + (1,7)
            cons_A(x1,x2) = x2 + (4,6)
            sum_A(x1) = (6,7)
            plus_A(x1,x2) = x2 + (9,13)
            nil_A() = (1,0)
            |0|_A() = (1,1)
            s_A(x1) = (1,1)
    
      precedence:
      
        plus > sum = nil > sum# = app = cons = |0| = s
      
      partial status:
    
        pi(sum#) = []
        pi(app) = []
        pi(cons) = [2]
        pi(sum) = []
        pi(plus) = []
        pi(nil) = []
        pi(|0|) = []
        pi(s) = []
    

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l))

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        matrix interpretations:
        
          carrier: N^2
          order: lexicographic order
          interpretations:
            sum#_A(x1) = ((1,0),(0,0)) x1 + (1,4)
            cons_A(x1,x2) = ((1,0),(1,0)) x2 + (2,1)
            plus_A(x1,x2) = x1 + x2 + (6,0)
            app_A(x1,x2) = ((1,0),(1,0)) x1 + ((1,0),(1,1)) x2 + (3,3)
            nil_A() = (1,1)
            sum_A(x1) = x1
            |0|_A() = (1,1)
            s_A(x1) = (7,1)
    
      precedence:
      
        sum# = cons = plus = app = nil = sum = |0| = s
      
      partial status:
    
        pi(sum#) = []
        pi(cons) = []
        pi(plus) = []
        pi(app) = []
        pi(nil) = []
        pi(sum) = []
        pi(|0|) = []
        pi(s) = []
    
    2. weighted path order
    
      base order:
    
        matrix interpretations:
        
          carrier: N^2
          order: lexicographic order
          interpretations:
            sum#_A(x1) = (0,0)
            cons_A(x1,x2) = (1,1)
            plus_A(x1,x2) = ((1,0),(0,0)) x1 + x2 + (2,2)
            app_A(x1,x2) = x2 + (2,2)
            nil_A() = (1,1)
            sum_A(x1) = (1,1)
            |0|_A() = (1,1)
            s_A(x1) = (1,1)
    
      precedence:
      
        app = sum > plus = |0| = s > sum# = cons = nil
      
      partial status:
    
        pi(sum#) = []
        pi(cons) = []
        pi(plus) = [2]
        pi(app) = []
        pi(nil) = []
        pi(sum) = []
        pi(|0|) = []
        pi(s) = []
    

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: app#(cons(x,l),k) -> app#(l,k)

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        matrix interpretations:
        
          carrier: N^2
          order: lexicographic order
          interpretations:
            app#_A(x1,x2) = x1 + x2 + (1,4)
            cons_A(x1,x2) = x2 + (2,3)
            app_A(x1,x2) = ((1,0),(1,1)) x1 + x2 + (3,4)
            nil_A() = (1,2)
            sum_A(x1) = (5,1)
            plus_A(x1,x2) = ((1,0),(1,1)) x1 + x2 + (6,7)
            |0|_A() = (1,1)
            s_A(x1) = x1 + (1,0)
    
      precedence:
      
        app# = app = nil = sum > cons = plus = |0| = s
      
      partial status:
    
        pi(app#) = [1, 2]
        pi(cons) = [2]
        pi(app) = [1, 2]
        pi(nil) = []
        pi(sum) = []
        pi(plus) = [1]
        pi(|0|) = []
        pi(s) = [1]
    
    2. weighted path order
    
      base order:
    
        matrix interpretations:
        
          carrier: N^2
          order: lexicographic order
          interpretations:
            app#_A(x1,x2) = (0,0)
            cons_A(x1,x2) = (1,2)
            app_A(x1,x2) = (1,2)
            nil_A() = (1,2)
            sum_A(x1) = (0,0)
            plus_A(x1,x2) = (1,1)
            |0|_A() = (1,1)
            s_A(x1) = (1,1)
    
      precedence:
      
        |0| > nil > app# = cons = app = sum = plus = s
      
      partial status:
    
        pi(app#) = []
        pi(cons) = []
        pi(app) = []
        pi(nil) = []
        pi(sum) = []
        pi(plus) = []
        pi(|0|) = []
        pi(s) = []
    

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: plus#(s(x),y) -> plus#(x,y)

and R consists of:

r1: app(nil(),k) -> k
r2: app(l,nil()) -> l
r3: app(cons(x,l),k) -> cons(x,app(l,k))
r4: sum(cons(x,nil())) -> cons(x,nil())
r5: sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l))
r6: sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k)))))
r7: plus(|0|(),y) -> y
r8: plus(s(x),y) -> s(plus(x,y))
r9: cons(x,cons(y,l)) -> cons(y,cons(x,l))

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          plus#_A(x1,x2) = max{1, x1}
          s_A(x1) = max{1, x1}
          app_A(x1,x2) = max{x1 + 9, x2 + 5}
          nil_A = 2
          cons_A(x1,x2) = max{3, x2}
          sum_A(x1) = max{4, x1}
          plus_A(x1,x2) = max{x1 + 10, x2 + 10}
          |0|_A = 0
    
      precedence:
      
        plus > plus# = s = nil > app = cons = sum = |0|
      
      partial status:
    
        pi(plus#) = [1]
        pi(s) = [1]
        pi(app) = []
        pi(nil) = []
        pi(cons) = []
        pi(sum) = []
        pi(plus) = [1]
        pi(|0|) = []
    
    2. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          plus#_A(x1,x2) = max{0, x1 - 2}
          s_A(x1) = max{21, x1 + 1}
          app_A(x1,x2) = 4
          nil_A = 16
          cons_A(x1,x2) = 4
          sum_A(x1) = 1
          plus_A(x1,x2) = x1 + 19
          |0|_A = 0
    
      precedence:
      
        nil > plus# = s = app = cons = sum = plus = |0|
      
      partial status:
    
        pi(plus#) = []
        pi(s) = []
        pi(app) = []
        pi(nil) = []
        pi(cons) = []
        pi(sum) = []
        pi(plus) = [1]
        pi(|0|) = []
    

The next rules are strictly ordered:

  p1

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