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