We consider the system Applicative_first_order_05__#3.13. Alphabet: 0 : [] --> a cons : [d * e] --> e edge : [a * a * b] --> b empty : [] --> b eq : [a * a] --> c false : [] --> c filter : [d -> c * e] --> e filter2 : [c * d -> c * d * e] --> e if!fac6220reach!fac62201 : [c * a * a * b * b] --> c if!fac6220reach!fac62202 : [c * a * a * b * b] --> c map : [d -> d * e] --> e nil : [] --> e or : [c * c] --> c reach : [a * a * b * b] --> c s : [a] --> a true : [] --> c union : [b * b] --> b Rules: eq(0, 0) => true eq(0, s(x)) => false eq(s(x), 0) => false eq(s(x), s(y)) => eq(x, y) or(true, x) => true or(false, x) => x union(empty, x) => x union(edge(x, y, z), u) => edge(x, y, union(z, u)) reach(x, y, empty, z) => false reach(x, y, edge(z, u, v), w) => if!fac6220reach!fac62201(eq(x, z), x, y, edge(z, u, v), w) if!fac6220reach!fac62201(true, x, y, edge(z, u, v), w) => if!fac6220reach!fac62202(eq(y, u), x, y, edge(z, u, v), w) if!fac6220reach!fac62201(false, x, y, edge(z, u, v), w) => reach(x, y, v, edge(z, u, w)) if!fac6220reach!fac62202(true, x, y, edge(z, u, v), w) => true if!fac6220reach!fac62202(false, x, y, edge(z, u, v), w) => or(reach(x, y, v, w), reach(u, y, union(v, w), empty)) map(f, nil) => nil map(f, cons(x, y)) => cons(f x, map(f, y)) filter(f, nil) => nil filter(f, cons(x, y)) => filter2(f x, f, x, y) filter2(true, f, x, y) => cons(x, filter(f, y)) filter2(false, f, x, y) => filter(f, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). We use the dependency pair framework as described in [Kop12, Ch. 6/7], with dynamic dependency pairs. After applying [Kop12, Thm. 7.22] to denote collapsing dependency pairs in an extended form, we thus obtain the following dependency pair problem (P_0, R_0, minimal, formative): Dependency Pairs P_0: 0] eq#(s(X), s(Y)) =#> eq#(X, Y) 1] union#(edge(X, Y, Z), U) =#> union#(Z, U) 2] reach#(X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W) 3] reach#(X, Y, edge(Z, U, V), W) =#> eq#(X, Z) 4] if!fac6220reach!fac62201#(true, X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62202#(eq(Y, U), X, Y, edge(Z, U, V), W) 5] if!fac6220reach!fac62201#(true, X, Y, edge(Z, U, V), W) =#> eq#(Y, U) 6] if!fac6220reach!fac62201#(false, X, Y, edge(Z, U, V), W) =#> reach#(X, Y, V, edge(Z, U, W)) 7] if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) =#> or#(reach(X, Y, V, W), reach(U, Y, union(V, W), empty)) 8] if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) =#> reach#(X, Y, V, W) 9] if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) =#> reach#(U, Y, union(V, W), empty) 10] if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) =#> union#(V, W) 11] map#(F, cons(X, Y)) =#> F(X) 12] map#(F, cons(X, Y)) =#> map#(F, Y) 13] filter#(F, cons(X, Y)) =#> filter2#(F X, F, X, Y) 14] filter#(F, cons(X, Y)) =#> F(X) 15] filter2#(true, F, X, Y) =#> filter#(F, Y) 16] filter2#(false, F, X, Y) =#> filter#(F, Y) Rules R_0: eq(0, 0) => true eq(0, s(X)) => false eq(s(X), 0) => false eq(s(X), s(Y)) => eq(X, Y) or(true, X) => true or(false, X) => X union(empty, X) => X union(edge(X, Y, Z), U) => edge(X, Y, union(Z, U)) reach(X, Y, empty, Z) => false reach(X, Y, edge(Z, U, V), W) => if!fac6220reach!fac62201(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(true, X, Y, edge(Z, U, V), W) => if!fac6220reach!fac62202(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(false, X, Y, edge(Z, U, V), W) => reach(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202(true, X, Y, edge(Z, U, V), W) => true if!fac6220reach!fac62202(false, X, Y, edge(Z, U, V), W) => or(reach(X, Y, V, W), reach(U, Y, union(V, W), empty)) map(F, nil) => nil map(F, cons(X, Y)) => cons(F X, map(F, Y)) filter(F, nil) => nil filter(F, cons(X, Y)) => filter2(F X, F, X, Y) filter2(true, F, X, Y) => cons(X, filter(F, Y)) filter2(false, F, X, Y) => filter(F, Y) Thus, the original system is terminating if (P_0, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_0, R_0, minimal, formative). We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : 0 * 1 : 1 * 2 : 4, 5, 6 * 3 : 0 * 4 : 7, 8, 9, 10 * 5 : 0 * 6 : 2, 3 * 7 : * 8 : 2, 3 * 9 : 2, 3 * 10 : 1 * 11 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 * 12 : 11, 12 * 13 : 15, 16 * 14 : 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 * 15 : 13, 14 * 16 : 13, 14 This graph has the following strongly connected components: P_1: eq#(s(X), s(Y)) =#> eq#(X, Y) P_2: union#(edge(X, Y, Z), U) =#> union#(Z, U) P_3: reach#(X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(true, X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62202#(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(false, X, Y, edge(Z, U, V), W) =#> reach#(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) =#> reach#(X, Y, V, W) if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) =#> reach#(U, Y, union(V, W), empty) P_4: map#(F, cons(X, Y)) =#> F(X) map#(F, cons(X, Y)) =#> map#(F, Y) filter#(F, cons(X, Y)) =#> filter2#(F X, F, X, Y) filter#(F, cons(X, Y)) =#> F(X) filter2#(true, F, X, Y) =#> filter#(F, Y) filter2#(false, F, X, Y) =#> filter#(F, Y) By [Kop12, Thm. 7.31], we may replace any dependency pair problem (P_0, R_0, m, f) by (P_1, R_0, m, f), (P_2, R_0, m, f), (P_3, R_0, m, f) and (P_4, R_0, m, f). Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative), (P_3, R_0, minimal, formative) and (P_4, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_4, R_0, minimal, formative). The formative rules of (P_4, R_0) are R_1 ::= eq(0, 0) => true eq(0, s(X)) => false eq(s(X), 0) => false eq(s(X), s(Y)) => eq(X, Y) or(true, X) => true or(false, X) => X union(empty, X) => X union(edge(X, Y, Z), U) => edge(X, Y, union(Z, U)) reach(X, Y, empty, Z) => false reach(X, Y, edge(Z, U, V), W) => if!fac6220reach!fac62201(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(true, X, Y, edge(Z, U, V), W) => if!fac6220reach!fac62202(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(false, X, Y, edge(Z, U, V), W) => reach(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202(true, X, Y, edge(Z, U, V), W) => true if!fac6220reach!fac62202(false, X, Y, edge(Z, U, V), W) => or(reach(X, Y, V, W), reach(U, Y, union(V, W), empty)) map(F, cons(X, Y)) => cons(F X, map(F, Y)) filter(F, cons(X, Y)) => filter2(F X, F, X, Y) filter2(true, F, X, Y) => cons(X, filter(F, Y)) filter2(false, F, X, Y) => filter(F, Y) By [Kop12, Thm. 7.17], we may replace the dependency pair problem (P_4, R_0, minimal, formative) by (P_4, R_1, minimal, formative). Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative), (P_3, R_0, minimal, formative) and (P_4, R_1, minimal, formative) is finite. We consider the dependency pair problem (P_4, R_1, minimal, formative). We will use the reduction pair processor [Kop12, Thm. 7.16]. As the system is abstraction-simple and the formative flag is set, it suffices to find a tagged reduction pair [Kop12, Def. 6.70]. Thus, we must orient: map#(F, cons(X, Y)) >? F(X) map#(F, cons(X, Y)) >? map#(F, Y) filter#(F, cons(X, Y)) >? filter2#(F X, F, X, Y) filter#(F, cons(X, Y)) >? F(X) filter2#(true, F, X, Y) >? filter#(F, Y) filter2#(false, F, X, Y) >? filter#(F, Y) eq(0, 0) >= true eq(0, s(X)) >= false eq(s(X), 0) >= false eq(s(X), s(Y)) >= eq(X, Y) or(true, X) >= true or(false, X) >= X union(empty, X) >= X union(edge(X, Y, Z), U) >= edge(X, Y, union(Z, U)) reach(X, Y, empty, Z) >= false reach(X, Y, edge(Z, U, V), W) >= if!fac6220reach!fac62201(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(true, X, Y, edge(Z, U, V), W) >= if!fac6220reach!fac62202(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(false, X, Y, edge(Z, U, V), W) >= reach(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202(true, X, Y, edge(Z, U, V), W) >= true if!fac6220reach!fac62202(false, X, Y, edge(Z, U, V), W) >= or(reach(X, Y, V, W), reach(U, Y, union(V, W), empty)) map(F, cons(X, Y)) >= cons(F X, map(F, Y)) filter(F, cons(X, Y)) >= filter2(F X, F, X, Y) filter2(true, F, X, Y) >= cons(X, filter(F, Y)) filter2(false, F, X, Y) >= filter(F, Y) We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 3 cons = \y0y1.2 + 2y0 + 2y1 edge = \y0y1y2.0 empty = 0 eq = \y0y1.2 false = 0 filter = \G0y1.y1 filter2 = \y0G1y2y3.2 + 2y2 + 2y3 filter2# = \y0G1y2y3.G1(y3) filter# = \G0y1.G0(y1) if!fac6220reach!fac62201 = \y0y1y2y3y4.0 if!fac6220reach!fac62202 = \y0y1y2y3y4.0 map = \G0y1.2y1 + 2y1G0(y1) map# = \G0y1.3 + 2G0(y1) or = \y0y1.y1 reach = \y0y1y2y3.2y3 s = \y0.3 true = 0 union = \y0y1.y1 Using this interpretation, the requirements translate to: [[map#(_F0, cons(_x1, _x2))]] = 3 + 2F0(2 + 2x1 + 2x2) > F0(x1) = [[_F0(_x1)]] [[map#(_F0, cons(_x1, _x2))]] = 3 + 2F0(2 + 2x1 + 2x2) >= 3 + 2F0(x2) = [[map#(_F0, _x2)]] [[filter#(_F0, cons(_x1, _x2))]] = F0(2 + 2x1 + 2x2) >= F0(x2) = [[filter2#(_F0 _x1, _F0, _x1, _x2)]] [[filter#(_F0, cons(_x1, _x2))]] = F0(2 + 2x1 + 2x2) >= F0(x1) = [[_F0(_x1)]] [[filter2#(true, _F0, _x1, _x2)]] = F0(x2) >= F0(x2) = [[filter#(_F0, _x2)]] [[filter2#(false, _F0, _x1, _x2)]] = F0(x2) >= F0(x2) = [[filter#(_F0, _x2)]] [[eq(0, 0)]] = 2 >= 0 = [[true]] [[eq(0, s(_x0))]] = 2 >= 0 = [[false]] [[eq(s(_x0), 0)]] = 2 >= 0 = [[false]] [[eq(s(_x0), s(_x1))]] = 2 >= 2 = [[eq(_x0, _x1)]] [[or(true, _x0)]] = x0 >= 0 = [[true]] [[or(false, _x0)]] = x0 >= x0 = [[_x0]] [[union(empty, _x0)]] = x0 >= x0 = [[_x0]] [[union(edge(_x0, _x1, _x2), _x3)]] = x3 >= 0 = [[edge(_x0, _x1, union(_x2, _x3))]] [[reach(_x0, _x1, empty, _x2)]] = 2x2 >= 0 = [[false]] [[reach(_x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 2x5 >= 0 = [[if!fac6220reach!fac62201(eq(_x0, _x2), _x0, _x1, edge(_x2, _x3, _x4), _x5)]] [[if!fac6220reach!fac62201(true, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[if!fac6220reach!fac62202(eq(_x1, _x3), _x0, _x1, edge(_x2, _x3, _x4), _x5)]] [[if!fac6220reach!fac62201(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[reach(_x0, _x1, _x4, edge(_x2, _x3, _x5))]] [[if!fac6220reach!fac62202(true, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[true]] [[if!fac6220reach!fac62202(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[or(reach(_x0, _x1, _x4, _x5), reach(_x3, _x1, union(_x4, _x5), empty))]] [[map(_F0, cons(_x1, _x2))]] = 4 + 4x1 + 4x2 + 4x1F0(2 + 2x1 + 2x2) + 4x2F0(2 + 2x1 + 2x2) + 4F0(2 + 2x1 + 2x2) >= 2 + 4x2 + 4x2F0(x2) + 2max(x1, F0(x1)) = [[cons(_F0 _x1, map(_F0, _x2))]] [[filter(_F0, cons(_x1, _x2))]] = 2 + 2x1 + 2x2 >= 2 + 2x1 + 2x2 = [[filter2(_F0 _x1, _F0, _x1, _x2)]] [[filter2(true, _F0, _x1, _x2)]] = 2 + 2x1 + 2x2 >= 2 + 2x1 + 2x2 = [[cons(_x1, filter(_F0, _x2))]] [[filter2(false, _F0, _x1, _x2)]] = 2 + 2x1 + 2x2 >= x2 = [[filter(_F0, _x2)]] By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_4, R_1, minimal, formative) by (P_5, R_1, minimal, formative), where P_5 consists of: map#(F, cons(X, Y)) =#> map#(F, Y) filter#(F, cons(X, Y)) =#> filter2#(F X, F, X, Y) filter#(F, cons(X, Y)) =#> F(X) filter2#(true, F, X, Y) =#> filter#(F, Y) filter2#(false, F, X, Y) =#> filter#(F, Y) Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative), (P_3, R_0, minimal, formative) and (P_5, R_1, minimal, formative) is finite. We consider the dependency pair problem (P_5, R_1, minimal, formative). We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : 0 * 1 : 3, 4 * 2 : 0, 1, 2, 3, 4 * 3 : 1, 2 * 4 : 1, 2 This graph has the following strongly connected components: P_6: map#(F, cons(X, Y)) =#> map#(F, Y) P_7: filter#(F, cons(X, Y)) =#> filter2#(F X, F, X, Y) filter#(F, cons(X, Y)) =#> F(X) filter2#(true, F, X, Y) =#> filter#(F, Y) filter2#(false, F, X, Y) =#> filter#(F, Y) By [Kop12, Thm. 7.31], we may replace any dependency pair problem (P_5, R_1, m, f) by (P_6, R_1, m, f) and (P_7, R_1, m, f). Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative), (P_3, R_0, minimal, formative), (P_6, R_1, minimal, formative) and (P_7, R_1, minimal, formative) is finite. We consider the dependency pair problem (P_7, R_1, minimal, formative). We will use the reduction pair processor [Kop12, Thm. 7.16]. As the system is abstraction-simple and the formative flag is set, it suffices to find a tagged reduction pair [Kop12, Def. 6.70]. Thus, we must orient: filter#(F, cons(X, Y)) >? filter2#(F X, F, X, Y) filter#(F, cons(X, Y)) >? F(X) filter2#(true, F, X, Y) >? filter#(F, Y) filter2#(false, F, X, Y) >? filter#(F, Y) eq(0, 0) >= true eq(0, s(X)) >= false eq(s(X), 0) >= false eq(s(X), s(Y)) >= eq(X, Y) or(true, X) >= true or(false, X) >= X union(empty, X) >= X union(edge(X, Y, Z), U) >= edge(X, Y, union(Z, U)) reach(X, Y, empty, Z) >= false reach(X, Y, edge(Z, U, V), W) >= if!fac6220reach!fac62201(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(true, X, Y, edge(Z, U, V), W) >= if!fac6220reach!fac62202(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(false, X, Y, edge(Z, U, V), W) >= reach(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202(true, X, Y, edge(Z, U, V), W) >= true if!fac6220reach!fac62202(false, X, Y, edge(Z, U, V), W) >= or(reach(X, Y, V, W), reach(U, Y, union(V, W), empty)) map(F, cons(X, Y)) >= cons(F X, map(F, Y)) filter(F, cons(X, Y)) >= filter2(F X, F, X, Y) filter2(true, F, X, Y) >= cons(X, filter(F, Y)) filter2(false, F, X, Y) >= filter(F, Y) We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 3 cons = \y0y1.1 + y0 + y1 edge = \y0y1y2.0 empty = 0 eq = \y0y1.0 false = 0 filter = \G0y1.1 + 2y1 filter2 = \y0G1y2y3.2 + y2 + 2y3 filter2# = \y0G1y2y3.1 + 2y3 + 2G1(y3) + 3y3G1(y3) filter# = \G0y1.2y1 + 2G0(y1) + 3y1G0(y1) if!fac6220reach!fac62201 = \y0y1y2y3y4.0 if!fac6220reach!fac62202 = \y0y1y2y3y4.0 map = \G0y1.y1 + y1G0(y1) or = \y0y1.y1 reach = \y0y1y2y3.0 s = \y0.3 true = 0 union = \y0y1.y1 Using this interpretation, the requirements translate to: [[filter#(_F0, cons(_x1, _x2))]] = 2 + 2x1 + 2x2 + 3x1F0(1 + x1 + x2) + 3x2F0(1 + x1 + x2) + 5F0(1 + x1 + x2) > 1 + 2x2 + 2F0(x2) + 3x2F0(x2) = [[filter2#(_F0 _x1, _F0, _x1, _x2)]] [[filter#(_F0, cons(_x1, _x2))]] = 2 + 2x1 + 2x2 + 3x1F0(1 + x1 + x2) + 3x2F0(1 + x1 + x2) + 5F0(1 + x1 + x2) > F0(x1) = [[_F0(_x1)]] [[filter2#(true, _F0, _x1, _x2)]] = 1 + 2x2 + 2F0(x2) + 3x2F0(x2) > 2x2 + 2F0(x2) + 3x2F0(x2) = [[filter#(_F0, _x2)]] [[filter2#(false, _F0, _x1, _x2)]] = 1 + 2x2 + 2F0(x2) + 3x2F0(x2) > 2x2 + 2F0(x2) + 3x2F0(x2) = [[filter#(_F0, _x2)]] [[eq(0, 0)]] = 0 >= 0 = [[true]] [[eq(0, s(_x0))]] = 0 >= 0 = [[false]] [[eq(s(_x0), 0)]] = 0 >= 0 = [[false]] [[eq(s(_x0), s(_x1))]] = 0 >= 0 = [[eq(_x0, _x1)]] [[or(true, _x0)]] = x0 >= 0 = [[true]] [[or(false, _x0)]] = x0 >= x0 = [[_x0]] [[union(empty, _x0)]] = x0 >= x0 = [[_x0]] [[union(edge(_x0, _x1, _x2), _x3)]] = x3 >= 0 = [[edge(_x0, _x1, union(_x2, _x3))]] [[reach(_x0, _x1, empty, _x2)]] = 0 >= 0 = [[false]] [[reach(_x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[if!fac6220reach!fac62201(eq(_x0, _x2), _x0, _x1, edge(_x2, _x3, _x4), _x5)]] [[if!fac6220reach!fac62201(true, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[if!fac6220reach!fac62202(eq(_x1, _x3), _x0, _x1, edge(_x2, _x3, _x4), _x5)]] [[if!fac6220reach!fac62201(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[reach(_x0, _x1, _x4, edge(_x2, _x3, _x5))]] [[if!fac6220reach!fac62202(true, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[true]] [[if!fac6220reach!fac62202(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 0 >= 0 = [[or(reach(_x0, _x1, _x4, _x5), reach(_x3, _x1, union(_x4, _x5), empty))]] [[map(_F0, cons(_x1, _x2))]] = 1 + x1 + x2 + F0(1 + x1 + x2) + x1F0(1 + x1 + x2) + x2F0(1 + x1 + x2) >= 1 + x2 + x2F0(x2) + max(x1, F0(x1)) = [[cons(_F0 _x1, map(_F0, _x2))]] [[filter(_F0, cons(_x1, _x2))]] = 3 + 2x1 + 2x2 >= 2 + x1 + 2x2 = [[filter2(_F0 _x1, _F0, _x1, _x2)]] [[filter2(true, _F0, _x1, _x2)]] = 2 + x1 + 2x2 >= 2 + x1 + 2x2 = [[cons(_x1, filter(_F0, _x2))]] [[filter2(false, _F0, _x1, _x2)]] = 2 + x1 + 2x2 >= 1 + 2x2 = [[filter(_F0, _x2)]] By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace a dependency pair problem (P_7, R_1) by ({}, R_1). By the empty set processor [Kop12, Thm. 7.15] this problem may be immediately removed. Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative), (P_3, R_0, minimal, formative) and (P_6, R_1, minimal, formative) is finite. We consider the dependency pair problem (P_6, R_1, minimal, formative). We apply the subterm criterion with the following projection function: nu(map#) = 2 Thus, we can orient the dependency pairs as follows: nu(map#(F, cons(X, Y))) = cons(X, Y) |> Y = nu(map#(F, Y)) By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_6, R_1, minimal, f) by ({}, R_1, minimal, f). By the empty set processor [Kop12, Thm. 7.15] this problem may be immediately removed. Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative) and (P_3, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_3, R_0, minimal, formative). The formative rules of (P_3, R_0) are R_2 ::= eq(0, 0) => true eq(0, s(X)) => false eq(s(X), 0) => false eq(s(X), s(Y)) => eq(X, Y) or(true, X) => true or(false, X) => X union(empty, X) => X union(edge(X, Y, Z), U) => edge(X, Y, union(Z, U)) reach(X, Y, empty, Z) => false reach(X, Y, edge(Z, U, V), W) => if!fac6220reach!fac62201(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(true, X, Y, edge(Z, U, V), W) => if!fac6220reach!fac62202(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201(false, X, Y, edge(Z, U, V), W) => reach(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202(true, X, Y, edge(Z, U, V), W) => true if!fac6220reach!fac62202(false, X, Y, edge(Z, U, V), W) => or(reach(X, Y, V, W), reach(U, Y, union(V, W), empty)) By [Kop12, Thm. 7.17], we may replace the dependency pair problem (P_3, R_0, minimal, formative) by (P_3, R_2, minimal, formative). Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative) and (P_3, R_2, minimal, formative) is finite. We consider the dependency pair problem (P_3, R_2, minimal, formative). We will use the reduction pair processor with usable rules [Kop12, Thm. 7.44]. The usable rules of (P_3, R_2) are: eq(0, 0) => true eq(0, s(X)) => false eq(s(X), 0) => false eq(s(X), s(Y)) => eq(X, Y) union(empty, X) => X union(edge(X, Y, Z), U) => edge(X, Y, union(Z, U)) It suffices to find a standard reduction pair [Kop12, Def. 6.69]. Thus, we must orient: reach#(X, Y, edge(Z, U, V), W) >? if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(true, X, Y, edge(Z, U, V), W) >? if!fac6220reach!fac62202#(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(false, X, Y, edge(Z, U, V), W) >? reach#(X, Y, V, edge(Z, U, W)) if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) >? reach#(X, Y, V, W) if!fac6220reach!fac62202#(false, X, Y, edge(Z, U, V), W) >? reach#(U, Y, union(V, W), empty) eq(0, 0) >= true eq(0, s(X)) >= false eq(s(X), 0) >= false eq(s(X), s(Y)) >= eq(X, Y) union(empty, X) >= X union(edge(X, Y, Z), U) >= edge(X, Y, union(Z, U)) We orient these requirements with a polynomial interpretation in the natural numbers. The following interpretation satisfies the requirements: 0 = 3 edge = \y0y1y2.1 + y2 empty = 0 eq = \y0y1.0 false = 0 if!fac6220reach!fac62201# = \y0y1y2y3y4.y3 + y4 if!fac6220reach!fac62202# = \y0y1y2y3y4.y3 + y4 reach# = \y0y1y2y3.y2 + y3 s = \y0.3 true = 0 union = \y0y1.y0 + y1 Using this interpretation, the requirements translate to: [[reach#(_x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 1 + x4 + x5 >= 1 + x4 + x5 = [[if!fac6220reach!fac62201#(eq(_x0, _x2), _x0, _x1, edge(_x2, _x3, _x4), _x5)]] [[if!fac6220reach!fac62201#(true, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 1 + x4 + x5 >= 1 + x4 + x5 = [[if!fac6220reach!fac62202#(eq(_x1, _x3), _x0, _x1, edge(_x2, _x3, _x4), _x5)]] [[if!fac6220reach!fac62201#(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 1 + x4 + x5 >= 1 + x4 + x5 = [[reach#(_x0, _x1, _x4, edge(_x2, _x3, _x5))]] [[if!fac6220reach!fac62202#(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 1 + x4 + x5 > x4 + x5 = [[reach#(_x0, _x1, _x4, _x5)]] [[if!fac6220reach!fac62202#(false, _x0, _x1, edge(_x2, _x3, _x4), _x5)]] = 1 + x4 + x5 > x4 + x5 = [[reach#(_x3, _x1, union(_x4, _x5), empty)]] [[eq(0, 0)]] = 0 >= 0 = [[true]] [[eq(0, s(_x0))]] = 0 >= 0 = [[false]] [[eq(s(_x0), 0)]] = 0 >= 0 = [[false]] [[eq(s(_x0), s(_x1))]] = 0 >= 0 = [[eq(_x0, _x1)]] [[union(empty, _x0)]] = x0 >= x0 = [[_x0]] [[union(edge(_x0, _x1, _x2), _x3)]] = 1 + x2 + x3 >= 1 + x2 + x3 = [[edge(_x0, _x1, union(_x2, _x3))]] By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_3, R_2, minimal, formative) by (P_8, R_2, minimal, formative), where P_8 consists of: reach#(X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(true, X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62202#(eq(Y, U), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(false, X, Y, edge(Z, U, V), W) =#> reach#(X, Y, V, edge(Z, U, W)) Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative) and (P_8, R_2, minimal, formative) is finite. We consider the dependency pair problem (P_8, R_2, minimal, formative). We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : 1, 2 * 1 : * 2 : 0 This graph has the following strongly connected components: P_9: reach#(X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W) if!fac6220reach!fac62201#(false, X, Y, edge(Z, U, V), W) =#> reach#(X, Y, V, edge(Z, U, W)) By [Kop12, Thm. 7.31], we may replace any dependency pair problem (P_8, R_2, m, f) by (P_9, R_2, m, f). Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative) and (P_9, R_2, minimal, formative) is finite. We consider the dependency pair problem (P_9, R_2, minimal, formative). We apply the subterm criterion with the following projection function: nu(if!fac6220reach!fac62201#) = 4 nu(reach#) = 3 Thus, we can orient the dependency pairs as follows: nu(reach#(X, Y, edge(Z, U, V), W)) = edge(Z, U, V) = edge(Z, U, V) = nu(if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W)) nu(if!fac6220reach!fac62201#(false, X, Y, edge(Z, U, V), W)) = edge(Z, U, V) |> V = nu(reach#(X, Y, V, edge(Z, U, W))) By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_9, R_2, minimal, f) by (P_10, R_2, minimal, f), where P_10 contains: reach#(X, Y, edge(Z, U, V), W) =#> if!fac6220reach!fac62201#(eq(X, Z), X, Y, edge(Z, U, V), W) Thus, the original system is terminating if each of (P_1, R_0, minimal, formative), (P_2, R_0, minimal, formative) and (P_10, R_2, minimal, formative) is finite. We consider the dependency pair problem (P_10, R_2, minimal, formative). We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : This graph has no strongly connected components. By [Kop12, Thm. 7.31], this implies finiteness of the dependency pair problem. Thus, the original system is terminating if each of (P_1, R_0, minimal, formative) and (P_2, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_2, R_0, minimal, formative). We apply the subterm criterion with the following projection function: nu(union#) = 1 Thus, we can orient the dependency pairs as follows: nu(union#(edge(X, Y, Z), U)) = edge(X, Y, Z) |> Z = nu(union#(Z, U)) By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_2, R_0, minimal, f) by ({}, R_0, minimal, f). By the empty set processor [Kop12, Thm. 7.15] this problem may be immediately removed. Thus, the original system is terminating if (P_1, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_1, R_0, minimal, formative). We apply the subterm criterion with the following projection function: nu(eq#) = 1 Thus, we can orient the dependency pairs as follows: nu(eq#(s(X), s(Y))) = s(X) |> X = nu(eq#(X, Y)) By [Kop12, Thm. 7.35], we may replace a dependency pair problem (P_1, R_0, minimal, f) by ({}, R_0, minimal, f). By the empty set processor [Kop12, Thm. 7.15] this problem may be immediately removed. As all dependency pair problems were succesfully simplified with sound (and complete) processors until nothing remained, we conclude termination. +++ Citations +++ [Kop12] C. Kop. Higher Order Termination. PhD Thesis, 2012.