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

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

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

R contains no SCCs.

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