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