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


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


MAYBE
We consider the system theBenchmark.

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

  0 : [] --> o 
  f : [o] --> o 
  false : [] --> o 
  gt : [o * o] --> o 
  if : [o * o] --> o 
  neq : [o * o] --> o 
  plus : [o * o] --> o 
  s : [o] --> o 
  true : [] --> o 
  while : [o * o] --> o 

  while(true, s(s(s(X)))) => while(gt(s(s(s(X))), s(0)), f(s(s(s(X))))) 
  f(X) => if(neq(X, s(s(0))), X) 
  gt(s(X), s(Y)) => gt(X, Y) 
  gt(s(X), 0) => true 
  gt(0, 0) => false 
  gt(0, s(X)) => false 
  if(true, X) => plus(X, s(0)) 
  if(false, X) => X 
  neq(s(X), s(Y)) => neq(X, Y) 
  neq(0, 0) => false 
  neq(0, s(X)) => true 
  neq(s(X), 0) => true 
  plus(s(X), Y) => plus(X, s(Y)) 
  plus(0, 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 : [] --> de 
  f : [de] --> de 
  false : [] --> pd 
  gt : [de * de] --> pd 
  if : [pd * de] --> de 
  neq : [de * de] --> pd 
  plus : [de * de] --> de 
  s : [de] --> de 
  true : [] --> pd 
  while : [pd * de] --> na 


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