Term Rewriting System R:
[X, Y, Z, X1]
2nd(cons1(X, cons(Y, Z))) -> Y
2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
from(X) -> cons(X, from(s(X)))
Termination of R to be shown.
R
↳Dependency Pair Analysis
R contains the following Dependency Pairs:
2ND(cons(X, X1)) -> 2ND(cons1(X, X1))
FROM(X) -> FROM(s(X))
Furthermore, R contains one SCC.
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
The following remains to be proven:
Dependency Pair:
FROM(X) -> FROM(s(X))
Rules:
2nd(cons1(X, cons(Y, Z))) -> Y
2nd(cons(X, X1)) -> 2nd(cons1(X, X1))
from(X) -> cons(X, from(s(X)))
Termination of R could not be shown.
Duration:
0:00 minutes