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