/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:

    fapp : [o * o] --> o 
    lam : [o -> o] --> o 

  Rules:

    fapp(lam(f), x) => f x 

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

This system is non-terminating, as demonstrated by the following reduction:

  fapp(lam(/\x.fapp(x, x)), lam(/\y.fapp(y, y))) 
    => (/\x.fapp(x, x)) lam(/\y.fapp(y, y)) 
    =>_beta fapp(lam(/\x.fapp(x, x)), lam(/\y.fapp(y, y))) 

That is, a term reduces to itself.