Term Rewriting System R:
[x, y]
intlist(nil) -> nil
intlist(cons(x, y)) -> cons(s(x), intlist(y))
intlist(cons(x, nil)) -> cons(s(x), nil)
int(s(x), 0) -> nil
int(x, x) -> cons(x, nil)
int(s(x), s(y)) -> intlist(int(x, y))
int(0, s(y)) -> cons(0, int(s(0), s(y)))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

INTLIST(cons(x, y)) -> INTLIST(y)
INT(s(x), s(y)) -> INTLIST(int(x, y))
INT(s(x), s(y)) -> INT(x, y)
INT(0, s(y)) -> INT(s(0), s(y))

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:

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