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