/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: fapp : [o * o] --> o lam : [o] --> o subst : [o * o] --> o v : [] --> o Rules: fapp(lam(x), y) => subst(x, y) subst(v, x) => x subst(lam(x), y) => lam(x) subst(fapp(x, y), z) => fapp(subst(x, z), subst(y, z)) 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 our external first-order non-termination checker: || The following well-typed term is terminating: subst(fapp(v, v), subst(v, lam(fapp(v, v)))) || || proof of resources/system.trs || # AProVE Commit ID: 500ec9b2e2a919720cb177ef26031cb0220e008e fuhs 20130603 || || || Termination w.r.t. Q of the given QTRS could be disproven: || || (0) QTRS || (1) NonTerminationProof [EQUIVALENT, 83 ms] || (2) NO || || || ---------------------------------------- || || (0) || Obligation: || Q restricted rewrite system: || The TRS R consists of the following rules: || || fapp(lam(%X), %Y) -> subst(%X, %Y) || subst(v, %X) -> %X || subst(lam(%X), %Y) -> lam(%X) || subst(fapp(%X, %Y), %Z) -> fapp(subst(%X, %Z), subst(%Y, %Z)) || || Q is empty. || || ---------------------------------------- || || (1) NonTerminationProof (EQUIVALENT) || The following loops were found: || || ---------- Loop: ---------- || || subst(fapp(v, v), subst(v, lam(fapp(v, v)))) -> subst(fapp(v, v), lam(fapp(v, v))) with rule subst(v, %X') -> %X' at position [1] and matcher [%X' / lam(fapp(v, v))] || || subst(fapp(v, v), lam(fapp(v, v))) -> fapp(subst(v, lam(fapp(v, v))), subst(v, lam(fapp(v, v)))) with rule subst(fapp(%X, %Y), %Z) -> fapp(subst(%X, %Z), subst(%Y, %Z)) at position [] and matcher [%X / v, %Y / v, %Z / lam(fapp(v, v))] || || fapp(subst(v, lam(fapp(v, v))), subst(v, lam(fapp(v, v)))) -> fapp(lam(fapp(v, v)), subst(v, lam(fapp(v, v)))) with rule subst(v, %X') -> %X' at position [0] and matcher [%X' / lam(fapp(v, v))] || || fapp(lam(fapp(v, v)), subst(v, lam(fapp(v, v)))) -> subst(fapp(v, v), subst(v, lam(fapp(v, v)))) with rule fapp(lam(%X), %Y) -> subst(%X, %Y) at position [] and matcher [%X / fapp(v, v), %Y / subst(v, lam(fapp(v, v)))] || || Now an instance of the first term with Matcher [ ] occurs in the last term at position []. || || Context: [] || || || ---------------------------------------- || || (2) || NO ||