/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.

  c : [] --> o 
  f : [] --> o 
  g : [] --> o 

  c => f 
  f => 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]):

  c >? f 
  f >? g 

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

The following interpretation satisfies the requirements:

  c = 3 
  f = 0 
  g = 0 

Using this interpretation, the requirements translate to:

  [[c]] = 3 > 0 = [[f]] 
  [[f]] = 0 >= 0 = [[g]] 

We can thus remove the following rules:

  c => f 

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 >? g 

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

The following interpretation satisfies the requirements:

  f = 3 
  g = 0 

Using this interpretation, the requirements translate to:

  [[f]] = 3 > 0 = [[g]] 

We can thus remove the following rules:

  f => g 

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.