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