YES We show the termination of the TRS R: app(id(),x) -> x app(add(),|0|()) -> id() app(app(add(),app(s(),x)),y) -> app(s(),app(app(add(),x),y)) app(app(map(),f),nil()) -> nil() app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) Instead we prove termination of the uncurried system: app(add_0(),y) -> add_1(y) app(add_1(x1),y) -> add_2(x1,y) app(cons_0(),y) -> cons_1(y) app(cons_1(x1),y) -> cons_2(x1,y) app(id_0(),y) -> id_1(y) app(map_0(),y) -> map_1(y) app(map_1(x1),y) -> map_2(x1,y) app(s_0(),y) -> s_1(y) id_1(x) -> x add_1(|0|_0()) -> id_0() add_2(|0|_0(),y1) -> id_1(y1) add_2(s_1(x),y) -> s_1(add_2(x,y)) map_2(f,nil_0()) -> nil_0() map_2(f,cons_2(x,xs)) -> cons_2(app(f,x),map_2(f,xs)) -- SCC decomposition. Consider the dependency pair problem (P, R), where P consists of p1: app#(add_0(),y) -> add_1#(y) p2: app#(add_1(x1),y) -> add_2#(x1,y) p3: app#(id_0(),y) -> id_1#(y) p4: app#(map_1(x1),y) -> map_2#(x1,y) p5: add_2#(|0|_0(),y1) -> id_1#(y1) p6: add_2#(s_1(x),y) -> add_2#(x,y) p7: map_2#(f,cons_2(x,xs)) -> app#(f,x) p8: map_2#(f,cons_2(x,xs)) -> map_2#(f,xs) and R consists of: r1: app(add_0(),y) -> add_1(y) r2: app(add_1(x1),y) -> add_2(x1,y) r3: app(cons_0(),y) -> cons_1(y) r4: app(cons_1(x1),y) -> cons_2(x1,y) r5: app(id_0(),y) -> id_1(y) r6: app(map_0(),y) -> map_1(y) r7: app(map_1(x1),y) -> map_2(x1,y) r8: app(s_0(),y) -> s_1(y) r9: id_1(x) -> x r10: add_1(|0|_0()) -> id_0() r11: add_2(|0|_0(),y1) -> id_1(y1) r12: add_2(s_1(x),y) -> s_1(add_2(x,y)) r13: map_2(f,nil_0()) -> nil_0() r14: map_2(f,cons_2(x,xs)) -> cons_2(app(f,x),map_2(f,xs)) The estimated dependency graph contains the following SCCs: {p4, p7, p8} {p6} -- Reduction pair. Consider the dependency pair problem (P, R), where P consists of p1: map_2#(f,cons_2(x,xs)) -> app#(f,x) p2: app#(map_1(x1),y) -> map_2#(x1,y) p3: map_2#(f,cons_2(x,xs)) -> map_2#(f,xs) and R consists of: r1: app(add_0(),y) -> add_1(y) r2: app(add_1(x1),y) -> add_2(x1,y) r3: app(cons_0(),y) -> cons_1(y) r4: app(cons_1(x1),y) -> cons_2(x1,y) r5: app(id_0(),y) -> id_1(y) r6: app(map_0(),y) -> map_1(y) r7: app(map_1(x1),y) -> map_2(x1,y) r8: app(s_0(),y) -> s_1(y) r9: id_1(x) -> x r10: add_1(|0|_0()) -> id_0() r11: add_2(|0|_0(),y1) -> id_1(y1) r12: add_2(s_1(x),y) -> s_1(add_2(x,y)) r13: map_2(f,nil_0()) -> nil_0() r14: map_2(f,cons_2(x,xs)) -> cons_2(app(f,x),map_2(f,xs)) The set of usable rules consists of r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14 Take the reduction pair: generalized weighted path order (>=MG, >G) base order 1: trivial reduction triple (T x T, T x T, Φ) base order 2: model-based reduction triple (=A, >=A!, >A!): finite algebra: carrier: {0,1} interpretations: map_2#_A(0,0) = 0 map_2#_A(0,1) = 0 map_2#_A(1,0) = 0 map_2#_A(1,1) = 0 cons_2_A(0,0) = 0 cons_2_A(0,1) = 0 cons_2_A(1,0) = 0 cons_2_A(1,1) = 0 app#_A(0,0) = 0 app#_A(0,1) = 0 app#_A(1,0) = 0 app#_A(1,1) = 0 map_1_A(0) = 0 map_1_A(1) = 1 app_A(0,0) = 0 app_A(0,1) = 0 app_A(1,0) = 0 app_A(1,1) = 1 add_0_A = 1 add_1_A(0) = 0 add_1_A(1) = 1 add_2_A(0,0) = 0 add_2_A(0,1) = 0 add_2_A(1,0) = 0 add_2_A(1,1) = 1 cons_0_A = 0 cons_1_A(0) = 0 cons_1_A(1) = 0 id_0_A = 1 id_1_A(0) = 0 id_1_A(1) = 1 map_0_A = 1 map_2_A(0,0) = 0 map_2_A(0,1) = 0 map_2_A(1,0) = 0 map_2_A(1,1) = 1 s_0_A = 0 s_1_A(0) = 0 s_1_A(1) = 0 |0|_0_A = 1 nil_0_A = 0 map_2#!_A(0,0) = 1 map_2#!_A(0,1) = 1 map_2#!_A(1,0) = 1 map_2#!_A(1,1) = 1 cons_2!_A(0,0) = 0 cons_2!_A(0,1) = 0 cons_2!_A(1,0) = 0 cons_2!_A(1,1) = 0 app#!_A(0,0) = 1 app#!_A(0,1) = 1 app#!_A(1,0) = 1 app#!_A(1,1) = 1 map_1!_A(0) = 0 map_1!_A(1) = 0 app!_A(0,0) = 1 app!_A(0,1) = 1 app!_A(1,0) = 1 app!_A(1,1) = 1 add_0!_A = 0 add_1!_A(0) = 1 add_1!_A(1) = 0 add_2!_A(0,0) = 0 add_2!_A(0,1) = 0 add_2!_A(1,0) = 0 add_2!_A(1,1) = 0 cons_0!_A = 0 cons_1!_A(0) = 0 cons_1!_A(1) = 0 id_0!_A = 0 id_1!_A(0) = 0 id_1!_A(1) = 0 map_0!_A = 0 map_2!_A(0,0) = 1 map_2!_A(0,1) = 1 map_2!_A(1,0) = 1 map_2!_A(1,1) = 0 s_0!_A = 1 s_1!_A(0) = 0 s_1!_A(1) = 0 |0|_0!_A = 0 nil_0!_A = 1 partial status: pi(map_2#) = [1] pi(cons_2) = [1] pi(app#) = [1] pi(map_1) = [1] pi(app) = [1, 2] pi(add_0) = [] pi(add_1) = [] pi(add_2) = [2] pi(cons_0) = [] pi(cons_1) = [1] pi(id_0) = [] pi(id_1) = [1] pi(map_0) = [] pi(map_2) = [1, 2] pi(s_0) = [] pi(s_1) = [] pi(|0|_0) = [] pi(nil_0) = [] The following rules are removed: p2 -- SCC decomposition. Consider the dependency pair problem (P, R), where P consists of p1: map_2#(f,cons_2(x,xs)) -> app#(f,x) p2: map_2#(f,cons_2(x,xs)) -> map_2#(f,xs) and R consists of: r1: app(add_0(),y) -> add_1(y) r2: app(add_1(x1),y) -> add_2(x1,y) r3: app(cons_0(),y) -> cons_1(y) r4: app(cons_1(x1),y) -> cons_2(x1,y) r5: app(id_0(),y) -> id_1(y) r6: app(map_0(),y) -> map_1(y) r7: app(map_1(x1),y) -> map_2(x1,y) r8: app(s_0(),y) -> s_1(y) r9: id_1(x) -> x r10: add_1(|0|_0()) -> id_0() r11: add_2(|0|_0(),y1) -> id_1(y1) r12: add_2(s_1(x),y) -> s_1(add_2(x,y)) r13: map_2(f,nil_0()) -> nil_0() r14: map_2(f,cons_2(x,xs)) -> cons_2(app(f,x),map_2(f,xs)) The estimated dependency graph contains the following SCCs: {p2} -- Reduction pair. Consider the dependency pair problem (P, R), where P consists of p1: map_2#(f,cons_2(x,xs)) -> map_2#(f,xs) and R consists of: r1: app(add_0(),y) -> add_1(y) r2: app(add_1(x1),y) -> add_2(x1,y) r3: app(cons_0(),y) -> cons_1(y) r4: app(cons_1(x1),y) -> cons_2(x1,y) r5: app(id_0(),y) -> id_1(y) r6: app(map_0(),y) -> map_1(y) r7: app(map_1(x1),y) -> map_2(x1,y) r8: app(s_0(),y) -> s_1(y) r9: id_1(x) -> x r10: add_1(|0|_0()) -> id_0() r11: add_2(|0|_0(),y1) -> id_1(y1) r12: add_2(s_1(x),y) -> s_1(add_2(x,y)) r13: map_2(f,nil_0()) -> nil_0() r14: map_2(f,cons_2(x,xs)) -> cons_2(app(f,x),map_2(f,xs)) The set of usable rules consists of r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14 Take the reduction pair: generalized weighted path order (>=MG, >G) base order 1: trivial reduction triple (T x T, T x T, Φ) base order 2: model-based reduction triple (=A, >=A!, >A!): finite algebra: carrier: {0,1} interpretations: map_2#_A(0,0) = 0 map_2#_A(0,1) = 0 map_2#_A(1,0) = 0 map_2#_A(1,1) = 0 cons_2_A(0,0) = 0 cons_2_A(0,1) = 1 cons_2_A(1,0) = 0 cons_2_A(1,1) = 1 app_A(0,0) = 0 app_A(0,1) = 1 app_A(1,0) = 0 app_A(1,1) = 0 add_0_A = 0 add_1_A(0) = 0 add_1_A(1) = 1 add_2_A(0,0) = 0 add_2_A(0,1) = 1 add_2_A(1,0) = 0 add_2_A(1,1) = 0 cons_0_A = 1 cons_1_A(0) = 0 cons_1_A(1) = 0 id_0_A = 0 id_1_A(0) = 0 id_1_A(1) = 1 map_0_A = 1 map_1_A(0) = 0 map_1_A(1) = 0 map_2_A(0,0) = 0 map_2_A(0,1) = 1 map_2_A(1,0) = 0 map_2_A(1,1) = 1 s_0_A = 0 s_1_A(0) = 0 s_1_A(1) = 1 |0|_0_A = 0 nil_0_A = 0 map_2#!_A(0,0) = 0 map_2#!_A(0,1) = 0 map_2#!_A(1,0) = 0 map_2#!_A(1,1) = 0 cons_2!_A(0,0) = 0 cons_2!_A(0,1) = 0 cons_2!_A(1,0) = 0 cons_2!_A(1,1) = 0 app!_A(0,0) = 1 app!_A(0,1) = 0 app!_A(1,0) = 1 app!_A(1,1) = 1 add_0!_A = 0 add_1!_A(0) = 0 add_1!_A(1) = 0 add_2!_A(0,0) = 1 add_2!_A(0,1) = 0 add_2!_A(1,0) = 1 add_2!_A(1,1) = 1 cons_0!_A = 0 cons_1!_A(0) = 1 cons_1!_A(1) = 1 id_0!_A = 0 id_1!_A(0) = 0 id_1!_A(1) = 0 map_0!_A = 0 map_1!_A(0) = 0 map_1!_A(1) = 1 map_2!_A(0,0) = 0 map_2!_A(0,1) = 0 map_2!_A(1,0) = 0 map_2!_A(1,1) = 0 s_0!_A = 0 s_1!_A(0) = 0 s_1!_A(1) = 0 |0|_0!_A = 1 nil_0!_A = 0 partial status: pi(map_2#) = [2] pi(cons_2) = [2] pi(app) = [2] pi(add_0) = [] pi(add_1) = [1] pi(add_2) = [2] pi(cons_0) = [] pi(cons_1) = [] pi(id_0) = [] pi(id_1) = [1] pi(map_0) = [] pi(map_1) = [] pi(map_2) = [2] pi(s_0) = [] pi(s_1) = [] pi(|0|_0) = [] 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: add_2#(s_1(x),y) -> add_2#(x,y) and R consists of: r1: app(add_0(),y) -> add_1(y) r2: app(add_1(x1),y) -> add_2(x1,y) r3: app(cons_0(),y) -> cons_1(y) r4: app(cons_1(x1),y) -> cons_2(x1,y) r5: app(id_0(),y) -> id_1(y) r6: app(map_0(),y) -> map_1(y) r7: app(map_1(x1),y) -> map_2(x1,y) r8: app(s_0(),y) -> s_1(y) r9: id_1(x) -> x r10: add_1(|0|_0()) -> id_0() r11: add_2(|0|_0(),y1) -> id_1(y1) r12: add_2(s_1(x),y) -> s_1(add_2(x,y)) r13: map_2(f,nil_0()) -> nil_0() r14: map_2(f,cons_2(x,xs)) -> cons_2(app(f,x),map_2(f,xs)) The set of usable rules consists of r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14 Take the reduction pair: generalized weighted path order (>=MG, >G) base order 1: trivial reduction triple (T x T, T x T, Φ) base order 2: model-based reduction triple (=A, >=A!, >A!): finite algebra: carrier: {0,1} interpretations: add_2#_A(0,0) = 0 add_2#_A(0,1) = 0 add_2#_A(1,0) = 0 add_2#_A(1,1) = 0 s_1_A(0) = 0 s_1_A(1) = 1 app_A(0,0) = 0 app_A(0,1) = 1 app_A(1,0) = 0 app_A(1,1) = 0 add_0_A = 0 add_1_A(0) = 0 add_1_A(1) = 1 add_2_A(0,0) = 0 add_2_A(0,1) = 1 add_2_A(1,0) = 0 add_2_A(1,1) = 0 cons_0_A = 1 cons_1_A(0) = 0 cons_1_A(1) = 0 cons_2_A(0,0) = 0 cons_2_A(0,1) = 1 cons_2_A(1,0) = 0 cons_2_A(1,1) = 1 id_0_A = 0 id_1_A(0) = 0 id_1_A(1) = 1 map_0_A = 1 map_1_A(0) = 0 map_1_A(1) = 0 map_2_A(0,0) = 0 map_2_A(0,1) = 1 map_2_A(1,0) = 0 map_2_A(1,1) = 1 s_0_A = 0 |0|_0_A = 0 nil_0_A = 0 add_2#!_A(0,0) = 0 add_2#!_A(0,1) = 0 add_2#!_A(1,0) = 0 add_2#!_A(1,1) = 0 s_1!_A(0) = 0 s_1!_A(1) = 0 app!_A(0,0) = 1 app!_A(0,1) = 1 app!_A(1,0) = 1 app!_A(1,1) = 1 add_0!_A = 1 add_1!_A(0) = 0 add_1!_A(1) = 0 add_2!_A(0,0) = 1 add_2!_A(0,1) = 1 add_2!_A(1,0) = 1 add_2!_A(1,1) = 1 cons_0!_A = 1 cons_1!_A(0) = 1 cons_1!_A(1) = 0 cons_2!_A(0,0) = 1 cons_2!_A(0,1) = 1 cons_2!_A(1,0) = 0 cons_2!_A(1,1) = 0 id_0!_A = 0 id_1!_A(0) = 0 id_1!_A(1) = 0 map_0!_A = 1 map_1!_A(0) = 0 map_1!_A(1) = 0 map_2!_A(0,0) = 1 map_2!_A(0,1) = 1 map_2!_A(1,0) = 1 map_2!_A(1,1) = 1 s_0!_A = 1 |0|_0!_A = 1 nil_0!_A = 1 partial status: pi(add_2#) = [1] pi(s_1) = [1] pi(app) = [1, 2] pi(add_0) = [] pi(add_1) = [1] pi(add_2) = [1, 2] pi(cons_0) = [] pi(cons_1) = [] pi(cons_2) = [] pi(id_0) = [] pi(id_1) = [1] pi(map_0) = [] pi(map_1) = [1] pi(map_2) = [1, 2] pi(s_0) = [] pi(|0|_0) = [] pi(nil_0) = [] The following rules are removed: p1 Then no dependency pair remains.