YES
We show the termination of the TRS R:

  app(f(),app(g(),x)) -> app(g(),app(f(),app(f(),x)))
  app(f(),app(h(),x)) -> app(h(),app(g(),x))
  app(app(map(),|fun|),nil()) -> nil()
  app(app(map(),|fun|),app(app(cons(),x),xs)) -> app(app(cons(),app(|fun|,x)),app(app(map(),|fun|),xs))
  app(app(filter(),|fun|),nil()) -> nil()
  app(app(filter(),|fun|),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(|fun|,x)),|fun|),x),xs)
  app(app(app(app(filter2(),true()),|fun|),x),xs) -> app(app(cons(),x),app(app(filter(),|fun|),xs))
  app(app(app(app(filter2(),false()),|fun|),x),xs) -> app(app(filter(),|fun|),xs)

Instead we prove termination of the uncurried system:

  app(cons_0(),y) -> cons_1(y)
  app(cons_1(x1),y) -> cons_2(x1,y)
  app(f_0(),y) -> f_1(y)
  app(filter_0(),y) -> filter_1(y)
  app(filter_1(x1),y) -> filter_2(x1,y)
  app(filter2_0(),y) -> filter2_1(y)
  app(filter2_1(x1),y) -> filter2_2(x1,y)
  app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
  app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
  app(g_0(),y) -> g_1(y)
  app(h_0(),y) -> h_1(y)
  app(map_0(),y) -> map_1(y)
  app(map_1(x1),y) -> map_2(x1,y)
  f_1(g_1(x)) -> g_1(f_1(f_1(x)))
  f_1(h_1(x)) -> h_1(g_1(x))
  map_2(|fun|,nil_0()) -> nil_0()
  map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
  filter_2(|fun|,nil_0()) -> nil_0()
  filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
  filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
  filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)


-- SCC decomposition.

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

p1: app#(f_0(),y) -> f_1#(y)
p2: app#(filter_1(x1),y) -> filter_2#(x1,y)
p3: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p4: app#(map_1(x1),y) -> map_2#(x1,y)
p5: f_1#(g_1(x)) -> f_1#(f_1(x))
p6: f_1#(g_1(x)) -> f_1#(x)
p7: map_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p8: map_2#(|fun|,cons_2(x,xs)) -> map_2#(|fun|,xs)
p9: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p10: filter_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p11: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p12: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The estimated dependency graph contains the following SCCs:

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


-- Reduction pair.

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

p1: map_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p2: app#(map_1(x1),y) -> map_2#(x1,y)
p3: map_2#(|fun|,cons_2(x,xs)) -> map_2#(|fun|,xs)
p4: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p5: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p6: filter_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p7: app#(filter_1(x1),y) -> filter_2#(x1,y)
p8: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p9: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r1, r7, r10, r11, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        map_2#_A(x1,x2) = x1 + 9
        cons_2_A(x1,x2) = max{11, x1 - 11, x2 + 9}
        app#_A(x1,x2) = max{7, x1 + 6}
        map_1_A(x1) = x1 + 10
        filter2_3_A(x1,x2,x3) = max{35, x1 - 2, x2 + 8, x3 - 2}
        filter2_4#_A(x1,x2,x3,x4) = x2 + 7
        false_0_A = 3
        filter_2#_A(x1,x2) = x1 + 7
        filter_1_A(x1) = max{10, x1 + 7}
        app_A(x1,x2) = max{10, x1 - 36, x2 - 36}
        true_0_A = 1
        cons_0_A = 35
        cons_1_A(x1) = max{1, x1 - 37}
        filter2_1_A(x1) = x1 + 70
        filter2_2_A(x1,x2) = max{x1 + 34, x2 - 36}
        g_0_A = 1
        g_1_A(x1) = max{2, x1 - 77}
        h_0_A = 1
        h_1_A(x1) = max{2, x1 - 37}
        filter_2_A(x1,x2) = max{11, x1 - 28, x2 - 24}
        nil_0_A = 0
  
    base order 2:
  
      precedence:
      
        cons_2 > filter_2 > false_0 = app = nil_0 > map_1 = filter2_3 = filter_1 = true_0 = cons_1 > map_2# = filter2_4# = filter_2# = cons_0 = filter2_2 = h_1 > app# = filter2_1 = g_1 = h_0 > g_0
      
  
    partial status:
  
      pi(map_2#) = [1]
      pi(cons_2) = [2]
      pi(app#) = [1]
      pi(map_1) = []
      pi(filter2_3) = []
      pi(filter2_4#) = []
      pi(false_0) = []
      pi(filter_2#) = []
      pi(filter_1) = []
      pi(app) = []
      pi(true_0) = []
      pi(cons_0) = []
      pi(cons_1) = []
      pi(filter2_1) = [1]
      pi(filter2_2) = [1]
      pi(g_0) = []
      pi(g_1) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p7



-- SCC decomposition.

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

p1: map_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p2: app#(map_1(x1),y) -> map_2#(x1,y)
p3: map_2#(|fun|,cons_2(x,xs)) -> map_2#(|fun|,xs)
p4: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p5: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p6: filter_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p7: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p8: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

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: map_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p2: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p3: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p4: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p5: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p6: filter_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p7: app#(map_1(x1),y) -> map_2#(x1,y)
p8: map_2#(|fun|,cons_2(x,xs)) -> map_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r1, r2, r4, r6, r7, r10, r11, r12, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        map_2#_A(x1,x2) = x1 + 7
        cons_2_A(x1,x2) = max{14, x1 - 34, x2 - 17}
        app#_A(x1,x2) = max{5, x1 - 1}
        filter2_3_A(x1,x2,x3) = max{x1 + 2, x2 + 8, x3 + 2}
        filter2_4#_A(x1,x2,x3,x4) = x2 + 6
        true_0_A = 11
        filter_2#_A(x1,x2) = x1 + 6
        app_A(x1,x2) = max{33, x1, x2 + 10}
        false_0_A = 11
        map_1_A(x1) = max{11, x1 + 9}
        cons_0_A = 0
        cons_1_A(x1) = max{0, x1 - 1}
        filter_0_A = 0
        filter_1_A(x1) = max{0, x1 - 1}
        filter2_0_A = 1
        filter2_1_A(x1) = max{0, x1 - 1}
        filter2_2_A(x1,x2) = max{0, x1 - 1}
        g_0_A = 0
        g_1_A(x1) = max{11, x1 - 37}
        h_0_A = 0
        h_1_A(x1) = max{23, x1 - 12}
        map_0_A = 0
        filter_2_A(x1,x2) = max{12, x1 - 68, x2 - 19}
        nil_0_A = 0
  
    base order 2:
  
      precedence:
      
        cons_2 = filter_2 > app = filter2_0 = nil_0 > map_1 = filter2_1 > map_2# = h_1 > app# = false_0 = g_1 > filter2_4# = filter_2# > filter2_3 = true_0 = cons_1 = filter_1 = g_0 = h_0 = map_0 > cons_0 = filter_0 = filter2_2
      
  
    partial status:
  
      pi(map_2#) = [1]
      pi(cons_2) = []
      pi(app#) = []
      pi(filter2_3) = [2, 3]
      pi(filter2_4#) = [2]
      pi(true_0) = []
      pi(filter_2#) = [1]
      pi(app) = [1]
      pi(false_0) = []
      pi(map_1) = [1]
      pi(cons_0) = []
      pi(cons_1) = []
      pi(filter_0) = []
      pi(filter_1) = []
      pi(filter2_0) = []
      pi(filter2_1) = []
      pi(filter2_2) = []
      pi(g_0) = []
      pi(g_1) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(map_0) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p7



-- SCC decomposition.

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

p1: map_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p2: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p3: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p4: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p5: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p6: filter_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p7: map_2#(|fun|,cons_2(x,xs)) -> map_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The estimated dependency graph contains the following SCCs:

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


-- Reduction pair.

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

p1: map_2#(|fun|,cons_2(x,xs)) -> map_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r1, r4, r6, r7, r8, r10, r11, r12, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        map_2#_A(x1,x2) = max{x1 + 3, x2 + 36}
        cons_2_A(x1,x2) = max{x1 - 33, x2 + 3}
        app_A(x1,x2) = max{8, x1 - 9, x2 - 1}
        cons_0_A = 1
        cons_1_A(x1) = max{2, x1 - 33}
        filter_0_A = 1
        filter_1_A(x1) = max{2, x1 - 31}
        filter2_0_A = 1
        filter2_1_A(x1) = max{7, x1 - 2}
        filter2_2_A(x1,x2) = max{8, x1 - 11, x2 - 1}
        filter2_3_A(x1,x2,x3) = max{8, x1 - 21, x2 - 10, x3 - 1}
        g_0_A = 4
        g_1_A(x1) = max{5, x1 - 17}
        h_0_A = 5
        h_1_A(x1) = max{6, x1 - 8}
        map_0_A = 5
        map_1_A(x1) = max{6, x1 - 33}
        filter_2_A(x1,x2) = max{3, x1 - 41, x2 - 27}
        nil_0_A = 2
  
    base order 2:
  
      precedence:
      
        app > map_2# = cons_2 = filter2_3 = h_1 = filter_2 > cons_1 = filter_1 = filter2_2 = g_1 = h_0 = map_1 = nil_0 > cons_0 = filter_0 = filter2_1 = g_0 = map_0 > filter2_0
      
  
    partial status:
  
      pi(map_2#) = [2]
      pi(cons_2) = [2]
      pi(app) = []
      pi(cons_0) = []
      pi(cons_1) = []
      pi(filter_0) = []
      pi(filter_1) = []
      pi(filter2_0) = []
      pi(filter2_1) = []
      pi(filter2_2) = []
      pi(filter2_3) = []
      pi(g_0) = []
      pi(g_1) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(map_0) = []
      pi(map_1) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

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

p1: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p2: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p3: filter_2#(|fun|,cons_2(x,xs)) -> app#(|fun|,x)
p4: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p5: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r1, r2, r4, r6, r7, r8, r10, r11, r12, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        app#_A(x1,x2) = max{30, x1 + 2}
        filter2_3_A(x1,x2,x3) = max{98, x1 + 30, x2 + 34, x3 - 1}
        filter2_4#_A(x1,x2,x3,x4) = x2 + 33
        false_0_A = 1
        filter_2#_A(x1,x2) = x1 + 33
        cons_2_A(x1,x2) = max{29, x1 - 37, x2 - 83}
        app_A(x1,x2) = max{x1 + 36, x2}
        true_0_A = 1
        cons_0_A = 1
        cons_1_A(x1) = max{2, x1 - 38}
        filter_0_A = 1
        filter_1_A(x1) = max{2, x1 - 62}
        filter2_0_A = 1
        filter2_1_A(x1) = max{26, x1 - 42}
        filter2_2_A(x1,x2) = max{62, x1 - 6, x2 - 1}
        g_0_A = 1
        g_1_A(x1) = max{28, x1 - 61}
        h_0_A = 1
        h_1_A(x1) = max{26, x1 - 31}
        map_0_A = 1
        map_1_A(x1) = 2
        filter_2_A(x1,x2) = max{24, x1 - 61, x2 - 3}
        nil_0_A = 2
  
    base order 2:
  
      precedence:
      
        cons_2 = app > filter2_3 = cons_1 = map_1 = filter_2 > false_0 = true_0 = cons_0 = filter_1 = filter2_1 = filter2_2 = g_1 = map_0 = nil_0 > filter2_4# = filter_2# = filter_0 = filter2_0 = g_0 = h_1 > app# = h_0
      
  
    partial status:
  
      pi(app#) = [1]
      pi(filter2_3) = []
      pi(filter2_4#) = []
      pi(false_0) = []
      pi(filter_2#) = []
      pi(cons_2) = []
      pi(app) = [2]
      pi(true_0) = []
      pi(cons_0) = []
      pi(cons_1) = []
      pi(filter_0) = []
      pi(filter_1) = []
      pi(filter2_0) = []
      pi(filter2_1) = []
      pi(filter2_2) = []
      pi(g_0) = []
      pi(g_1) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(map_0) = []
      pi(map_1) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p3



-- SCC decomposition.

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

p1: app#(filter2_3(x1,x2,x3),y) -> filter2_4#(x1,x2,x3,y)
p2: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p3: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p4: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The estimated dependency graph contains the following SCCs:

  {p2, p3, p4}


-- Reduction pair.

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

p1: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p2: filter_2#(|fun|,cons_2(x,xs)) -> filter2_4#(app(|fun|,x),|fun|,x,xs)
p3: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r10, r11, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        filter2_4#_A(x1,x2,x3,x4) = max{x3 + 42, x4 + 14}
        false_0_A = 1
        filter_2#_A(x1,x2) = x2 + 13
        cons_2_A(x1,x2) = max{62, x1 + 42, x2 + 15}
        app_A(x1,x2) = max{60, x2 + 16}
        true_0_A = 1
        g_0_A = 40
        g_1_A(x1) = max{60, x1 + 16}
        h_0_A = 40
        h_1_A(x1) = max{44, x1 - 29}
        filter_2_A(x1,x2) = max{0, x1 - 17, x2 - 63}
        nil_0_A = 0
  
    base order 2:
  
      precedence:
      
        cons_2 > filter2_4# > filter_2# > false_0 > app = g_1 = h_0 = filter_2 > true_0 = g_0 = h_1 = nil_0
      
  
    partial status:
  
      pi(filter2_4#) = []
      pi(false_0) = []
      pi(filter_2#) = [2]
      pi(cons_2) = [1, 2]
      pi(app) = []
      pi(true_0) = []
      pi(g_0) = []
      pi(g_1) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p2



-- SCC decomposition.

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

p1: filter2_4#(false_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)
p2: filter2_4#(true_0(),|fun|,x,xs) -> filter_2#(|fun|,xs)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The estimated dependency graph contains the following SCCs:

  (no SCCs)

-- Reduction pair.

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

p1: f_1#(g_1(x)) -> f_1#(f_1(x))
p2: f_1#(g_1(x)) -> f_1#(x)

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r1, r2, r4, r6, r7, r8, r11, r12, r14, r15, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        f_1#_A(x1) = max{6, x1 + 4}
        g_1_A(x1) = max{12, x1 + 5}
        f_1_A(x1) = max{7, x1}
        app_A(x1,x2) = max{13, x1 - 14, x2 - 5}
        cons_0_A = 1
        cons_1_A(x1) = max{2, x1 - 6}
        cons_2_A(x1,x2) = max{3, x1 - 21, x2 - 7}
        filter_0_A = 1
        filter_1_A(x1) = max{2, x1 - 50}
        filter2_0_A = 13
        filter2_1_A(x1) = max{11, x1 - 6}
        filter2_2_A(x1,x2) = max{12, x1 - 21, x2 - 6}
        filter2_3_A(x1,x2,x3) = max{13, x1 - 35, x2 - 20, x3 - 5}
        h_0_A = 13
        h_1_A(x1) = 0
        map_0_A = 4
        map_1_A(x1) = max{5, x1 - 21}
        filter_2_A(x1,x2) = max{3, x1 - 65, x2 - 41}
        nil_0_A = 0
  
    base order 2:
  
      precedence:
      
        g_1 = f_1 = filter_2 = nil_0 > f_1# = app = filter_0 = h_0 > cons_0 = filter_1 = filter2_3 = h_1 > cons_2 = filter2_2 = map_1 > cons_1 = filter2_1 = map_0 > filter2_0
      
  
    partial status:
  
      pi(f_1#) = [1]
      pi(g_1) = [1]
      pi(f_1) = [1]
      pi(app) = []
      pi(cons_0) = []
      pi(cons_1) = []
      pi(cons_2) = []
      pi(filter_0) = []
      pi(filter_1) = []
      pi(filter2_0) = []
      pi(filter2_1) = []
      pi(filter2_2) = []
      pi(filter2_3) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(map_0) = []
      pi(map_1) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p2



-- SCC decomposition.

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

p1: f_1#(g_1(x)) -> f_1#(f_1(x))

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

p1: f_1#(g_1(x)) -> f_1#(f_1(x))

and R consists of:

r1: app(cons_0(),y) -> cons_1(y)
r2: app(cons_1(x1),y) -> cons_2(x1,y)
r3: app(f_0(),y) -> f_1(y)
r4: app(filter_0(),y) -> filter_1(y)
r5: app(filter_1(x1),y) -> filter_2(x1,y)
r6: app(filter2_0(),y) -> filter2_1(y)
r7: app(filter2_1(x1),y) -> filter2_2(x1,y)
r8: app(filter2_2(x1,x2),y) -> filter2_3(x1,x2,y)
r9: app(filter2_3(x1,x2,x3),y) -> filter2_4(x1,x2,x3,y)
r10: app(g_0(),y) -> g_1(y)
r11: app(h_0(),y) -> h_1(y)
r12: app(map_0(),y) -> map_1(y)
r13: app(map_1(x1),y) -> map_2(x1,y)
r14: f_1(g_1(x)) -> g_1(f_1(f_1(x)))
r15: f_1(h_1(x)) -> h_1(g_1(x))
r16: map_2(|fun|,nil_0()) -> nil_0()
r17: map_2(|fun|,cons_2(x,xs)) -> cons_2(app(|fun|,x),map_2(|fun|,xs))
r18: filter_2(|fun|,nil_0()) -> nil_0()
r19: filter_2(|fun|,cons_2(x,xs)) -> filter2_4(app(|fun|,x),|fun|,x,xs)
r20: filter2_4(true_0(),|fun|,x,xs) -> cons_2(x,filter_2(|fun|,xs))
r21: filter2_4(false_0(),|fun|,x,xs) -> filter_2(|fun|,xs)

The set of usable rules consists of

  r2, r4, r6, r7, r11, r12, r14, r15, r18

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        f_1#_A(x1) = x1 + 21
        g_1_A(x1) = x1 + 22
        f_1_A(x1) = x1
        app_A(x1,x2) = max{6, x1 - 9, x2 - 22}
        cons_1_A(x1) = max{7, x1 + 4}
        cons_2_A(x1,x2) = max{5, x1 - 7, x2 - 23}
        filter_0_A = 4
        filter_1_A(x1) = max{5, x1 - 23}
        filter2_0_A = 3
        filter2_1_A(x1) = max{4, x1 - 23}
        filter2_2_A(x1,x2) = max{5, x1 - 32, x2 - 22}
        h_0_A = 0
        h_1_A(x1) = 0
        map_0_A = 1
        map_1_A(x1) = max{5, x1 - 23}
        filter_2_A(x1,x2) = max{8, x1 - 7, x2 - 13}
        nil_0_A = 0
  
    base order 2:
  
      precedence:
      
        g_1 > f_1# = cons_2 > f_1 = filter_2 > app = cons_1 = filter_0 = nil_0 > filter_1 = filter2_2 = h_1 = map_1 > filter2_1 = h_0 = map_0 > filter2_0
      
  
    partial status:
  
      pi(f_1#) = []
      pi(g_1) = []
      pi(f_1) = [1]
      pi(app) = []
      pi(cons_1) = []
      pi(cons_2) = []
      pi(filter_0) = []
      pi(filter_1) = []
      pi(filter2_0) = []
      pi(filter2_1) = []
      pi(filter2_2) = []
      pi(h_0) = []
      pi(h_1) = []
      pi(map_0) = []
      pi(map_1) = []
      pi(filter_2) = []
      pi(nil_0) = []

The following rules are removed:

  p1

Then no dependency pair remains.