Term Rewriting System R:
[x]
f(x) -> s(x)
f(s(s(x))) -> s(f(f(x)))

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(s(s(x))) -> F(f(x))
F(s(s(x))) -> F(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(x)
F(s(s(x))) -> F(f(x))


Rules:


f(x) -> s(x)
f(s(s(x))) -> s(f(f(x)))




Termination of R could not be shown.
Duration:
0:00 minutes