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