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