Term Rewriting System R:
[]
g(b) -> f(b)
f(a) -> g(a)
b -> a

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

G(b) -> F(b)
F(a) -> G(a)

R contains no SCCs.

Innermost Termination of R successfully shown.
Duration:
0:00 minutes