Term Rewriting System R:
[x, y, z]
f(g(x, y), x, z) -> f(z, z, z)
g(x, y) -> x
g(x, y) -> y
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(g(x, y), x, z) -> F(z, z, z)
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
F(g(x, y), x, z) -> F(z, z, z)
Rules:
f(g(x, y), x, z) -> f(z, z, z)
g(x, y) -> x
g(x, y) -> y
Termination of R could not be shown.
Duration:
0:00 minutes