/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 
  false : [] --> o 
  help : [o * o * o] --> o 
  lt : [o * o] --> o 
  minus : [o * o] --> o 
  s : [o] --> o 
  true : [] --> o 

  lt(0, s(X)) => true 
  lt(X, 0) => false 
  lt(s(X), s(Y)) => lt(X, Y) 
  minus(X, Y) => help(lt(Y, X), X, Y) 
  help(true, X, Y) => s(minus(X, s(Y))) 
  help(false, X, Y) => 0 

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 : [] --> gb 
  false : [] --> oa 
  help : [oa * gb * gb] --> gb 
  lt : [gb * gb] --> oa 
  minus : [gb * gb] --> gb 
  s : [gb] --> gb 
  true : [] --> oa 


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