/export/starexec/sandbox/solver/bin/starexec_run_HigherOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
We consider the system theBenchmark.

  Alphabet:

    lim : [] --> N -> O -> O 
    plus : [] --> O -> O -> O 
    s : [] --> O -> O 
    z : [] --> O 

  Rules:

    plus z x => x 
    plus (s x) y => s (plus x y) 
    plus (lim (/\x.f x)) y => lim (/\u.plus (f u) y) 

Using the transformations described in [Kop11], this system can be brought in a form without leading free variables in the left-hand side, and where the left-hand side of a variable is always a functional term or application headed by a functional term.

We now transform the resulting AFS into an AFSM by replacing all free variables by meta-variables (with arity 0).  This leads to the following AFSM:

  Alphabet:

    lim : [N -> O] --> O 
    plus : [O * O] --> O 
    s : [O] --> O 
    z : [] --> O 
    ~AP1 : [N -> O * N] --> O 

  Rules:

    plus(z, X) => X 
    plus(s(X), Y) => s(plus(X, Y)) 
    plus(lim(/\x.~AP1(F, x)), X) => lim(/\y.plus(~AP1(F, y), X)) 
    ~AP1(F, X) => F X 

We use rule removal, following [Kop12, Theorem 2.23].

This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]):

  plus(z, X) >? X 
  plus(s(X), Y) >? s(plus(X, Y)) 
  plus(lim(/\x.~AP1(F, x)), X) >? lim(/\y.plus(~AP1(F, y), X)) 
  ~AP1(F, X) >? F X 

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

The following interpretation satisfies the requirements:

  lim = \G0.3 + G0(0) 
  plus = \y0y1.3 + y1 + 3y0 
  s = \y0.3 + y0 
  z = 3 
  ~AP1 = \G0y1.3 + y1 + G0(y1) 

Using this interpretation, the requirements translate to:

  [[plus(z, _x0)]] = 12 + x0 > x0 = [[_x0]] 
  [[plus(s(_x0), _x1)]] = 12 + x1 + 3x0 > 6 + x1 + 3x0 = [[s(plus(_x0, _x1))]] 
  [[plus(lim(/\x.~AP1(_F0, x)), _x1)]] = 21 + x1 + 3F0(0) > 15 + x1 + 3F0(0) = [[lim(/\x.plus(~AP1(_F0, x), _x1))]] 
  [[~AP1(_F0, _x1)]] = 3 + x1 + F0(x1) > x1 + F0(x1) = [[_F0 _x1]] 

We can thus remove the following rules:

  plus(z, X) => X 
  plus(s(X), Y) => s(plus(X, Y)) 
  plus(lim(/\x.~AP1(F, x)), X) => lim(/\y.plus(~AP1(F, y), X)) 
  ~AP1(F, X) => F X 

All rules were succesfully removed.  Thus, termination of the original system has been reduced to termination of the beta-rule, which is well-known to hold.


+++ Citations +++

[Kop11]  C. Kop.  Simplifying Algebraic Functional Systems.  In Proceedings of CAI 2011, volume 6742 of LNCS.  201--215, Springer, 2011.
[Kop12]  C. Kop.  Higher Order Termination.  PhD Thesis, 2012.