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