Term Rewriting System R:
[x, y]
f(g(x, y), f(y, y)) -> f(g(y, x), y)
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(g(x, y), f(y, y)) -> F(g(y, x), y)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Polynomial Ordering
Dependency Pair:
F(g(x, y), f(y, y)) -> F(g(y, x), y)
Rule:
f(g(x, y), f(y, y)) -> f(g(y, x), y)
The following dependency pair can be strictly oriented:
F(g(x, y), f(y, y)) -> F(g(y, x), y)
There are no usable rules w.r.t. to the implicit AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
| POL(g(x1, x2)) | = 0 |
| POL(F(x1, x2)) | = x2 |
| POL(f(x1, x2)) | = 1 + x1 |
resulting in one new DP problem.
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Dependency Graph
Dependency Pair:
Rule:
f(g(x, y), f(y, y)) -> f(g(y, x), y)
Using the Dependency Graph resulted in no new DP problems.
Termination of R successfully shown.
Duration:
0:00 minutes