YES We show the termination of the TRS R: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) Term_sub(Term_var(x),Id()) -> Term_var(x) Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) Sum_sub(xi,Id()) -> Sum_term_var(xi) Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) Concat(Id(),s) -> s -- SCC decomposition. Consider the dependency pair problem (P, R), where P consists of p1: Term_sub#(Case(m,xi,n),s) -> Frozen#(m,Sum_sub(xi,s),n,s) p2: Term_sub#(Case(m,xi,n),s) -> Sum_sub#(xi,s) p3: Frozen#(m,Sum_constant(Left()),n,s) -> Term_sub#(m,s) p4: Frozen#(m,Sum_constant(Right()),n,s) -> Term_sub#(n,s) p5: Frozen#(m,Sum_term_var(xi),n,s) -> Term_sub#(m,s) p6: Frozen#(m,Sum_term_var(xi),n,s) -> Term_sub#(n,s) p7: Term_sub#(Term_app(m,n),s) -> Term_sub#(m,s) p8: Term_sub#(Term_app(m,n),s) -> Term_sub#(n,s) p9: Term_sub#(Term_pair(m,n),s) -> Term_sub#(m,s) p10: Term_sub#(Term_pair(m,n),s) -> Term_sub#(n,s) p11: Term_sub#(Term_inl(m),s) -> Term_sub#(m,s) p12: Term_sub#(Term_inr(m),s) -> Term_sub#(m,s) p13: Term_sub#(Term_var(x),Cons_usual(y,m,s)) -> Term_sub#(Term_var(x),s) p14: Term_sub#(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub#(Term_var(x),s) p15: Term_sub#(Term_sub(m,s),t) -> Term_sub#(m,Concat(s,t)) p16: Term_sub#(Term_sub(m,s),t) -> Concat#(s,t) p17: Sum_sub#(xi,Cons_sum(psi,k,s)) -> Sum_sub#(xi,s) p18: Sum_sub#(xi,Cons_usual(y,m,s)) -> Sum_sub#(xi,s) p19: Concat#(Concat(s,t),u) -> Concat#(s,Concat(t,u)) p20: Concat#(Concat(s,t),u) -> Concat#(t,u) p21: Concat#(Cons_usual(x,m,s),t) -> Term_sub#(m,t) p22: Concat#(Cons_usual(x,m,s),t) -> Concat#(s,t) p23: Concat#(Cons_sum(xi,k,s),t) -> Concat#(s,t) and R consists of: r1: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) r2: Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) r3: Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) r4: Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) r5: Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) r6: Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) r7: Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) r8: Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) r9: Term_sub(Term_var(x),Id()) -> Term_var(x) r10: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m r11: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) r12: Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) r13: Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) r14: Sum_sub(xi,Id()) -> Sum_term_var(xi) r15: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) r16: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) r17: Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) r18: Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) r19: Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) r20: Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) r21: Concat(Id(),s) -> s The estimated dependency graph contains the following SCCs: {p1, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p15, p16, p19, p20, p21, p22, p23} {p17, p18} {p13, p14} -- Reduction pair. Consider the dependency pair problem (P, R), where P consists of p1: Term_sub#(Case(m,xi,n),s) -> Frozen#(m,Sum_sub(xi,s),n,s) p2: Frozen#(m,Sum_term_var(xi),n,s) -> Term_sub#(n,s) p3: Term_sub#(Term_sub(m,s),t) -> Concat#(s,t) p4: Concat#(Cons_sum(xi,k,s),t) -> Concat#(s,t) p5: Concat#(Cons_usual(x,m,s),t) -> Concat#(s,t) p6: Concat#(Cons_usual(x,m,s),t) -> Term_sub#(m,t) p7: Term_sub#(Term_sub(m,s),t) -> Term_sub#(m,Concat(s,t)) p8: Term_sub#(Term_inr(m),s) -> Term_sub#(m,s) p9: Term_sub#(Term_inl(m),s) -> Term_sub#(m,s) p10: Term_sub#(Term_pair(m,n),s) -> Term_sub#(n,s) p11: Term_sub#(Term_pair(m,n),s) -> Term_sub#(m,s) p12: Term_sub#(Term_app(m,n),s) -> Term_sub#(n,s) p13: Term_sub#(Term_app(m,n),s) -> Term_sub#(m,s) p14: Concat#(Concat(s,t),u) -> Concat#(t,u) p15: Concat#(Concat(s,t),u) -> Concat#(s,Concat(t,u)) p16: Frozen#(m,Sum_term_var(xi),n,s) -> Term_sub#(m,s) p17: Frozen#(m,Sum_constant(Right()),n,s) -> Term_sub#(n,s) p18: Frozen#(m,Sum_constant(Left()),n,s) -> Term_sub#(m,s) and R consists of: r1: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) r2: Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) r3: Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) r4: Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) r5: Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) r6: Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) r7: Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) r8: Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) r9: Term_sub(Term_var(x),Id()) -> Term_var(x) r10: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m r11: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) r12: Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) r13: Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) r14: Sum_sub(xi,Id()) -> Sum_term_var(xi) r15: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) r16: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) r17: Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) r18: Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) r19: Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) r20: Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) r21: Concat(Id(),s) -> s The set of usable rules consists of r9, r10, r14, r15, r16, r17 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: lexicographic combination of reduction triples: 1. marked-algebra reduction triple (>=A, >=A!, >A!): matrix interpretation with standard point-wise order: carrier: N^1 order: standard order interpretations: Term_sub#_A(x1,x2) = 0 Case_A(x1,x2,x3) = 1 Frozen#_A(x1,x2,x3,x4) = 0 Sum_sub_A(x1,x2) = 1 Sum_term_var_A(x1) = 1 Term_sub_A(x1,x2) = x1 + x2 + 1 Concat#_A(x1,x2) = 0 Cons_sum_A(x1,x2,x3) = 3 Cons_usual_A(x1,x2,x3) = x2 + 2 Concat_A(x1,x2) = 2 Term_inr_A(x1) = x1 + 1 Term_inl_A(x1) = x1 + 1 Term_pair_A(x1,x2) = x1 + 1 Term_app_A(x1,x2) = 1 Sum_constant_A(x1) = 1 Right_A() = 1 Left_A() = 1 Term_var_A(x1) = x1 + 1 Id_A() = 1 Term_sub#!_A(x1,x2) = 2 Case!_A(x1,x2,x3) = 4 Frozen#!_A(x1,x2,x3,x4) = 3 Sum_sub!_A(x1,x2) = 1 Sum_term_var!_A(x1) = 0 Term_sub!_A(x1,x2) = 6 Concat#!_A(x1,x2) = 2 Cons_sum!_A(x1,x2,x3) = 8 Cons_usual!_A(x1,x2,x3) = 0 Concat!_A(x1,x2) = 9 Term_inr!_A(x1) = x1 + 3 Term_inl!_A(x1) = x1 + 7 Term_pair!_A(x1,x2) = x2 + 3 Term_app!_A(x1,x2) = x1 + x2 + 7 Sum_constant!_A(x1) = 3 Right!_A() = 0 Left!_A() = 0 Term_var!_A(x1) = 7 Id!_A() = 0 2. marked-algebra reduction triple (>=A, >=A!, >A!): max/plus interpretation on natural numbers: Term_sub#_A(x1,x2) = max{6, x1 - 22} Case_A(x1,x2,x3) = max{21, x1 + 20, x2 - 14, x3 + 20} Frozen#_A(x1,x2,x3,x4) = max{6, x1 - 22, x3 - 22} Sum_sub_A(x1,x2) = max{x1 + 5, x2 - 7} Sum_term_var_A(x1) = max{0, x1 - 10} Term_sub_A(x1,x2) = max{x1 + 3, x2 + 20} Concat#_A(x1,x2) = max{6, x1 - 3} Cons_sum_A(x1,x2,x3) = max{6, x1 - 34, x2 - 34, x3 + 4} Cons_usual_A(x1,x2,x3) = max{x1 - 29, x2 - 13, x3 + 4} Concat_A(x1,x2) = max{10, x1 + 1, x2 + 1} Term_inr_A(x1) = max{24, x1 + 20} Term_inl_A(x1) = max{24, x1 + 20} Term_pair_A(x1,x2) = max{25, x1 + 21, x2 + 17} Term_app_A(x1,x2) = max{24, x1 + 20, x2 + 20} Sum_constant_A(x1) = max{0, x1 - 41} Right_A = 36 Left_A = 36 Term_var_A(x1) = max{27, x1 - 4} Id_A = 6 Term_sub#!_A(x1,x2) = max{21, x1 + 19} Case!_A(x1,x2,x3) = max{1, x1 - 32, x3 - 34} Frozen#!_A(x1,x2,x3,x4) = max{41, x1 + 20, x2 - 1, x3 + 40, x4 - 10} Sum_sub!_A(x1,x2) = 34 Sum_term_var!_A(x1) = 22 Term_sub!_A(x1,x2) = x2 + 6 Concat#!_A(x1,x2) = x1 + 33 Cons_sum!_A(x1,x2,x3) = max{x1 - 1, x2 + 5, x3 + 33} Cons_usual!_A(x1,x2,x3) = max{35, x1 - 1, x3 - 12} Concat!_A(x1,x2) = max{36, x1 - 7} Term_inr!_A(x1) = max{0, x1 - 21} Term_inl!_A(x1) = max{0, x1 - 21} Term_pair!_A(x1,x2) = max{7, x2 - 4} Term_app!_A(x1,x2) = max{30, x1 + 19, x2 + 20} Sum_constant!_A(x1) = max{1, x1 - 37} Right!_A = 3 Left!_A = 5 Term_var!_A(x1) = max{36, x1 - 1} Id!_A = 22 partial status: pi(Term_sub#) = [1] pi(Case) = [1, 2, 3] pi(Frozen#) = [1, 3] pi(Sum_sub) = [1, 2] pi(Sum_term_var) = [] pi(Term_sub) = [1, 2] pi(Concat#) = [1] pi(Cons_sum) = [3] pi(Cons_usual) = [2, 3] pi(Concat) = [1, 2] pi(Term_inr) = [1] pi(Term_inl) = [1] pi(Term_pair) = [1, 2] pi(Term_app) = [1, 2] pi(Sum_constant) = [] pi(Right) = [] pi(Left) = [] pi(Term_var) = [] pi(Id) = [] The following rules are removed: p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15, p16, p17, p18 Then no dependency pair remains. -- Reduction pair. Consider the dependency pair problem (P, R), where P consists of p1: Sum_sub#(xi,Cons_sum(psi,k,s)) -> Sum_sub#(xi,s) p2: Sum_sub#(xi,Cons_usual(y,m,s)) -> Sum_sub#(xi,s) and R consists of: r1: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) r2: Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) r3: Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) r4: Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) r5: Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) r6: Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) r7: Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) r8: Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) r9: Term_sub(Term_var(x),Id()) -> Term_var(x) r10: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m r11: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) r12: Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) r13: Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) r14: Sum_sub(xi,Id()) -> Sum_term_var(xi) r15: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) r16: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) r17: Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) r18: Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) r19: Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) r20: Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) r21: Concat(Id(),s) -> s The set of usable rules consists of (no rules) 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: lexicographic combination of reduction triples: 1. marked-algebra reduction triple (>=A, >=A!, >A!): matrix interpretation with standard point-wise order: carrier: N^1 order: standard order interpretations: Sum_sub#_A(x1,x2) = x2 Cons_sum_A(x1,x2,x3) = x3 + 4 Cons_usual_A(x1,x2,x3) = x3 + 4 Sum_sub#!_A(x1,x2) = 2 Cons_sum!_A(x1,x2,x3) = x3 + 1 Cons_usual!_A(x1,x2,x3) = 3 2. marked-algebra reduction triple (>=A, >=A!, >A!): max/plus interpretation on natural numbers: Sum_sub#_A(x1,x2) = 0 Cons_sum_A(x1,x2,x3) = max{7, x1 - 7, x2 - 7, x3 - 15} Cons_usual_A(x1,x2,x3) = max{7, x1 - 7, x2 - 7, x3 - 7} Sum_sub#!_A(x1,x2) = x1 + 10 Cons_sum!_A(x1,x2,x3) = max{8, x1 - 1, x2 - 30, x3 - 19} Cons_usual!_A(x1,x2,x3) = max{x1 + 5, x2 + 5, x3 + 5} partial status: pi(Sum_sub#) = [1, 2] pi(Cons_sum) = [1, 2, 3] pi(Cons_usual) = [3] The following rules are removed: p1 -- SCC decomposition. Consider the dependency pair problem (P, R), where P consists of p1: Sum_sub#(xi,Cons_usual(y,m,s)) -> Sum_sub#(xi,s) and R consists of: r1: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) r2: Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) r3: Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) r4: Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) r5: Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) r6: Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) r7: Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) r8: Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) r9: Term_sub(Term_var(x),Id()) -> Term_var(x) r10: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m r11: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) r12: Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) r13: Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) r14: Sum_sub(xi,Id()) -> Sum_term_var(xi) r15: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) r16: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) r17: Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) r18: Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) r19: Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) r20: Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) r21: Concat(Id(),s) -> s The estimated dependency graph contains the following SCCs: {p1} -- Reduction pair. Consider the dependency pair problem (P, R), where P consists of p1: Sum_sub#(xi,Cons_usual(y,m,s)) -> Sum_sub#(xi,s) and R consists of: r1: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) r2: Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) r3: Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) r4: Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) r5: Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) r6: Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) r7: Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) r8: Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) r9: Term_sub(Term_var(x),Id()) -> Term_var(x) r10: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m r11: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) r12: Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) r13: Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) r14: Sum_sub(xi,Id()) -> Sum_term_var(xi) r15: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) r16: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) r17: Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) r18: Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) r19: Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) r20: Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) r21: Concat(Id(),s) -> s The set of usable rules consists of (no rules) 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: lexicographic combination of reduction triples: 1. marked-algebra reduction triple (>=A, >=A!, >A!): matrix interpretation with standard point-wise order: carrier: N^1 order: standard order interpretations: Sum_sub#_A(x1,x2) = x2 Cons_usual_A(x1,x2,x3) = x3 + 1 Sum_sub#!_A(x1,x2) = x2 + 4 Cons_usual!_A(x1,x2,x3) = 3 2. marked-algebra reduction triple (>=A, >=A!, >A!): max/plus interpretation on natural numbers: Sum_sub#_A(x1,x2) = 0 Cons_usual_A(x1,x2,x3) = max{2, x1 - 29, x2 - 29, x3 - 29} Sum_sub#!_A(x1,x2) = max{6, x1 - 1, x2 - 3} Cons_usual!_A(x1,x2,x3) = max{x1 + 12, x2 + 10, x3 + 7} partial status: pi(Sum_sub#) = [2] pi(Cons_usual) = [3] 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: Term_sub#(Term_var(x),Cons_usual(y,m,s)) -> Term_sub#(Term_var(x),s) p2: Term_sub#(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub#(Term_var(x),s) and R consists of: r1: Term_sub(Case(m,xi,n),s) -> Frozen(m,Sum_sub(xi,s),n,s) r2: Frozen(m,Sum_constant(Left()),n,s) -> Term_sub(m,s) r3: Frozen(m,Sum_constant(Right()),n,s) -> Term_sub(n,s) r4: Frozen(m,Sum_term_var(xi),n,s) -> Case(Term_sub(m,s),xi,Term_sub(n,s)) r5: Term_sub(Term_app(m,n),s) -> Term_app(Term_sub(m,s),Term_sub(n,s)) r6: Term_sub(Term_pair(m,n),s) -> Term_pair(Term_sub(m,s),Term_sub(n,s)) r7: Term_sub(Term_inl(m),s) -> Term_inl(Term_sub(m,s)) r8: Term_sub(Term_inr(m),s) -> Term_inr(Term_sub(m,s)) r9: Term_sub(Term_var(x),Id()) -> Term_var(x) r10: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> m r11: Term_sub(Term_var(x),Cons_usual(y,m,s)) -> Term_sub(Term_var(x),s) r12: Term_sub(Term_var(x),Cons_sum(xi,k,s)) -> Term_sub(Term_var(x),s) r13: Term_sub(Term_sub(m,s),t) -> Term_sub(m,Concat(s,t)) r14: Sum_sub(xi,Id()) -> Sum_term_var(xi) r15: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_constant(k) r16: Sum_sub(xi,Cons_sum(psi,k,s)) -> Sum_sub(xi,s) r17: Sum_sub(xi,Cons_usual(y,m,s)) -> Sum_sub(xi,s) r18: Concat(Concat(s,t),u) -> Concat(s,Concat(t,u)) r19: Concat(Cons_usual(x,m,s),t) -> Cons_usual(x,Term_sub(m,t),Concat(s,t)) r20: Concat(Cons_sum(xi,k,s),t) -> Cons_sum(xi,k,Concat(s,t)) r21: Concat(Id(),s) -> s The set of usable rules consists of (no rules) 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: lexicographic combination of reduction triples: 1. marked-algebra reduction triple (>=A, >=A!, >A!): matrix interpretation with standard point-wise order: carrier: N^1 order: standard order interpretations: Term_sub#_A(x1,x2) = 0 Term_var_A(x1) = 1 Cons_usual_A(x1,x2,x3) = 3 Cons_sum_A(x1,x2,x3) = 3 Term_sub#!_A(x1,x2) = 1 Term_var!_A(x1) = x1 Cons_usual!_A(x1,x2,x3) = 3 Cons_sum!_A(x1,x2,x3) = 2 2. marked-algebra reduction triple (>=A, >=A!, >A!): max/plus interpretation on natural numbers: Term_sub#_A(x1,x2) = 0 Term_var_A(x1) = max{21, x1 - 46} Cons_usual_A(x1,x2,x3) = max{0, x1 - 49, x2 - 49, x3 - 49} Cons_sum_A(x1,x2,x3) = max{0, x1 - 49, x2 - 49, x3 - 49} Term_sub#!_A(x1,x2) = max{14, x1 - 74} Term_var!_A(x1) = max{13, x1 - 54} Cons_usual!_A(x1,x2,x3) = max{x1 + 1, x2 + 5, x3 + 7} Cons_sum!_A(x1,x2,x3) = max{x1 + 9, x2 - 52, x3 - 54} partial status: pi(Term_sub#) = [2] pi(Term_var) = [] pi(Cons_usual) = [2, 3] pi(Cons_sum) = [1, 3] The following rules are removed: p1, p2 Then no dependency pair remains.