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


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


NO
We consider the system theBenchmark.

  Alphabet:

    f : [a -> a] --> b 
    g : [a -> a] --> a -> a 

  Rules:

    g(h) x => x 
    f(h) => f(g(h)) 

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:

  f(h) 
    => f(g(h)) 

That is, a term s reduces to a term t which instantiates s.