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


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


MAYBE
We consider the system theBenchmark.

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

  0 : [] --> o 
  cond : [o * o * o] --> o 
  false : [] --> o 
  gr : [o * o] --> o 
  p : [o] --> o 
  s : [o] --> o 
  true : [] --> o 

  cond(true, X, Y) => cond(gr(X, Y), p(X), Y) 
  gr(0, X) => false 
  gr(s(X), 0) => true 
  gr(s(X), s(Y)) => gr(X, Y) 
  p(0) => 0 
  p(s(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 : [] --> bb 
  cond : [ta * bb * bb] --> w 
  false : [] --> ta 
  gr : [bb * bb] --> ta 
  p : [bb] --> bb 
  s : [bb] --> bb 
  true : [] --> ta 


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