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


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


NO
We consider the system theBenchmark.

  Alphabet:

    cons : [a * b] --> b 
    iterate : [a -> a * a] --> b 

  Rules:

    iterate(f, x) => cons(x, iterate(f, f x)) 

This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).

It is easy to see that this system is non-terminating:

  iterate(f, x) 
    => cons(x, iterate(f, f x)) 
    |> iterate(f, f x) 

That is, a term s reduces to a term t which has a subterm that is an instance of the original term.