Term Rewriting System R:
[x]
f(s(x)) -> f(g(x, x))
g(0, 1) -> s(0)
0 -> 1
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
F(s(x)) -> F(g(x, x))
F(s(x)) -> G(x, 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)) -> F(g(x, x))
Rules:
f(s(x)) -> f(g(x, x))
g(0, 1) -> s(0)
0 -> 1
Termination of R could not be shown.
Duration:
0:00 minutes