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