We consider the system Applicative_first_order_05__30.

  Alphabet:

    !faccolon : [a * a] --> a 
    C : [] --> a 
    cons : [c * d] --> d 
    false : [] --> b 
    filter : [c -> b * d] --> d 
    filter2 : [b * c -> b * c * d] --> d 
    map : [c -> c * d] --> d 
    nil : [] --> d 
    true : [] --> b 

  Rules:

    !faccolon(!faccolon(!faccolon(!faccolon(C, x), y), z), u) => !faccolon(!faccolon(x, z), !faccolon(!faccolon(!faccolon(x, y), z), u)) 
    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 static dependency pairs (see [KusIsoSakBla09] and the adaptation for AFSMs and accessible arguments in [Kop13]).

We thus obtain the following dependency pair problem (P_0, R_0, static, formative):

  Dependency Pairs P_0:

    0] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))   
    1] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   
    2] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(!faccolon(X, Y), Z), U)   
    3] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Y), Z)   
    4] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Y)   
    5] map#(F, cons(X, Y)) =#> map#(F, Y)   
    6] filter#(F, cons(X, Y)) =#> filter2#(F X, F, X, Y)   
    7] filter2#(true, F, X, Y) =#> filter#(F, Y)   
    8] filter2#(false, F, X, Y) =#> filter#(F, Y)   

  Rules R_0:

    !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) => !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
    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, static, formative) is finite.

We consider the dependency pair problem (P_0, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(!faccolon(X, Y), Z), U) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Y), Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Y) 
  map#(F, cons(X, Y)) >? map#(F, Y) 
  filter#(F, cons(X, Y)) >? filter2#(F X, F, X, Y) 
  filter2#(true, F, X, Y) >? filter#(F, Y) 
  filter2#(false, F, X, Y) >? filter#(F, Y) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

We orient these requirements with a polynomial interpretation in the natural numbers.

The following interpretation satisfies the requirements:

  !faccolon = \y0y1.0 
  !faccolon# = \y0y1.0 
  C = 3 
  cons = \y0y1.1 + 2y1 
  false = 3 
  filter = \G0y1.y1 
  filter2 = \y0G1y2y3.1 + 2y3 
  filter2# = \y0G1y2y3.1 + 2y3 
  filter# = \G0y1.2y1 
  map = \G0y1.2y1 
  map# = \G0y1.0 
  nil = 0 
  true = 3 

Using this interpretation, the requirements translate to:

  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(!faccolon(_x0, _x2), !faccolon(!faccolon(!faccolon(_x0, _x1), _x2), _x3))]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(_x0, _x2)]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(!faccolon(!faccolon(_x0, _x1), _x2), _x3)]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(!faccolon(_x0, _x1), _x2)]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(_x0, _x1)]] 
  [[map#(_F0, cons(_x1, _x2))]] = 0 >= 0 = [[map#(_F0, _x2)]] 
  [[filter#(_F0, cons(_x1, _x2))]] = 2 + 4x2 > 1 + 2x2 = [[filter2#(_F0 _x1, _F0, _x1, _x2)]] 
  [[filter2#(true, _F0, _x1, _x2)]] = 1 + 2x2 > 2x2 = [[filter#(_F0, _x2)]] 
  [[filter2#(false, _F0, _x1, _x2)]] = 1 + 2x2 > 2x2 = [[filter#(_F0, _x2)]] 
  [[!faccolon(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon(!faccolon(_x0, _x2), !faccolon(!faccolon(!faccolon(_x0, _x1), _x2), _x3))]] 
  [[map(_F0, nil)]] = 0 >= 0 = [[nil]] 
  [[map(_F0, cons(_x1, _x2))]] = 2 + 4x2 >= 1 + 4x2 = [[cons(_F0 _x1, map(_F0, _x2))]] 
  [[filter(_F0, nil)]] = 0 >= 0 = [[nil]] 
  [[filter(_F0, cons(_x1, _x2))]] = 1 + 2x2 >= 1 + 2x2 = [[filter2(_F0 _x1, _F0, _x1, _x2)]] 
  [[filter2(true, _F0, _x1, _x2)]] = 1 + 2x2 >= 1 + 2x2 = [[cons(_x1, filter(_F0, _x2))]] 
  [[filter2(false, _F0, _x1, _x2)]] = 1 + 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_0, R_0, static, formative) by (P_1, R_0, static, formative), where P_1 consists of:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(!faccolon(X, Y), Z), U)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Y), Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Y)   
  map#(F, cons(X, Y)) =#> map#(F, Y)   

Thus, the original system is terminating if (P_1, R_0, static, formative) is finite.

We consider the dependency pair problem (P_1, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(!faccolon(X, Y), Z), U) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Y), Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Y) 
  map#(F, cons(X, Y)) >? map#(F, Y) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

We orient these requirements with a polynomial interpretation in the natural numbers.

The following interpretation satisfies the requirements:

  !faccolon = \y0y1.0 
  !faccolon# = \y0y1.0 
  C = 3 
  cons = \y0y1.1 + y1 
  false = 3 
  filter = \G0y1.y1 
  filter2 = \y0G1y2y3.1 + y3 
  map = \G0y1.2 + y1 
  map# = \G0y1.y1 
  nil = 0 
  true = 3 

Using this interpretation, the requirements translate to:

  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(!faccolon(_x0, _x2), !faccolon(!faccolon(!faccolon(_x0, _x1), _x2), _x3))]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(_x0, _x2)]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(!faccolon(!faccolon(_x0, _x1), _x2), _x3)]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(!faccolon(_x0, _x1), _x2)]] 
  [[!faccolon#(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon#(_x0, _x1)]] 
  [[map#(_F0, cons(_x1, _x2))]] = 1 + x2 > x2 = [[map#(_F0, _x2)]] 
  [[!faccolon(!faccolon(!faccolon(!faccolon(C, _x0), _x1), _x2), _x3)]] = 0 >= 0 = [[!faccolon(!faccolon(_x0, _x2), !faccolon(!faccolon(!faccolon(_x0, _x1), _x2), _x3))]] 
  [[map(_F0, nil)]] = 2 >= 0 = [[nil]] 
  [[map(_F0, cons(_x1, _x2))]] = 3 + x2 >= 3 + x2 = [[cons(_F0 _x1, map(_F0, _x2))]] 
  [[filter(_F0, nil)]] = 0 >= 0 = [[nil]] 
  [[filter(_F0, cons(_x1, _x2))]] = 1 + x2 >= 1 + x2 = [[filter2(_F0 _x1, _F0, _x1, _x2)]] 
  [[filter2(true, _F0, _x1, _x2)]] = 1 + x2 >= 1 + x2 = [[cons(_x1, filter(_F0, _x2))]] 
  [[filter2(false, _F0, _x1, _x2)]] = 1 + x2 >= 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_1, R_0, static, formative) by (P_2, R_0, static, formative), where P_2 consists of:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(!faccolon(X, Y), Z), U)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Y), Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Y)   

Thus, the original system is terminating if (P_2, R_0, static, formative) is finite.

We consider the dependency pair problem (P_2, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(!faccolon(X, Y), Z), U) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Y), Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Y) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

Since this representation is not advantageous for the higher-order recursive path ordering, we present the strict requirements in their unextended form, which is not problematic since for any F, s and substituion gamma: (F s)gamma beta-reduces to F(s)gamma.)

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[!faccolon#(x_1, x_2)]] = !faccolon#(x_1) 
  [[cons(x_1, x_2)]] = _|_ 
  [[filter(x_1, x_2)]] = _|_ 
  [[filter2(x_1, x_2, x_3, x_4)]] = _|_ 
  [[map(x_1, x_2)]] = map 
  [[nil]] = _|_ 

We choose Lex = {!faccolon} and Mul = {!faccolon#, @_{o -> o}, C, false, map, true}, and the following precedence: !faccolon > !faccolon# > @_{o -> o} > C > false > map > true

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Z)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) > !faccolon#(!faccolon(!faccolon(X, Y), Z)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Y)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  map >= _|_ 
  map >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 

With these choices, we have:

  1] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Z))  because !faccolon# in Mul and [2], by (Fun) 
  2] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [3] and [8], by (Fun) 
  3] !faccolon(!faccolon(C, X), Y) >= X  because [4], by (Star) 
  4] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 
  5] !faccolon(C, X) >= X  because [6], by (Star) 
  6] !faccolon*(C, X) >= X  because [7], by (Select) 
  7] X >= X  by (Meta) 
  8] Z >= Z  by (Meta) 

  9] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because !faccolon# in Mul and [10], by (Fun) 
  10] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= X  because [11], by (Star) 
  11] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [3], by (Select) 

  12] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) > !faccolon#(!faccolon(!faccolon(X, Y), Z))  because [13], by definition 
  13] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(!faccolon(X, Y), Z))  because !faccolon# in Mul and [14], by (Stat) 
  14] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(!faccolon(X, Y), Z)  because [15], by definition 
  15] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [16], [23] and [27], by (Stat) 
  16] !faccolon(!faccolon(C, X), Y) > !faccolon(X, Y)  because [17], by definition 
  17] !faccolon*(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [18], [20] and [21], by (Stat) 
  18] !faccolon(C, X) > X  because [19], by definition 
  19] !faccolon*(C, X) >= X  because [7], by (Select) 
  20] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 
  21] !faccolon*(!faccolon(C, X), Y) >= Y  because [22], by (Select) 
  22] Y >= Y  by (Meta) 
  23] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Y)  because [24], by (Select) 
  24] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [25] and [26], by (Fun) 
  25] !faccolon(C, X) >= X  because [19], by (Star) 
  26] Y >= Y  by (Meta) 
  27] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= Z  because [8], by (Select) 

  28] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Y))  because !faccolon# in Mul and [29], by (Fun) 
  29] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Y)  because [23], by (Star) 

  30] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because !faccolon# in Mul and [10], by (Fun) 

  31] !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [32], by (Star) 
  32] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [33], [37] and [38], by (Stat) 
  33] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(X, Z)  because [34], by definition 
  34] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [35], [36] and [27], by (Stat) 
  35] !faccolon(!faccolon(C, X), Y) > X  because [20], by definition 
  36] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [3], by (Select) 
  37] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(X, Z)  because [2], by (Select) 
  38] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(!faccolon(X, Y), Z), U)  because [14], [39] and [42], by (Stat) 
  39] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Y), Z)  because [40], by (Select) 
  40] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [41] and [8], by (Fun) 
  41] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [25] and [26], by (Fun) 
  42] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= U  because [43], by (Select) 
  43] U >= U  by (Meta) 

  44] map >= _|_  by (Bot) 

  45] map >= _|_  by (Bot) 

  46] _|_ >= _|_  by (Bot) 

  47] _|_ >= _|_  by (Bot) 

  48] _|_ >= _|_  by (Bot) 

  49] _|_ >= _|_  by (Bot) 

By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_2, R_0, static, formative) by (P_3, R_0, static, formative), where P_3 consists of:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Y), Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Y)   

Thus, the original system is terminating if (P_3, R_0, static, formative) is finite.

We consider the dependency pair problem (P_3, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Y), Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Y) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

Since this representation is not advantageous for the higher-order recursive path ordering, we present the strict requirements in their unextended form, which is not problematic since for any F, s and substituion gamma: (F s)gamma beta-reduces to F(s)gamma.)

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[!faccolon#(x_1, x_2)]] = !faccolon#(x_1) 
  [[filter(x_1, x_2)]] = filter(x_2, x_1) 
  [[filter2(x_1, x_2, x_3, x_4)]] = filter2(x_4, x_2, x_1, x_3) 
  [[nil]] = _|_ 

We choose Lex = {!faccolon, filter, filter2} and Mul = {!faccolon#, @_{o -> o}, C, cons, false, map, true}, and the following precedence: !faccolon# > !faccolon > C > false > filter = filter2 > map > @_{o -> o} > cons > true

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Z)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) > !faccolon#(!faccolon(X, Y)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  map(F, _|_) >= _|_ 
  map(F, cons(X, Y)) >= cons(@_{o -> o}(F, X), map(F, Y)) 
  filter(F, _|_) >= _|_ 
  filter(F, cons(X, Y)) >= filter2(@_{o -> o}(F, X), F, X, Y) 
  filter2(true, F, X, Y) >= cons(X, filter(F, Y)) 
  filter2(false, F, X, Y) >= filter(F, Y) 

With these choices, we have:

  1] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Z))  because !faccolon# in Mul and [2], by (Fun) 
  2] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [3] and [8], by (Fun) 
  3] !faccolon(!faccolon(C, X), Y) >= X  because [4], by (Star) 
  4] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 
  5] !faccolon(C, X) >= X  because [6], by (Star) 
  6] !faccolon*(C, X) >= X  because [7], by (Select) 
  7] X >= X  by (Meta) 
  8] Z >= Z  by (Meta) 

  9] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because !faccolon# in Mul and [10], by (Fun) 
  10] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= X  because [11], by (Star) 
  11] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [3], by (Select) 

  12] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) > !faccolon#(!faccolon(X, Y))  because [13], by definition 
  13] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Y))  because !faccolon# in Mul and [14], by (Stat) 
  14] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(X, Y)  because [15], by definition 
  15] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Y)  because [16], by (Select) 
  16] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [17] and [18], by (Fun) 
  17] !faccolon(C, X) >= X  because [6], by (Star) 
  18] Y >= Y  by (Meta) 

  19] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because !faccolon# in Mul and [10], by (Fun) 

  20] !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [21], by (Star) 
  21] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [22], [28] and [29], by (Stat) 
  22] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(X, Z)  because [23], by definition 
  23] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [24], [26] and [27], by (Stat) 
  24] !faccolon(!faccolon(C, X), Y) > X  because [25], by definition 
  25] !faccolon*(!faccolon(C, X), Y) >= X  because [17], by (Select) 
  26] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [3], by (Select) 
  27] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= Z  because [8], by (Select) 
  28] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(X, Z)  because [2], by (Select) 
  29] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(!faccolon(X, Y), Z), U)  because [30], [37] and [40], by (Stat) 
  30] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(!faccolon(X, Y), Z)  because [31], by definition 
  31] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [32], [15] and [27], by (Stat) 
  32] !faccolon(!faccolon(C, X), Y) > !faccolon(X, Y)  because [33], by definition 
  33] !faccolon*(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [34], [25] and [36], by (Stat) 
  34] !faccolon(C, X) > X  because [35], by definition 
  35] !faccolon*(C, X) >= X  because [7], by (Select) 
  36] !faccolon*(!faccolon(C, X), Y) >= Y  because [18], by (Select) 
  37] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Y), Z)  because [38], by (Select) 
  38] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [39] and [8], by (Fun) 
  39] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [17] and [18], by (Fun) 
  40] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= U  because [41], by (Select) 
  41] U >= U  by (Meta) 

  42] map(F, _|_) >= _|_  by (Bot) 

  43] map(F, cons(X, Y)) >= cons(@_{o -> o}(F, X), map(F, Y))  because [44], by (Star) 
  44] map*(F, cons(X, Y)) >= cons(@_{o -> o}(F, X), map(F, Y))  because map > cons, [45] and [52], by (Copy) 
  45] map*(F, cons(X, Y)) >= @_{o -> o}(F, X)  because map > @_{o -> o}, [46] and [48], by (Copy) 
  46] map*(F, cons(X, Y)) >= F  because [47], by (Select) 
  47] F >= F  by (Meta) 
  48] map*(F, cons(X, Y)) >= X  because [49], by (Select) 
  49] cons(X, Y) >= X  because [50], by (Star) 
  50] cons*(X, Y) >= X  because [51], by (Select) 
  51] X >= X  by (Meta) 
  52] map*(F, cons(X, Y)) >= map(F, Y)  because map in Mul, [53] and [54], by (Stat) 
  53] F >= F  by (Meta) 
  54] cons(X, Y) > Y  because [55], by definition 
  55] cons*(X, Y) >= Y  because [56], by (Select) 
  56] Y >= Y  by (Meta) 

  57] filter(F, _|_) >= _|_  by (Bot) 

  58] filter(F, cons(X, Y)) >= filter2(@_{o -> o}(F, X), F, X, Y)  because [59], by (Star) 
  59] filter*(F, cons(X, Y)) >= filter2(@_{o -> o}(F, X), F, X, Y)  because filter = filter2, [60], [63], [64], [66] and [70], by (Stat) 
  60] cons(X, Y) > Y  because [61], by definition 
  61] cons*(X, Y) >= Y  because [62], by (Select) 
  62] Y >= Y  by (Meta) 
  63] filter*(F, cons(X, Y)) >= @_{o -> o}(F, X)  because filter > @_{o -> o}, [64] and [66], by (Copy) 
  64] filter*(F, cons(X, Y)) >= F  because [65], by (Select) 
  65] F >= F  by (Meta) 
  66] filter*(F, cons(X, Y)) >= X  because [67], by (Select) 
  67] cons(X, Y) >= X  because [68], by (Star) 
  68] cons*(X, Y) >= X  because [69], by (Select) 
  69] X >= X  by (Meta) 
  70] filter*(F, cons(X, Y)) >= Y  because [71], by (Select) 
  71] cons(X, Y) >= Y  because [61], by (Star) 

  72] filter2(true, F, X, Y) >= cons(X, filter(F, Y))  because [73], by (Star) 
  73] filter2*(true, F, X, Y) >= cons(X, filter(F, Y))  because filter2 > cons, [74] and [76], by (Copy) 
  74] filter2*(true, F, X, Y) >= X  because [75], by (Select) 
  75] X >= X  by (Meta) 
  76] filter2*(true, F, X, Y) >= filter(F, Y)  because filter2 = filter, [77], [78], [79] and [80], by (Stat) 
  77] F >= F  by (Meta) 
  78] Y >= Y  by (Meta) 
  79] filter2*(true, F, X, Y) >= F  because [77], by (Select) 
  80] filter2*(true, F, X, Y) >= Y  because [78], by (Select) 

  81] filter2(false, F, X, Y) >= filter(F, Y)  because [82], by (Star) 
  82] filter2*(false, F, X, Y) >= filter(F, Y)  because filter2 = filter, [83], [84], [85] and [86], by (Stat) 
  83] F >= F  by (Meta) 
  84] Y >= Y  by (Meta) 
  85] filter2*(false, F, X, Y) >= F  because [83], by (Select) 
  86] filter2*(false, F, X, Y) >= Y  because [84], by (Select) 

By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_3, R_0, static, formative) by (P_4, R_0, static, formative), where P_4 consists of:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Y)   

Thus, the original system is terminating if (P_4, R_0, static, formative) is finite.

We consider the dependency pair problem (P_4, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Y) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

Since this representation is not advantageous for the higher-order recursive path ordering, we present the strict requirements in their unextended form, which is not problematic since for any F, s and substituion gamma: (F s)gamma beta-reduces to F(s)gamma.)

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[!faccolon#(x_1, x_2)]] = !faccolon#(x_1) 
  [[cons(x_1, x_2)]] = _|_ 
  [[filter(x_1, x_2)]] = _|_ 
  [[filter2(x_1, x_2, x_3, x_4)]] = _|_ 
  [[nil]] = _|_ 

We choose Lex = {!faccolon} and Mul = {!faccolon#, @_{o -> o}, C, false, map, true}, and the following precedence: @_{o -> o} > C > false > map > !faccolon > !faccolon# > true

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Z)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) > !faccolon#(X) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  map(F, _|_) >= _|_ 
  map(F, _|_) >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 

With these choices, we have:

  1] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(!faccolon(X, Z))  because !faccolon# in Mul and [2], by (Fun) 
  2] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [3] and [8], by (Fun) 
  3] !faccolon(!faccolon(C, X), Y) >= X  because [4], by (Star) 
  4] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 
  5] !faccolon(C, X) >= X  because [6], by (Star) 
  6] !faccolon*(C, X) >= X  because [7], by (Select) 
  7] X >= X  by (Meta) 
  8] Z >= Z  by (Meta) 

  9] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because [10], by (Star) 
  10] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because [11], by (Select) 
  11] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon#(X)  because [12], by (Star) 
  12] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon#(X)  because [13], by (Select) 
  13] !faccolon(!faccolon(C, X), Y) >= !faccolon#(X)  because [14], by (Star) 
  14] !faccolon*(!faccolon(C, X), Y) >= !faccolon#(X)  because !faccolon > !faccolon# and [15], by (Copy) 
  15] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 

  16] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) > !faccolon#(X)  because [17], by definition 
  17] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z)) >= !faccolon#(X)  because !faccolon# in Mul and [18], by (Stat) 
  18] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > X  because [19], by definition 
  19] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [3], by (Select) 

  20] !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [21], by (Star) 
  21] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [22], [26] and [27], by (Stat) 
  22] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(X, Z)  because [23], by definition 
  23] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [24], [19] and [25], by (Stat) 
  24] !faccolon(!faccolon(C, X), Y) > X  because [15], by definition 
  25] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= Z  because [8], by (Select) 
  26] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(X, Z)  because [2], by (Select) 
  27] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(!faccolon(X, Y), Z), U)  because [28], [40] and [43], by (Stat) 
  28] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(!faccolon(X, Y), Z)  because [29], by definition 
  29] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [30], [36] and [25], by (Stat) 
  30] !faccolon(!faccolon(C, X), Y) > !faccolon(X, Y)  because [31], by definition 
  31] !faccolon*(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [32], [15] and [34], by (Stat) 
  32] !faccolon(C, X) > X  because [33], by definition 
  33] !faccolon*(C, X) >= X  because [7], by (Select) 
  34] !faccolon*(!faccolon(C, X), Y) >= Y  because [35], by (Select) 
  35] Y >= Y  by (Meta) 
  36] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Y)  because [37], by (Select) 
  37] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [38] and [39], by (Fun) 
  38] !faccolon(C, X) >= X  because [33], by (Star) 
  39] Y >= Y  by (Meta) 
  40] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Y), Z)  because [41], by (Select) 
  41] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [42] and [8], by (Fun) 
  42] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [38] and [39], by (Fun) 
  43] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= U  because [44], by (Select) 
  44] U >= U  by (Meta) 

  45] map(F, _|_) >= _|_  by (Bot) 

  46] map(F, _|_) >= _|_  by (Bot) 

  47] _|_ >= _|_  by (Bot) 

  48] _|_ >= _|_  by (Bot) 

  49] _|_ >= _|_  by (Bot) 

  50] _|_ >= _|_  by (Bot) 

By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_4, R_0, static, formative) by (P_5, R_0, static, formative), where P_5 consists of:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))   
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   

Thus, the original system is terminating if (P_5, R_0, static, formative) is finite.

We consider the dependency pair problem (P_5, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

Since this representation is not advantageous for the higher-order recursive path ordering, we present the strict requirements in their unextended form, which is not problematic since for any F, s and substituion gamma: (F s)gamma beta-reduces to F(s)gamma.)

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[cons(x_1, x_2)]] = _|_ 
  [[filter(x_1, x_2)]] = _|_ 
  [[filter2(x_1, x_2, x_3, x_4)]] = _|_ 
  [[map(x_1, x_2)]] = map 
  [[nil]] = _|_ 

We choose Lex = {!faccolon, !faccolon#} and Mul = {@_{o -> o}, C, false, map, true}, and the following precedence: !faccolon# > !faccolon > @_{o -> o} > C > false > map > true

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) > !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon#(X, Z) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  map >= _|_ 
  map >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 

With these choices, we have:

  1] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) > !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [2], by definition 
  2] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon#(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [3], [14] and [19], by (Stat) 
  3] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(X, Z)  because [4], by definition 
  4] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [5], [10] and [12], by (Stat) 
  5] !faccolon(!faccolon(C, X), Y) > X  because [6], by definition 
  6] !faccolon*(!faccolon(C, X), Y) >= X  because [7], by (Select) 
  7] !faccolon(C, X) >= X  because [8], by (Star) 
  8] !faccolon*(C, X) >= X  because [9], by (Select) 
  9] X >= X  by (Meta) 
  10] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [11], by (Select) 
  11] !faccolon(!faccolon(C, X), Y) >= X  because [6], by (Star) 
  12] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= Z  because [13], by (Select) 
  13] Z >= Z  by (Meta) 
  14] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(X, Z)  because !faccolon# > !faccolon, [15] and [17], by (Copy) 
  15] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= X  because [16], by (Select) 
  16] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= X  because [10], by (Star) 
  17] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= Z  because [18], by (Select) 
  18] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= Z  because [12], by (Star) 
  19] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(!faccolon(X, Y), Z), U)  because !faccolon# > !faccolon, [20] and [26], by (Copy) 
  20] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Y), Z)  because [21], by (Select) 
  21] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [22] and [25], by (Fun) 
  22] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [23] and [24], by (Fun) 
  23] !faccolon(C, X) >= X  because [8], by (Star) 
  24] Y >= Y  by (Meta) 
  25] Z >= Z  by (Meta) 
  26] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= U  because [27], by (Select) 
  27] U >= U  by (Meta) 

  28] !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon#(X, Z)  because [29], by (Star) 
  29] !faccolon#*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon#(X, Z)  because [30], [15] and [17], by (Stat) 
  30] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > X  because [10], by definition 

  31] !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [32], by (Star) 
  32] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [3], [33] and [36], by (Stat) 
  33] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(X, Z)  because [34], by (Select) 
  34] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [35] and [25], by (Fun) 
  35] !faccolon(!faccolon(C, X), Y) >= X  because [6], by (Star) 
  36] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(!faccolon(X, Y), Z), U)  because [37], [45] and [46], by (Stat) 
  37] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(!faccolon(X, Y), Z)  because [38], by definition 
  38] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [39], [44] and [12], by (Stat) 
  39] !faccolon(!faccolon(C, X), Y) > !faccolon(X, Y)  because [40], by definition 
  40] !faccolon*(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [41], [6] and [43], by (Stat) 
  41] !faccolon(C, X) > X  because [42], by definition 
  42] !faccolon*(C, X) >= X  because [9], by (Select) 
  43] !faccolon*(!faccolon(C, X), Y) >= Y  because [24], by (Select) 
  44] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Y)  because [22], by (Select) 
  45] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Y), Z)  because [21], by (Select) 
  46] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= U  because [27], by (Select) 

  47] map >= _|_  by (Bot) 

  48] map >= _|_  by (Bot) 

  49] _|_ >= _|_  by (Bot) 

  50] _|_ >= _|_  by (Bot) 

  51] _|_ >= _|_  by (Bot) 

  52] _|_ >= _|_  by (Bot) 

By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace the dependency pair problem (P_5, R_0, static, formative) by (P_6, R_0, static, formative), where P_6 consists of:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) =#> !faccolon#(X, Z)   

Thus, the original system is terminating if (P_6, R_0, static, formative) is finite.

We consider the dependency pair problem (P_6, R_0, static, formative).

We will use the reduction pair processor [Kop12, Thm. 7.16].  It suffices to find a standard reduction pair [Kop12, Def. 6.69].  Thus, we must orient:

  !faccolon#(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >? !faccolon#(X, Z) 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  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) 

Since this representation is not advantageous for the higher-order recursive path ordering, we present the strict requirements in their unextended form, which is not problematic since for any F, s and substituion gamma: (F s)gamma beta-reduces to F(s)gamma.)

We use a recursive path ordering as defined in [Kop12, Chapter 5].

Argument functions:

  [[!faccolon#(x_1, x_2)]] = x_1 
  [[cons(x_1, x_2)]] = _|_ 
  [[filter(x_1, x_2)]] = _|_ 
  [[filter2(x_1, x_2, x_3, x_4)]] = _|_ 
  [[map(x_1, x_2)]] = map 
  [[nil]] = _|_ 

We choose Lex = {!faccolon} and Mul = {@_{o -> o}, C, false, map, true}, and the following precedence: !faccolon > @_{o -> o} > C > false > map > true

Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:

  !faccolon(!faccolon(!faccolon(C, X), Y), Z) > X 
  !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U)) 
  map >= _|_ 
  map >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 
  _|_ >= _|_ 

With these choices, we have:

  1] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > X  because [2], by definition 
  2] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= X  because [3], by (Select) 
  3] !faccolon(!faccolon(C, X), Y) >= X  because [4], by (Star) 
  4] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 
  5] !faccolon(C, X) >= X  because [6], by (Star) 
  6] !faccolon*(C, X) >= X  because [7], by (Select) 
  7] X >= X  by (Meta) 

  8] !faccolon(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [9], by (Star) 
  9] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Z), !faccolon(!faccolon(!faccolon(X, Y), Z), U))  because [10], [16] and [20], by (Stat) 
  10] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(X, Z)  because [11], by definition 
  11] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [12], [2] and [14], by (Stat) 
  12] !faccolon(!faccolon(C, X), Y) > X  because [13], by definition 
  13] !faccolon*(!faccolon(C, X), Y) >= X  because [5], by (Select) 
  14] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= Z  because [15], by (Select) 
  15] Z >= Z  by (Meta) 
  16] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(X, Z)  because [17], by (Select) 
  17] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Z)  because [18] and [19], by (Fun) 
  18] !faccolon(!faccolon(C, X), Y) >= X  because [13], by (Star) 
  19] Z >= Z  by (Meta) 
  20] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(!faccolon(X, Y), Z), U)  because [21], [32] and [37], by (Stat) 
  21] !faccolon(!faccolon(!faccolon(C, X), Y), Z) > !faccolon(!faccolon(X, Y), Z)  because [22], by definition 
  22] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [23], [29] and [14], by (Stat) 
  23] !faccolon(!faccolon(C, X), Y) > !faccolon(X, Y)  because [24], by definition 
  24] !faccolon*(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [25], [13] and [27], by (Stat) 
  25] !faccolon(C, X) > X  because [26], by definition 
  26] !faccolon*(C, X) >= X  because [7], by (Select) 
  27] !faccolon*(!faccolon(C, X), Y) >= Y  because [28], by (Select) 
  28] Y >= Y  by (Meta) 
  29] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(X, Y)  because [12], [2] and [30], by (Stat) 
  30] !faccolon*(!faccolon(!faccolon(C, X), Y), Z) >= Y  because [31], by (Select) 
  31] !faccolon(!faccolon(C, X), Y) >= Y  because [27], by (Star) 
  32] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= !faccolon(!faccolon(X, Y), Z)  because [33], by (Select) 
  33] !faccolon(!faccolon(!faccolon(C, X), Y), Z) >= !faccolon(!faccolon(X, Y), Z)  because [34] and [19], by (Fun) 
  34] !faccolon(!faccolon(C, X), Y) >= !faccolon(X, Y)  because [35] and [36], by (Fun) 
  35] !faccolon(C, X) >= X  because [26], by (Star) 
  36] Y >= Y  by (Meta) 
  37] !faccolon*(!faccolon(!faccolon(!faccolon(C, X), Y), Z), U) >= U  because [38], by (Select) 
  38] U >= U  by (Meta) 

  39] map >= _|_  by (Bot) 

  40] map >= _|_  by (Bot) 

  41] _|_ >= _|_  by (Bot) 

  42] _|_ >= _|_  by (Bot) 

  43] _|_ >= _|_  by (Bot) 

  44] _|_ >= _|_  by (Bot) 

By the observations in [Kop12, Sec. 6.6], this reduction pair suffices; we may thus replace a dependency pair problem (P_6, R_0) by ({}, R_0).  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.
[Kop13]  C. Kop.  Static Dependency Pairs with Accessibility.  Unpublished manuscript, http://cl-informatik.uibk.ac.at/users/kop/static.pdf, 2013.
[KusIsoSakBla09]  K. Kusakari, Y. Isogai, M. Sakai, and F. Blanqui.  Static Dependency Pair Method Based On Strong Computability for Higher-Order Rewrite Systems.  In volume 92(10) of IEICE Transactions on Information and Systems.  2007--2015, 2009.