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