Term Rewriting System R:

   [x, y]
   f(x, c(y)) -> f(x, s(f(y, y)))
   f(s(x), s(y)) -> f(x, s(c(s(y))))

Termination of R to be shown.


This program has no overlaps, so it is sufficient to show innermost termination. 


R contains the following Dependency Pairs: 


   F(x, c(y)) -> F(x, s(f(y, y)))
   F(x, c(y)) -> F(y, y)
   F(s(x), s(y)) -> F(x, s(c(s(y))))

Furthermore, R contains two SCCs.


SCC1:

F(s(x), s(y)) -> F(x, s(c(s(y))))

By using a polynomial ordering, at least one Dependency Pair of this SCC can be strictly oriented.

No rules need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
POL(s(x_1)) = 1 + x_1
POL(F(x_1, x_2)) = x_1
POL(c(x_1)) = 0

 resulting in no subcycles.


SCC2:

F(x, c(y)) -> F(y, y)

By using a polynomial ordering, at least one Dependency Pair of this SCC can be strictly oriented.

No rules need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
POL(F(x_1, x_2)) = 1 + x_2
POL(c(x_1)) = 1 + x_1

 resulting in no subcycles.




Termination of R successfully shown.


Duration: 0.504 seconds.