Term Rewriting System R:
[X, X1, X2]
af(0) -> cons(0, f(s(0)))
af(s(0)) -> af(ap(s(0)))
af(X) -> f(X)
ap(s(0)) -> 0
ap(X) -> p(X)
mark(f(X)) -> af(mark(X))
mark(p(X)) -> ap(mark(X))
mark(0) -> 0
mark(cons(X1, X2)) -> cons(mark(X1), X2)
mark(s(X)) -> s(mark(X))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

AF(s(0)) -> AF(ap(s(0)))
AF(s(0)) -> AP(s(0))
MARK(f(X)) -> AF(mark(X))
MARK(f(X)) -> MARK(X)
MARK(p(X)) -> AP(mark(X))
MARK(p(X)) -> MARK(X)
MARK(cons(X1, X2)) -> MARK(X1)
MARK(s(X)) -> MARK(X)

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)
       →DP Problem 2
         ↳Remaining Obligation(s)




The following remains to be proven:


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)
       →DP Problem 2
         ↳Remaining Obligation(s)




The following remains to be proven:

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