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