YES

We show the termination of the TRS R:

  active(fst(|0|(),Z)) -> mark(nil())
  active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
  active(from(X)) -> mark(cons(X,from(s(X))))
  active(add(|0|(),X)) -> mark(X)
  active(add(s(X),Y)) -> mark(s(add(X,Y)))
  active(len(nil())) -> mark(|0|())
  active(len(cons(X,Z))) -> mark(s(len(Z)))
  mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
  mark(|0|()) -> active(|0|())
  mark(nil()) -> active(nil())
  mark(s(X)) -> active(s(X))
  mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
  mark(from(X)) -> active(from(mark(X)))
  mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
  mark(len(X)) -> active(len(mark(X)))
  fst(mark(X1),X2) -> fst(X1,X2)
  fst(X1,mark(X2)) -> fst(X1,X2)
  fst(active(X1),X2) -> fst(X1,X2)
  fst(X1,active(X2)) -> fst(X1,X2)
  s(mark(X)) -> s(X)
  s(active(X)) -> s(X)
  cons(mark(X1),X2) -> cons(X1,X2)
  cons(X1,mark(X2)) -> cons(X1,X2)
  cons(active(X1),X2) -> cons(X1,X2)
  cons(X1,active(X2)) -> cons(X1,X2)
  from(mark(X)) -> from(X)
  from(active(X)) -> from(X)
  add(mark(X1),X2) -> add(X1,X2)
  add(X1,mark(X2)) -> add(X1,X2)
  add(active(X1),X2) -> add(X1,X2)
  add(X1,active(X2)) -> add(X1,X2)
  len(mark(X)) -> len(X)
  len(active(X)) -> len(X)

-- SCC decomposition.

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

p1: active#(fst(|0|(),Z)) -> mark#(nil())
p2: active#(fst(s(X),cons(Y,Z))) -> mark#(cons(Y,fst(X,Z)))
p3: active#(fst(s(X),cons(Y,Z))) -> cons#(Y,fst(X,Z))
p4: active#(fst(s(X),cons(Y,Z))) -> fst#(X,Z)
p5: active#(from(X)) -> mark#(cons(X,from(s(X))))
p6: active#(from(X)) -> cons#(X,from(s(X)))
p7: active#(from(X)) -> from#(s(X))
p8: active#(from(X)) -> s#(X)
p9: active#(add(|0|(),X)) -> mark#(X)
p10: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p11: active#(add(s(X),Y)) -> s#(add(X,Y))
p12: active#(add(s(X),Y)) -> add#(X,Y)
p13: active#(len(nil())) -> mark#(|0|())
p14: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p15: active#(len(cons(X,Z))) -> s#(len(Z))
p16: active#(len(cons(X,Z))) -> len#(Z)
p17: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p18: mark#(fst(X1,X2)) -> fst#(mark(X1),mark(X2))
p19: mark#(fst(X1,X2)) -> mark#(X1)
p20: mark#(fst(X1,X2)) -> mark#(X2)
p21: mark#(|0|()) -> active#(|0|())
p22: mark#(nil()) -> active#(nil())
p23: mark#(s(X)) -> active#(s(X))
p24: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p25: mark#(cons(X1,X2)) -> cons#(mark(X1),X2)
p26: mark#(cons(X1,X2)) -> mark#(X1)
p27: mark#(from(X)) -> active#(from(mark(X)))
p28: mark#(from(X)) -> from#(mark(X))
p29: mark#(from(X)) -> mark#(X)
p30: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p31: mark#(add(X1,X2)) -> add#(mark(X1),mark(X2))
p32: mark#(add(X1,X2)) -> mark#(X1)
p33: mark#(add(X1,X2)) -> mark#(X2)
p34: mark#(len(X)) -> active#(len(mark(X)))
p35: mark#(len(X)) -> len#(mark(X))
p36: mark#(len(X)) -> mark#(X)
p37: fst#(mark(X1),X2) -> fst#(X1,X2)
p38: fst#(X1,mark(X2)) -> fst#(X1,X2)
p39: fst#(active(X1),X2) -> fst#(X1,X2)
p40: fst#(X1,active(X2)) -> fst#(X1,X2)
p41: s#(mark(X)) -> s#(X)
p42: s#(active(X)) -> s#(X)
p43: cons#(mark(X1),X2) -> cons#(X1,X2)
p44: cons#(X1,mark(X2)) -> cons#(X1,X2)
p45: cons#(active(X1),X2) -> cons#(X1,X2)
p46: cons#(X1,active(X2)) -> cons#(X1,X2)
p47: from#(mark(X)) -> from#(X)
p48: from#(active(X)) -> from#(X)
p49: add#(mark(X1),X2) -> add#(X1,X2)
p50: add#(X1,mark(X2)) -> add#(X1,X2)
p51: add#(active(X1),X2) -> add#(X1,X2)
p52: add#(X1,active(X2)) -> add#(X1,X2)
p53: len#(mark(X)) -> len#(X)
p54: len#(active(X)) -> len#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p2, p5, p9, p10, p14, p17, p19, p20, p23, p24, p26, p27, p29, p30, p32, p33, p34, p36}
  {p43, p44, p45, p46}
  {p37, p38, p39, p40}
  {p47, p48}
  {p41, p42}
  {p49, p50, p51, p52}
  {p53, p54}


-- Reduction pair.

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

p1: mark#(len(X)) -> active#(len(mark(X)))
p2: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p3: mark#(len(X)) -> mark#(X)
p4: mark#(add(X1,X2)) -> mark#(X2)
p5: mark#(add(X1,X2)) -> mark#(X1)
p6: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p7: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p8: mark#(from(X)) -> mark#(X)
p9: mark#(from(X)) -> active#(from(mark(X)))
p10: active#(add(|0|(),X)) -> mark#(X)
p11: mark#(cons(X1,X2)) -> mark#(X1)
p12: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p13: active#(from(X)) -> mark#(cons(X,from(s(X))))
p14: mark#(s(X)) -> active#(s(X))
p15: active#(fst(s(X),cons(Y,Z))) -> mark#(cons(Y,fst(X,Z)))
p16: mark#(fst(X1,X2)) -> mark#(X2)
p17: mark#(fst(X1,X2)) -> mark#(X1)
p18: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((0,0),(1,0)) x1 + (21,14)
          len_A(x1) = ((1,0),(1,0)) x1 + (20,37)
          active#_A(x1) = ((0,0),(1,0)) x1 + (21,14)
          mark_A(x1) = x1 + (0,4)
          cons_A(x1,x2) = ((1,0),(1,0)) x1 + (2,21)
          s_A(x1) = (10,0)
          add_A(x1,x2) = ((1,0),(0,0)) x1 + ((1,0),(0,0)) x2 + (0,2)
          from_A(x1) = ((1,0),(0,0)) x1 + (10,23)
          |0|_A() = (1,0)
          fst_A(x1,x2) = ((1,0),(1,0)) x1 + ((1,0),(1,0)) x2 + (11,5)
          active_A(x1) = x1 + (0,3)
          nil_A() = (2,1)
  
    precedence:
    
      mark# = len = active# = cons = |0| = fst = nil > add > mark = active > s = from
    
    partial status:
  
      pi(mark#) = []
      pi(len) = []
      pi(active#) = []
      pi(mark) = [1]
      pi(cons) = []
      pi(s) = []
      pi(add) = []
      pi(from) = []
      pi(|0|) = []
      pi(fst) = []
      pi(active) = [1]
      pi(nil) = []

The next rules are strictly ordered:

  p16

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> active#(len(mark(X)))
p2: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p3: mark#(len(X)) -> mark#(X)
p4: mark#(add(X1,X2)) -> mark#(X2)
p5: mark#(add(X1,X2)) -> mark#(X1)
p6: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p7: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p8: mark#(from(X)) -> mark#(X)
p9: mark#(from(X)) -> active#(from(mark(X)))
p10: active#(add(|0|(),X)) -> mark#(X)
p11: mark#(cons(X1,X2)) -> mark#(X1)
p12: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p13: active#(from(X)) -> mark#(cons(X,from(s(X))))
p14: mark#(s(X)) -> active#(s(X))
p15: active#(fst(s(X),cons(Y,Z))) -> mark#(cons(Y,fst(X,Z)))
p16: mark#(fst(X1,X2)) -> mark#(X1)
p17: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17}


-- Reduction pair.

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

p1: mark#(len(X)) -> active#(len(mark(X)))
p2: active#(fst(s(X),cons(Y,Z))) -> mark#(cons(Y,fst(X,Z)))
p3: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p4: active#(from(X)) -> mark#(cons(X,from(s(X))))
p5: mark#(fst(X1,X2)) -> mark#(X1)
p6: mark#(s(X)) -> active#(s(X))
p7: active#(add(|0|(),X)) -> mark#(X)
p8: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p9: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p10: mark#(cons(X1,X2)) -> mark#(X1)
p11: mark#(from(X)) -> active#(from(mark(X)))
p12: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p13: mark#(from(X)) -> mark#(X)
p14: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p15: mark#(add(X1,X2)) -> mark#(X1)
p16: mark#(add(X1,X2)) -> mark#(X2)
p17: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = x1 + (1,0)
          len_A(x1) = x1 + (11,8)
          active#_A(x1) = ((1,0),(0,0)) x1 + (0,7)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,10)
          fst_A(x1,x2) = x1 + ((1,0),(0,0)) x2 + (11,7)
          s_A(x1) = (1,2)
          cons_A(x1,x2) = x1 + (10,14)
          from_A(x1) = x1 + (12,6)
          add_A(x1,x2) = ((1,0),(1,0)) x1 + ((1,0),(0,0)) x2 + (2,13)
          |0|_A() = (0,1)
          active_A(x1) = x1 + (0,9)
          nil_A() = (1,4)
  
    precedence:
    
      fst = s = add > len = mark = cons > active# > mark# = nil > |0| > from = active
    
    partial status:
  
      pi(mark#) = [1]
      pi(len) = []
      pi(active#) = []
      pi(mark) = []
      pi(fst) = []
      pi(s) = []
      pi(cons) = []
      pi(from) = []
      pi(add) = []
      pi(|0|) = []
      pi(active) = [1]
      pi(nil) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> active#(len(mark(X)))
p2: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p3: active#(from(X)) -> mark#(cons(X,from(s(X))))
p4: mark#(fst(X1,X2)) -> mark#(X1)
p5: mark#(s(X)) -> active#(s(X))
p6: active#(add(|0|(),X)) -> mark#(X)
p7: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p8: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p9: mark#(cons(X1,X2)) -> mark#(X1)
p10: mark#(from(X)) -> active#(from(mark(X)))
p11: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p12: mark#(from(X)) -> mark#(X)
p13: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p14: mark#(add(X1,X2)) -> mark#(X1)
p15: mark#(add(X1,X2)) -> mark#(X2)
p16: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16}


-- Reduction pair.

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

p1: mark#(len(X)) -> active#(len(mark(X)))
p2: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p3: mark#(len(X)) -> mark#(X)
p4: mark#(add(X1,X2)) -> mark#(X2)
p5: mark#(add(X1,X2)) -> mark#(X1)
p6: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p7: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p8: mark#(from(X)) -> mark#(X)
p9: mark#(from(X)) -> active#(from(mark(X)))
p10: active#(add(|0|(),X)) -> mark#(X)
p11: mark#(cons(X1,X2)) -> mark#(X1)
p12: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p13: active#(from(X)) -> mark#(cons(X,from(s(X))))
p14: mark#(s(X)) -> active#(s(X))
p15: mark#(fst(X1,X2)) -> mark#(X1)
p16: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((1,0),(1,1)) x1 + (7,1)
          len_A(x1) = ((1,0),(0,0)) x1 + (8,28)
          active#_A(x1) = ((1,0),(0,0)) x1 + (0,28)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,41)
          cons_A(x1,x2) = x1 + (31,68)
          s_A(x1) = (25,1)
          add_A(x1,x2) = ((1,0),(0,0)) x1 + ((1,0),(1,0)) x2 + (26,68)
          from_A(x1) = ((1,0),(1,1)) x1 + (39,141)
          |0|_A() = (1,15)
          fst_A(x1,x2) = ((1,0),(1,1)) x1 + ((1,0),(1,1)) x2 + (72,29)
          active_A(x1) = x1 + (0,30)
          nil_A() = (2,1)
  
    precedence:
    
      active# = cons > mark# = len = fst = nil > mark = s = from = |0| = active > add
    
    partial status:
  
      pi(mark#) = [1]
      pi(len) = []
      pi(active#) = []
      pi(mark) = [1]
      pi(cons) = []
      pi(s) = []
      pi(add) = []
      pi(from) = []
      pi(|0|) = []
      pi(fst) = []
      pi(active) = [1]
      pi(nil) = []

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(len(X)) -> mark#(X)
p3: mark#(add(X1,X2)) -> mark#(X2)
p4: mark#(add(X1,X2)) -> mark#(X1)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p7: mark#(from(X)) -> mark#(X)
p8: mark#(from(X)) -> active#(from(mark(X)))
p9: active#(add(|0|(),X)) -> mark#(X)
p10: mark#(cons(X1,X2)) -> mark#(X1)
p11: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p12: active#(from(X)) -> mark#(cons(X,from(s(X))))
p13: mark#(s(X)) -> active#(s(X))
p14: mark#(fst(X1,X2)) -> mark#(X1)
p15: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15}


-- Reduction pair.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p3: active#(from(X)) -> mark#(cons(X,from(s(X))))
p4: mark#(fst(X1,X2)) -> mark#(X1)
p5: mark#(s(X)) -> active#(s(X))
p6: active#(add(|0|(),X)) -> mark#(X)
p7: mark#(cons(X1,X2)) -> active#(cons(mark(X1),X2))
p8: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p9: mark#(cons(X1,X2)) -> mark#(X1)
p10: mark#(from(X)) -> active#(from(mark(X)))
p11: mark#(from(X)) -> mark#(X)
p12: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p13: mark#(add(X1,X2)) -> mark#(X1)
p14: mark#(add(X1,X2)) -> mark#(X2)
p15: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          active#_A(x1) = ((1,0),(0,0)) x1 + (1,8)
          len_A(x1) = (4,3)
          cons_A(x1,x2) = (1,4)
          mark#_A(x1) = (3,8)
          s_A(x1) = (2,0)
          fst_A(x1,x2) = (2,7)
          mark_A(x1) = (0,6)
          from_A(x1) = (2,5)
          add_A(x1,x2) = (2,5)
          |0|_A() = (0,2)
          active_A(x1) = (0,6)
          nil_A() = (0,1)
  
    precedence:
    
      len > active# = mark# = s = fst = from = add > cons = |0| = nil > mark = active
    
    partial status:
  
      pi(active#) = []
      pi(len) = []
      pi(cons) = []
      pi(mark#) = []
      pi(s) = []
      pi(fst) = []
      pi(mark) = []
      pi(from) = []
      pi(add) = []
      pi(|0|) = []
      pi(active) = []
      pi(nil) = []

The next rules are strictly ordered:

  p7

We remove them from the problem.

-- SCC decomposition.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p3: active#(from(X)) -> mark#(cons(X,from(s(X))))
p4: mark#(fst(X1,X2)) -> mark#(X1)
p5: mark#(s(X)) -> active#(s(X))
p6: active#(add(|0|(),X)) -> mark#(X)
p7: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p8: mark#(cons(X1,X2)) -> mark#(X1)
p9: mark#(from(X)) -> active#(from(mark(X)))
p10: mark#(from(X)) -> mark#(X)
p11: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p12: mark#(add(X1,X2)) -> mark#(X1)
p13: mark#(add(X1,X2)) -> mark#(X2)
p14: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14}


-- Reduction pair.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(len(X)) -> mark#(X)
p3: mark#(add(X1,X2)) -> mark#(X2)
p4: mark#(add(X1,X2)) -> mark#(X1)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p7: mark#(from(X)) -> mark#(X)
p8: mark#(from(X)) -> active#(from(mark(X)))
p9: active#(add(|0|(),X)) -> mark#(X)
p10: mark#(cons(X1,X2)) -> mark#(X1)
p11: mark#(s(X)) -> active#(s(X))
p12: active#(from(X)) -> mark#(cons(X,from(s(X))))
p13: mark#(fst(X1,X2)) -> mark#(X1)
p14: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          active#_A(x1) = ((1,0),(1,0)) x1 + (22,24)
          len_A(x1) = x1 + (22,16)
          cons_A(x1,x2) = ((1,0),(0,0)) x1 + (21,1)
          mark#_A(x1) = ((1,0),(1,0)) x1 + (23,25)
          s_A(x1) = (0,8)
          add_A(x1,x2) = ((1,0),(0,0)) x1 + ((1,0),(0,0)) x2 + (24,50)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,10)
          from_A(x1) = ((1,0),(1,0)) x1 + (45,68)
          |0|_A() = (2,13)
          fst_A(x1,x2) = x1 + x2 + (20,24)
          active_A(x1) = x1 + (0,9)
          nil_A() = (1,1)
  
    precedence:
    
      len = from > |0| = nil > active# = mark# = add > s > fst > cons = mark > active
    
    partial status:
  
      pi(active#) = []
      pi(len) = []
      pi(cons) = []
      pi(mark#) = []
      pi(s) = []
      pi(add) = []
      pi(mark) = [1]
      pi(from) = []
      pi(|0|) = []
      pi(fst) = [1]
      pi(active) = [1]
      pi(nil) = []

The next rules are strictly ordered:

  p11

We remove them from the problem.

-- SCC decomposition.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(len(X)) -> mark#(X)
p3: mark#(add(X1,X2)) -> mark#(X2)
p4: mark#(add(X1,X2)) -> mark#(X1)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p7: mark#(from(X)) -> mark#(X)
p8: mark#(from(X)) -> active#(from(mark(X)))
p9: active#(add(|0|(),X)) -> mark#(X)
p10: mark#(cons(X1,X2)) -> mark#(X1)
p11: active#(from(X)) -> mark#(cons(X,from(s(X))))
p12: mark#(fst(X1,X2)) -> mark#(X1)
p13: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13}


-- Reduction pair.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p3: active#(from(X)) -> mark#(cons(X,from(s(X))))
p4: mark#(fst(X1,X2)) -> mark#(X1)
p5: mark#(cons(X1,X2)) -> mark#(X1)
p6: mark#(from(X)) -> active#(from(mark(X)))
p7: active#(add(|0|(),X)) -> mark#(X)
p8: mark#(from(X)) -> mark#(X)
p9: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p10: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p11: mark#(add(X1,X2)) -> mark#(X1)
p12: mark#(add(X1,X2)) -> mark#(X2)
p13: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          active#_A(x1) = ((1,0),(1,1)) x1 + (3,1)
          len_A(x1) = ((1,0),(0,0)) x1 + (4,20)
          cons_A(x1,x2) = ((1,0),(1,1)) x1 + (9,16)
          mark#_A(x1) = ((1,0),(0,0)) x1 + (4,19)
          s_A(x1) = (4,16)
          fst_A(x1,x2) = x1 + ((1,0),(1,1)) x2 + (5,10)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,1)
          from_A(x1) = x1 + (19,0)
          add_A(x1,x2) = ((1,0),(0,0)) x1 + ((1,0),(1,1)) x2 + (16,0)
          |0|_A() = (3,18)
          active_A(x1) = x1
          nil_A() = (4,23)
  
    precedence:
    
      fst = add > from > cons = s = mark = |0| = active = nil > len > mark# > active#
    
    partial status:
  
      pi(active#) = [1]
      pi(len) = []
      pi(cons) = []
      pi(mark#) = []
      pi(s) = []
      pi(fst) = []
      pi(mark) = []
      pi(from) = []
      pi(add) = []
      pi(|0|) = []
      pi(active) = []
      pi(nil) = []

The next rules are strictly ordered:

  p3

We remove them from the problem.

-- SCC decomposition.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))
p3: mark#(fst(X1,X2)) -> mark#(X1)
p4: mark#(cons(X1,X2)) -> mark#(X1)
p5: mark#(from(X)) -> active#(from(mark(X)))
p6: active#(add(|0|(),X)) -> mark#(X)
p7: mark#(from(X)) -> mark#(X)
p8: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p9: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p10: mark#(add(X1,X2)) -> mark#(X1)
p11: mark#(add(X1,X2)) -> mark#(X2)
p12: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12}


-- Reduction pair.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(len(X)) -> mark#(X)
p3: mark#(add(X1,X2)) -> mark#(X2)
p4: mark#(add(X1,X2)) -> mark#(X1)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p7: mark#(from(X)) -> mark#(X)
p8: mark#(from(X)) -> active#(from(mark(X)))
p9: active#(add(|0|(),X)) -> mark#(X)
p10: mark#(cons(X1,X2)) -> mark#(X1)
p11: mark#(fst(X1,X2)) -> mark#(X1)
p12: mark#(fst(X1,X2)) -> active#(fst(mark(X1),mark(X2)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          active#_A(x1) = ((1,0),(0,0)) x1 + (1,21)
          len_A(x1) = ((1,0),(0,0)) x1 + (1,12)
          cons_A(x1,x2) = ((1,0),(0,0)) x1 + (3,14)
          mark#_A(x1) = ((1,0),(1,1)) x1 + (2,5)
          s_A(x1) = (0,15)
          add_A(x1,x2) = ((1,0),(1,0)) x1 + ((1,0),(0,0)) x2 + (5,12)
          mark_A(x1) = ((1,0),(1,0)) x1 + (0,20)
          from_A(x1) = ((1,0),(0,0)) x1 + (12,4)
          |0|_A() = (1,13)
          fst_A(x1,x2) = ((1,0),(0,0)) x1 + ((1,0),(0,0)) x2 + (10,6)
          active_A(x1) = ((1,0),(1,0)) x1 + (0,13)
          nil_A() = (10,22)
  
    precedence:
    
      mark# = add > active# = from > mark = |0| = fst = active = nil > cons > len > s
    
    partial status:
  
      pi(active#) = []
      pi(len) = []
      pi(cons) = []
      pi(mark#) = []
      pi(s) = []
      pi(add) = []
      pi(mark) = []
      pi(from) = []
      pi(|0|) = []
      pi(fst) = []
      pi(active) = []
      pi(nil) = []

The next rules are strictly ordered:

  p12

We remove them from the problem.

-- SCC decomposition.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(len(X)) -> mark#(X)
p3: mark#(add(X1,X2)) -> mark#(X2)
p4: mark#(add(X1,X2)) -> mark#(X1)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p7: mark#(from(X)) -> mark#(X)
p8: mark#(from(X)) -> active#(from(mark(X)))
p9: active#(add(|0|(),X)) -> mark#(X)
p10: mark#(cons(X1,X2)) -> mark#(X1)
p11: mark#(fst(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11}


-- Reduction pair.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(from(X)) -> active#(from(mark(X)))
p5: active#(add(|0|(),X)) -> mark#(X)
p6: mark#(from(X)) -> mark#(X)
p7: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p8: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p9: mark#(add(X1,X2)) -> mark#(X1)
p10: mark#(add(X1,X2)) -> mark#(X2)
p11: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          active#_A(x1) = ((1,0),(0,0)) x1 + (2,24)
          len_A(x1) = x1 + (2,1)
          cons_A(x1,x2) = x1 + (6,3)
          mark#_A(x1) = x1 + (5,7)
          s_A(x1) = (0,0)
          fst_A(x1,x2) = x1 + ((1,0),(1,1)) x2 + (9,8)
          from_A(x1) = ((1,0),(1,1)) x1 + (7,16)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,6)
          add_A(x1,x2) = x1 + ((1,0),(0,0)) x2 + (3,0)
          |0|_A() = (1,4)
          active_A(x1) = x1 + (0,2)
          nil_A() = (2,3)
  
    precedence:
    
      from = nil > active# = mark# = s = fst = mark = add = |0| = active > len > cons
    
    partial status:
  
      pi(active#) = []
      pi(len) = []
      pi(cons) = []
      pi(mark#) = []
      pi(s) = []
      pi(fst) = []
      pi(from) = []
      pi(mark) = []
      pi(add) = []
      pi(|0|) = []
      pi(active) = []
      pi(nil) = []

The next rules are strictly ordered:

  p4

We remove them from the problem.

-- SCC decomposition.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: active#(add(|0|(),X)) -> mark#(X)
p5: mark#(from(X)) -> mark#(X)
p6: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p7: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p8: mark#(add(X1,X2)) -> mark#(X1)
p9: mark#(add(X1,X2)) -> mark#(X2)
p10: mark#(len(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9, p10}


-- Reduction pair.

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

p1: active#(len(cons(X,Z))) -> mark#(s(len(Z)))
p2: mark#(len(X)) -> mark#(X)
p3: mark#(add(X1,X2)) -> mark#(X2)
p4: mark#(add(X1,X2)) -> mark#(X1)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p7: mark#(from(X)) -> mark#(X)
p8: mark#(cons(X1,X2)) -> mark#(X1)
p9: mark#(fst(X1,X2)) -> mark#(X1)
p10: active#(add(|0|(),X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          active#_A(x1) = x1
          len_A(x1) = (8,5)
          cons_A(x1,x2) = (7,4)
          mark#_A(x1) = (6,3)
          s_A(x1) = (3,1)
          add_A(x1,x2) = (6,3)
          mark_A(x1) = (4,2)
          from_A(x1) = (5,0)
          fst_A(x1,x2) = (2,0)
          |0|_A() = (1,0)
          active_A(x1) = (4,2)
          nil_A() = (1,0)
  
    precedence:
    
      active# = len = mark# = nil > cons = s = add = mark = from = fst = |0| = active
    
    partial status:
  
      pi(active#) = []
      pi(len) = []
      pi(cons) = []
      pi(mark#) = []
      pi(s) = []
      pi(add) = []
      pi(mark) = []
      pi(from) = []
      pi(fst) = []
      pi(|0|) = []
      pi(active) = []
      pi(nil) = []

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(add(X1,X2)) -> mark#(X2)
p3: mark#(add(X1,X2)) -> mark#(X1)
p4: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p5: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p6: mark#(from(X)) -> mark#(X)
p7: mark#(cons(X1,X2)) -> mark#(X1)
p8: mark#(fst(X1,X2)) -> mark#(X1)
p9: active#(add(|0|(),X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8, p9}


-- Reduction pair.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(from(X)) -> mark#(X)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: active#(add(|0|(),X)) -> mark#(X)
p7: mark#(add(X1,X2)) -> mark#(X1)
p8: mark#(add(X1,X2)) -> mark#(X2)
p9: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((0,0),(1,0)) x1 + (21,10)
          len_A(x1) = x1 + (5,4)
          fst_A(x1,x2) = ((1,0),(1,1)) x1 + ((1,0),(1,1)) x2 + (7,1)
          cons_A(x1,x2) = x1 + (5,9)
          from_A(x1) = ((1,0),(1,1)) x1 + (5,17)
          add_A(x1,x2) = x1 + x2 + (11,23)
          active#_A(x1) = ((0,0),(1,0)) x1 + (21,1)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,2)
          |0|_A() = (4,3)
          s_A(x1) = (10,6)
          active_A(x1) = x1 + (0,5)
          nil_A() = (11,0)
  
    precedence:
    
      cons > |0| > mark# = fst = add = active# = s = nil > mark = active > from > len
    
    partial status:
  
      pi(mark#) = []
      pi(len) = []
      pi(fst) = [1]
      pi(cons) = [1]
      pi(from) = [1]
      pi(add) = [2]
      pi(active#) = []
      pi(mark) = []
      pi(|0|) = []
      pi(s) = []
      pi(active) = []
      pi(nil) = []

The next rules are strictly ordered:

  p6

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(from(X)) -> mark#(X)
p5: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p6: mark#(add(X1,X2)) -> mark#(X1)
p7: mark#(add(X1,X2)) -> mark#(X2)
p8: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5, p6, p7, p8}


-- Reduction pair.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(add(X1,X2)) -> mark#(X2)
p3: mark#(add(X1,X2)) -> mark#(X1)
p4: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p5: active#(add(s(X),Y)) -> mark#(s(add(X,Y)))
p6: mark#(from(X)) -> mark#(X)
p7: mark#(cons(X1,X2)) -> mark#(X1)
p8: mark#(fst(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14, r15, r16, r17, r18, r19, r20, r21, r22, r23, r24, r25, r26, r27, r28, r29, r30, r31, r32, r33

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((1,0),(0,0)) x1 + (2,8)
          len_A(x1) = ((1,0),(0,0)) x1 + (3,0)
          add_A(x1,x2) = ((1,0),(1,1)) x1 + ((1,0),(0,0)) x2 + (7,0)
          active#_A(x1) = x1 + (1,2)
          mark_A(x1) = ((1,0),(1,1)) x1 + (0,3)
          s_A(x1) = (3,4)
          from_A(x1) = x1 + (7,0)
          cons_A(x1,x2) = x1 + (6,0)
          fst_A(x1,x2) = ((1,0),(0,0)) x1 + ((1,0),(0,0)) x2 + (7,3)
          active_A(x1) = x1 + (0,6)
          |0|_A() = (4,0)
          nil_A() = (5,0)
  
    precedence:
    
      mark# = len = add = mark = s = active > active# > from > cons > fst = |0| = nil
    
    partial status:
  
      pi(mark#) = []
      pi(len) = []
      pi(add) = []
      pi(active#) = [1]
      pi(mark) = []
      pi(s) = []
      pi(from) = [1]
      pi(cons) = []
      pi(fst) = []
      pi(active) = []
      pi(|0|) = []
      pi(nil) = []

The next rules are strictly ordered:

  p5

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(add(X1,X2)) -> mark#(X2)
p3: mark#(add(X1,X2)) -> mark#(X1)
p4: mark#(add(X1,X2)) -> active#(add(mark(X1),mark(X2)))
p5: mark#(from(X)) -> mark#(X)
p6: mark#(cons(X1,X2)) -> mark#(X1)
p7: mark#(fst(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p5, p6, p7}


-- Reduction pair.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(from(X)) -> mark#(X)
p5: mark#(add(X1,X2)) -> mark#(X1)
p6: mark#(add(X1,X2)) -> mark#(X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = x1 + (1,1)
          len_A(x1) = ((1,0),(1,1)) x1 + (2,2)
          fst_A(x1,x2) = ((1,0),(1,1)) x1 + x2 + (2,2)
          cons_A(x1,x2) = x1 + x2 + (2,2)
          from_A(x1) = x1 + (2,2)
          add_A(x1,x2) = ((1,0),(1,1)) x1 + ((1,0),(1,0)) x2 + (2,2)
  
    precedence:
    
      len = fst = add > mark# = cons = from
    
    partial status:
  
      pi(mark#) = [1]
      pi(len) = [1]
      pi(fst) = [1, 2]
      pi(cons) = [1, 2]
      pi(from) = [1]
      pi(add) = [1]

The next rules are strictly ordered:

  p5

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(from(X)) -> mark#(X)
p5: mark#(add(X1,X2)) -> mark#(X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4, p5}


-- Reduction pair.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(add(X1,X2)) -> mark#(X2)
p3: mark#(from(X)) -> mark#(X)
p4: mark#(cons(X1,X2)) -> mark#(X1)
p5: mark#(fst(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = x1
          len_A(x1) = ((1,0),(1,1)) x1 + (1,1)
          add_A(x1,x2) = ((1,0),(1,1)) x2 + (1,1)
          from_A(x1) = ((1,0),(1,1)) x1 + (1,1)
          cons_A(x1,x2) = ((1,0),(1,1)) x1 + ((1,0),(1,1)) x2 + (1,1)
          fst_A(x1,x2) = ((1,0),(1,1)) x1 + x2 + (1,1)
  
    precedence:
    
      add > cons = fst > mark# = len = from
    
    partial status:
  
      pi(mark#) = [1]
      pi(len) = []
      pi(add) = [2]
      pi(from) = [1]
      pi(cons) = [1, 2]
      pi(fst) = [1, 2]

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(from(X)) -> mark#(X)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(fst(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3, p4}


-- Reduction pair.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)
p4: mark#(from(X)) -> mark#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((1,0),(0,0)) x1
          len_A(x1) = ((1,0),(0,0)) x1 + (1,1)
          fst_A(x1,x2) = x1 + x2 + (1,1)
          cons_A(x1,x2) = ((1,0),(0,0)) x1 + (1,1)
          from_A(x1) = ((1,0),(0,0)) x1 + (1,1)
  
    precedence:
    
      len = fst > cons = from > mark#
    
    partial status:
  
      pi(mark#) = []
      pi(len) = []
      pi(fst) = []
      pi(cons) = []
      pi(from) = []

The next rules are strictly ordered:

  p4

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(fst(X1,X2)) -> mark#(X1)
p3: mark#(cons(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3}


-- Reduction pair.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(cons(X1,X2)) -> mark#(X1)
p3: mark#(fst(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = x1 + (1,2)
          len_A(x1) = ((1,0),(1,1)) x1 + (2,3)
          cons_A(x1,x2) = x1 + x2 + (2,3)
          fst_A(x1,x2) = ((1,0),(1,0)) x1 + ((1,0),(1,1)) x2 + (2,1)
  
    precedence:
    
      mark# = len = cons = fst
    
    partial status:
  
      pi(mark#) = [1]
      pi(len) = [1]
      pi(cons) = [1, 2]
      pi(fst) = [2]

The next rules are strictly ordered:

  p3

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(len(X)) -> mark#(X)
p2: mark#(cons(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(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: mark#(len(X)) -> mark#(X)
p2: mark#(cons(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((1,0),(1,0)) x1 + (1,2)
          len_A(x1) = ((1,0),(0,0)) x1 + (2,1)
          cons_A(x1,x2) = ((1,0),(0,0)) x1 + x2 + (2,1)
  
    precedence:
    
      mark# = len = cons
    
    partial status:
  
      pi(mark#) = []
      pi(len) = []
      pi(cons) = [2]

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: mark#(cons(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: mark#(cons(X1,X2)) -> mark#(X1)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          mark#_A(x1) = ((1,0),(1,1)) x1
          cons_A(x1,x2) = ((1,0),(1,1)) x1 + x2 + (1,1)
  
    precedence:
    
      mark# = cons
    
    partial status:
  
      pi(mark#) = [1]
      pi(cons) = [1]

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: cons#(mark(X1),X2) -> cons#(X1,X2)
p2: cons#(X1,active(X2)) -> cons#(X1,X2)
p3: cons#(active(X1),X2) -> cons#(X1,X2)
p4: cons#(X1,mark(X2)) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          cons#_A(x1,x2) = ((0,0),(1,0)) x1 + ((0,0),(1,0)) x2 + (1,2)
          mark_A(x1) = ((1,0),(0,0)) x1 + (2,3)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,1)
  
    precedence:
    
      cons# = mark > active
    
    partial status:
  
      pi(cons#) = []
      pi(mark) = []
      pi(active) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: cons#(mark(X1),X2) -> cons#(X1,X2)
p2: cons#(active(X1),X2) -> cons#(X1,X2)
p3: cons#(X1,mark(X2)) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3}


-- Reduction pair.

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

p1: cons#(mark(X1),X2) -> cons#(X1,X2)
p2: cons#(X1,mark(X2)) -> cons#(X1,X2)
p3: cons#(active(X1),X2) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          cons#_A(x1,x2) = ((0,0),(1,0)) x1 + ((0,0),(1,0)) x2 + (2,2)
          mark_A(x1) = ((1,0),(0,0)) x1 + (3,1)
          active_A(x1) = ((1,0),(0,0)) x1 + (1,1)
  
    precedence:
    
      cons# = mark = active
    
    partial status:
  
      pi(cons#) = []
      pi(mark) = []
      pi(active) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: cons#(mark(X1),X2) -> cons#(X1,X2)
p2: cons#(active(X1),X2) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(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: cons#(mark(X1),X2) -> cons#(X1,X2)
p2: cons#(active(X1),X2) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          cons#_A(x1,x2) = x1
          mark_A(x1) = ((1,0),(1,0)) x1 + (1,1)
          active_A(x1) = x1 + (1,1)
  
    precedence:
    
      mark > cons# > active
    
    partial status:
  
      pi(cons#) = [1]
      pi(mark) = []
      pi(active) = [1]

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: cons#(mark(X1),X2) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: cons#(mark(X1),X2) -> cons#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          cons#_A(x1,x2) = x1
          mark_A(x1) = x1 + (1,1)
  
    precedence:
    
      cons# = mark
    
    partial status:
  
      pi(cons#) = []
      pi(mark) = [1]

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: fst#(mark(X1),X2) -> fst#(X1,X2)
p2: fst#(X1,active(X2)) -> fst#(X1,X2)
p3: fst#(active(X1),X2) -> fst#(X1,X2)
p4: fst#(X1,mark(X2)) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          fst#_A(x1,x2) = ((0,0),(1,0)) x1 + ((0,0),(1,0)) x2 + (1,2)
          mark_A(x1) = ((1,0),(0,0)) x1 + (2,3)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,1)
  
    precedence:
    
      fst# = mark > active
    
    partial status:
  
      pi(fst#) = []
      pi(mark) = []
      pi(active) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: fst#(mark(X1),X2) -> fst#(X1,X2)
p2: fst#(active(X1),X2) -> fst#(X1,X2)
p3: fst#(X1,mark(X2)) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3}


-- Reduction pair.

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

p1: fst#(mark(X1),X2) -> fst#(X1,X2)
p2: fst#(X1,mark(X2)) -> fst#(X1,X2)
p3: fst#(active(X1),X2) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          fst#_A(x1,x2) = ((0,0),(1,0)) x1 + ((0,0),(1,0)) x2 + (1,2)
          mark_A(x1) = ((1,0),(0,0)) x1 + (2,1)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,1)
  
    precedence:
    
      fst# = mark = active
    
    partial status:
  
      pi(fst#) = []
      pi(mark) = []
      pi(active) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: fst#(mark(X1),X2) -> fst#(X1,X2)
p2: fst#(active(X1),X2) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(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: fst#(mark(X1),X2) -> fst#(X1,X2)
p2: fst#(active(X1),X2) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          fst#_A(x1,x2) = x1
          mark_A(x1) = ((1,0),(1,0)) x1 + (1,1)
          active_A(x1) = x1 + (1,1)
  
    precedence:
    
      mark > fst# > active
    
    partial status:
  
      pi(fst#) = [1]
      pi(mark) = []
      pi(active) = [1]

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: fst#(mark(X1),X2) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: fst#(mark(X1),X2) -> fst#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          fst#_A(x1,x2) = x1
          mark_A(x1) = x1 + (1,1)
  
    precedence:
    
      fst# = mark
    
    partial status:
  
      pi(fst#) = []
      pi(mark) = [1]

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: from#(mark(X)) -> from#(X)
p2: from#(active(X)) -> from#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          from#_A(x1) = ((1,0),(0,0)) x1 + (1,1)
          mark_A(x1) = x1 + (2,2)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,2)
  
    precedence:
    
      from# = mark = active
    
    partial status:
  
      pi(from#) = []
      pi(mark) = [1]
      pi(active) = []

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: from#(active(X)) -> from#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: from#(active(X)) -> from#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          from#_A(x1) = ((1,0),(1,0)) x1 + (2,2)
          active_A(x1) = ((1,0),(0,0)) x1 + (1,1)
  
    precedence:
    
      from# = active
    
    partial status:
  
      pi(from#) = []
      pi(active) = []

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: s#(mark(X)) -> s#(X)
p2: s#(active(X)) -> s#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          s#_A(x1) = ((1,0),(0,0)) x1 + (1,1)
          mark_A(x1) = x1 + (2,2)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,2)
  
    precedence:
    
      s# = mark = active
    
    partial status:
  
      pi(s#) = []
      pi(mark) = [1]
      pi(active) = []

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: s#(active(X)) -> s#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: s#(active(X)) -> s#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          s#_A(x1) = ((1,0),(1,0)) x1 + (2,2)
          active_A(x1) = ((1,0),(0,0)) x1 + (1,1)
  
    precedence:
    
      s# = active
    
    partial status:
  
      pi(s#) = []
      pi(active) = []

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: add#(mark(X1),X2) -> add#(X1,X2)
p2: add#(X1,active(X2)) -> add#(X1,X2)
p3: add#(active(X1),X2) -> add#(X1,X2)
p4: add#(X1,mark(X2)) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          add#_A(x1,x2) = ((0,0),(1,0)) x1 + ((0,0),(1,0)) x2 + (1,2)
          mark_A(x1) = ((1,0),(0,0)) x1 + (2,3)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,1)
  
    precedence:
    
      add# = mark > active
    
    partial status:
  
      pi(add#) = []
      pi(mark) = []
      pi(active) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: add#(mark(X1),X2) -> add#(X1,X2)
p2: add#(active(X1),X2) -> add#(X1,X2)
p3: add#(X1,mark(X2)) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1, p2, p3}


-- Reduction pair.

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

p1: add#(mark(X1),X2) -> add#(X1,X2)
p2: add#(X1,mark(X2)) -> add#(X1,X2)
p3: add#(active(X1),X2) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          add#_A(x1,x2) = ((0,0),(1,0)) x1 + ((0,0),(1,0)) x2 + (1,2)
          mark_A(x1) = ((1,0),(0,0)) x1 + (2,1)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,1)
  
    precedence:
    
      add# = mark = active
    
    partial status:
  
      pi(add#) = []
      pi(mark) = []
      pi(active) = []

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: add#(mark(X1),X2) -> add#(X1,X2)
p2: add#(active(X1),X2) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(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: add#(mark(X1),X2) -> add#(X1,X2)
p2: add#(active(X1),X2) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          add#_A(x1,x2) = x1
          mark_A(x1) = ((1,0),(1,0)) x1 + (1,1)
          active_A(x1) = x1 + (1,1)
  
    precedence:
    
      mark > add# > active
    
    partial status:
  
      pi(add#) = [1]
      pi(mark) = []
      pi(active) = [1]

The next rules are strictly ordered:

  p2

We remove them from the problem.

-- SCC decomposition.

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

p1: add#(mark(X1),X2) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: add#(mark(X1),X2) -> add#(X1,X2)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          add#_A(x1,x2) = x1
          mark_A(x1) = x1 + (1,1)
  
    precedence:
    
      add# = mark
    
    partial status:
  
      pi(add#) = []
      pi(mark) = [1]

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: len#(mark(X)) -> len#(X)
p2: len#(active(X)) -> len#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          len#_A(x1) = ((1,0),(0,0)) x1 + (1,1)
          mark_A(x1) = x1 + (2,2)
          active_A(x1) = ((1,0),(0,0)) x1 + (2,2)
  
    precedence:
    
      len# = mark = active
    
    partial status:
  
      pi(len#) = []
      pi(mark) = [1]
      pi(active) = []

The next rules are strictly ordered:

  p1

We remove them from the problem.

-- SCC decomposition.

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

p1: len#(active(X)) -> len#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: len#(active(X)) -> len#(X)

and R consists of:

r1: active(fst(|0|(),Z)) -> mark(nil())
r2: active(fst(s(X),cons(Y,Z))) -> mark(cons(Y,fst(X,Z)))
r3: active(from(X)) -> mark(cons(X,from(s(X))))
r4: active(add(|0|(),X)) -> mark(X)
r5: active(add(s(X),Y)) -> mark(s(add(X,Y)))
r6: active(len(nil())) -> mark(|0|())
r7: active(len(cons(X,Z))) -> mark(s(len(Z)))
r8: mark(fst(X1,X2)) -> active(fst(mark(X1),mark(X2)))
r9: mark(|0|()) -> active(|0|())
r10: mark(nil()) -> active(nil())
r11: mark(s(X)) -> active(s(X))
r12: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
r13: mark(from(X)) -> active(from(mark(X)))
r14: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2)))
r15: mark(len(X)) -> active(len(mark(X)))
r16: fst(mark(X1),X2) -> fst(X1,X2)
r17: fst(X1,mark(X2)) -> fst(X1,X2)
r18: fst(active(X1),X2) -> fst(X1,X2)
r19: fst(X1,active(X2)) -> fst(X1,X2)
r20: s(mark(X)) -> s(X)
r21: s(active(X)) -> s(X)
r22: cons(mark(X1),X2) -> cons(X1,X2)
r23: cons(X1,mark(X2)) -> cons(X1,X2)
r24: cons(active(X1),X2) -> cons(X1,X2)
r25: cons(X1,active(X2)) -> cons(X1,X2)
r26: from(mark(X)) -> from(X)
r27: from(active(X)) -> from(X)
r28: add(mark(X1),X2) -> add(X1,X2)
r29: add(X1,mark(X2)) -> add(X1,X2)
r30: add(active(X1),X2) -> add(X1,X2)
r31: add(X1,active(X2)) -> add(X1,X2)
r32: len(mark(X)) -> len(X)
r33: len(active(X)) -> len(X)

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  weighted path order
  
    base order:
  
      matrix interpretations:
      
        carrier: N^2
        order: lexicographic order
        interpretations:
          len#_A(x1) = ((1,0),(1,0)) x1 + (2,2)
          active_A(x1) = ((1,0),(0,0)) x1 + (1,1)
  
    precedence:
    
      len# = active
    
    partial status:
  
      pi(len#) = []
      pi(active) = []

The next rules are strictly ordered:

  p1

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