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