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