Term Rewriting System R:
[y]
f(a, y) -> f(y, g(y))
g(a) -> b
g(b) -> b
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(a, y) -> F(y, g(y))
F(a, y) -> G(y)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
F(a, y) -> F(y, g(y))
Rules:
f(a, y) -> f(y, g(y))
g(a) -> b
g(b) -> b
Strategy:
innermost
Innermost Termination of R could not be shown.
Duration:
0:00 minutes