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