/export/starexec/sandbox2/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES
We consider the system theBenchmark.

We are asked to determine termination of the following first-order TRS.

  0 : [] --> o 
  activate : [o] --> o 
  and : [o * o] --> o 
  plus : [o * o] --> o 
  s : [o] --> o 
  tt : [] --> o 

  and(tt, X) => activate(X) 
  plus(X, 0) => X 
  plus(X, s(Y)) => s(plus(X, Y)) 
  activate(X) => X 

As the system is orthogonal, it is terminating if it is innermost terminating by [Gra95].  Then, by [FuhGieParSchSwi11], it suffices to prove (innermost) termination of the typed system, with sort annotations chosen to respect the rules, as follows:

  0 : [] --> fa 
  activate : [i] --> i 
  and : [g * i] --> i 
  plus : [fa * fa] --> fa 
  s : [fa] --> fa 
  tt : [] --> g 

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

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

  and(tt, X) >? activate(X) 
  plus(X, 0) >? X 
  plus(X, s(Y)) >? s(plus(X, Y)) 
  activate(X) >? X 

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

The following interpretation satisfies the requirements:

  0 = 3 
  activate = \y0.y0 
  and = \y0y1.3 + 3y0 + 3y1 
  plus = \y0y1.3 + y0 + 3y1 
  s = \y0.3 + y0 
  tt = 3 

Using this interpretation, the requirements translate to:

  [[and(tt, _x0)]] = 12 + 3x0 > x0 = [[activate(_x0)]] 
  [[plus(_x0, 0)]] = 12 + x0 > x0 = [[_x0]] 
  [[plus(_x0, s(_x1))]] = 12 + x0 + 3x1 > 6 + x0 + 3x1 = [[s(plus(_x0, _x1))]] 
  [[activate(_x0)]] = x0 >= x0 = [[_x0]] 

We can thus remove the following rules:

  and(tt, X) => activate(X) 
  plus(X, 0) => X 
  plus(X, s(Y)) => s(plus(X, Y)) 

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

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

  activate(X) >? X 

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

The following interpretation satisfies the requirements:

  activate = \y0.1 + y0 

Using this interpretation, the requirements translate to:

  [[activate(_x0)]] = 1 + x0 > x0 = [[_x0]] 

We can thus remove the following rules:

  activate(X) => 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 +++

[FuhGieParSchSwi11]  C. Fuhs, J. Giesl, M. Parting, P. Schneider-Kamp, and S. Swiderski.  Proving Termination by Dependency Pairs and Inductive Theorem Proving.  In volume 47(2) of Journal of Automated Reasoning.  133--160, 2011.
[Gra95]  B. Gramlich.  Abstract Relations Between Restricted Termination and Confluence Properties of Rewrite Systems.  In volume 24(1-2) of Fundamentae Informaticae.  3--23, 1995.
[Kop12]  C. Kop.  Higher Order Termination.  PhD Thesis, 2012.