Term Rewriting System R:
[x]
f(x) -> f(a)
Termination of R to be shown.
TRS
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(x) -> F(a)
Furthermore, R contains one SCC.
TRS
↳DPs
→DP Problem 1
↳Non Termination
Dependency Pair:
F(x) -> F(a)
Rule:
f(x) -> f(a)
Found an infinite P-chain over R:
P =
F(x) -> F(a)
R =
f(x) -> f(a)
s = F(a)
evaluates to t =F(a)
Thus, s starts an infinite chain.
Non-Termination of R could be shown.
Duration:
0:00 minutes