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