Term Rewriting System R:
[X]
f(X, g(X)) -> f(1, g(X))
g(1) -> g(0)
Innermost Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(X, g(X)) -> F(1, g(X))
G(1) -> G(0)
R contains no SCCs.
Innermost Termination of R successfully shown.
Duration:
0:00 minutes