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