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