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