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