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