We consider the system filter.

  Alphabet:

    0 : [] --> nat 
    bool : [nat] --> boolean 
    cons : [nat * list] --> list 
    consif : [boolean * nat * list] --> list 
    false : [] --> boolean 
    filter : [nat -> boolean * list] --> list 
    nil : [] --> list 
    rand : [nat] --> nat 
    s : [nat] --> nat 
    true : [] --> boolean 

  Rules:

    rand(x) => x 
    rand(s(x)) => rand(x) 
    bool(0) => false 
    bool(s(0)) => true 
    filter(f, nil) => nil 
    filter(f, cons(x, y)) => consif(f x, x, filter(f, y)) 
    consif(true, x, y) => cons(x, y) 
    consif(false, x, y) => y 

This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).

We observe that the rules contain a first-order subset:

  rand(X) => X 
  rand(s(X)) => rand(X) 
  bool(0) => false 
  bool(s(0)) => true 
  consif(true, X, Y) => cons(X, Y) 
  consif(false, X, Y) => Y 

Moreover, the system is finitely branching.  Thus, by [Kop12, Thm. 7.55], we may omit all first-order dependency pairs from the dependency pair problem (DP(R), R) if this first-order part is Ce-terminating when seen as a many-sorted first-order TRS.

According to the external first-order termination prover, this system is indeed Ce-terminating:

 || proof of resources/system.trs
 || # AProVE Commit ID: d84c10301d352dfd14de2104819581f4682260f5 fuhs 20130616
 || 
 || 
 || Termination w.r.t. Q of the given QTRS could be proven:
 || 
 || (0) QTRS
 || (1) QTRSRRRProof [EQUIVALENT]
 || (2) QTRS
 || (3) RisEmptyProof [EQUIVALENT]
 || (4) YES
 || 
 || 
 || ----------------------------------------
 || 
 || (0)
 || Obligation:
 || Q restricted rewrite system:
 || The TRS R consists of the following rules:
 || 
 ||    rand(%X) -> %X
 ||    rand(s(%X)) -> rand(%X)
 ||    bool(0) -> false
 ||    bool(s(0)) -> true
 ||    consif(true, %X, %Y) -> cons(%X, %Y)
 ||    consif(false, %X, %Y) -> %Y
 ||    ~PAIR(%X, %Y) -> %X
 ||    ~PAIR(%X, %Y) -> %Y
 || 
 || Q is empty.
 || 
 || ----------------------------------------
 || 
 || (1) QTRSRRRProof (EQUIVALENT)
 || Used ordering:
 || Polynomial interpretation [POLO]:
 || 
 ||    POL(0) = 2
 ||    POL(bool(x_1)) = 1 + 2*x_1
 ||    POL(cons(x_1, x_2)) = 1 + x_1 + x_2
 ||    POL(consif(x_1, x_2, x_3)) = 2 + x_1 + 2*x_2 + 2*x_3
 ||    POL(false) = 1
 ||    POL(rand(x_1)) = 2 + 2*x_1
 ||    POL(s(x_1)) = 2 + 2*x_1
 ||    POL(true) = 2
 ||    POL(~PAIR(x_1, x_2)) = 2 + x_1 + x_2
 || With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
 || 
 ||    rand(%X) -> %X
 ||    rand(s(%X)) -> rand(%X)
 ||    bool(0) -> false
 ||    bool(s(0)) -> true
 ||    consif(true, %X, %Y) -> cons(%X, %Y)
 ||    consif(false, %X, %Y) -> %Y
 ||    ~PAIR(%X, %Y) -> %X
 ||    ~PAIR(%X, %Y) -> %Y
 || 
 || 
 || 
 || 
 || ----------------------------------------
 || 
 || (2)
 || Obligation:
 || Q restricted rewrite system:
 || R is empty.
 || Q is empty.
 || 
 || ----------------------------------------
 || 
 || (3) RisEmptyProof (EQUIVALENT)
 || The TRS R is empty. Hence, termination is trivially proven.
 || ----------------------------------------
 || 
 || (4)
 || YES
 || 
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 [FuhKop19]).

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

  Dependency Pairs P_0:

    0] filter#(F, cons(X, Y)) =#> consif#(F X, X, filter(F, Y))   
    1] filter#(F, cons(X, Y)) =#> filter#(F, Y)   

  Rules R_0:

    rand(X) => X 
    rand(s(X)) => rand(X) 
    bool(0) => false 
    bool(s(0)) => true 
    filter(F, nil) => nil 
    filter(F, cons(X, Y)) => consif(F X, X, filter(F, Y)) 
    consif(true, X, Y) => cons(X, Y) 
    consif(false, X, Y) => Y 

Thus, the original system is terminating if (P_0, R_0, computable, formative) is finite.

We consider the dependency pair problem (P_0, R_0, computable, 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 : 0, 1 

This graph has the following strongly connected components:

  P_1:

    filter#(F, cons(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).

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

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

We apply the subterm criterion with the following projection function:

  nu(filter#) = 2 

Thus, we can orient the dependency pairs as follows:

  nu(filter#(F, cons(X, Y))) = cons(X, Y) |> Y = nu(filter#(F, Y)) 

By [FuhKop19, Thm. 61], we may replace a dependency pair problem (P_1, R_0, computable, f) by ({}, R_0, computable, 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 +++

[FuhKop19]  C. Fuhs, and C. Kop.  A static higher-order dependency pair framework.  In Proceedings of ESOP 2019, 2019.
[Kop12]  C. Kop.  Higher Order Termination.  PhD Thesis, 2012.
[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.