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


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


YES
We consider the system theBenchmark.

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

  f : [o * o] --> o 
  h : [o * o] --> o 

  f(X, Y) => h(X, Y) 
  f(X, Y) => h(Y, X) 
  h(X, X) => 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]):

  f(X, Y) >? h(X, Y) 
  f(X, Y) >? h(Y, X) 
  h(X, X) >? X 

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

The following interpretation satisfies the requirements:

  f = \y0y1.3 + 3y0 + 3y1 
  h = \y0y1.y0 + y1 

Using this interpretation, the requirements translate to:

  [[f(_x0, _x1)]] = 3 + 3x0 + 3x1 > x0 + x1 = [[h(_x0, _x1)]] 
  [[f(_x0, _x1)]] = 3 + 3x0 + 3x1 > x0 + x1 = [[h(_x1, _x0)]] 
  [[h(_x0, _x0)]] = 2x0 >= x0 = [[_x0]] 

We can thus remove the following rules:

  f(X, Y) => h(X, Y) 
  f(X, Y) => h(Y, 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]):

  h(X, X) >? X 

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

The following interpretation satisfies the requirements:

  h = \y0y1.1 + y0 + y1 

Using this interpretation, the requirements translate to:

  [[h(_x0, _x0)]] = 1 + 2x0 > x0 = [[_x0]] 

We can thus remove the following rules:

  h(X, 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 +++

[Kop12]  C. Kop.  Higher Order Termination.  PhD Thesis, 2012.