Term Rewriting System R:
[x, y, z]
g(x, y) -> x
g(x, y) -> y
f(0, 1, x) -> f(s(x), x, x)
f(x, y, s(z)) -> s(f(0, 1, z))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(0, 1, x) -> F(s(x), x, x)
F(x, y, s(z)) -> F(0, 1, z)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering


Dependency Pairs:

F(x, y, s(z)) -> F(0, 1, z)
F(0, 1, x) -> F(s(x), x, x)


Rules:


g(x, y) -> x
g(x, y) -> y
f(0, 1, x) -> f(s(x), x, x)
f(x, y, s(z)) -> s(f(0, 1, z))





The following dependency pair can be strictly oriented:

F(x, y, s(z)) -> F(0, 1, z)


There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(0)=  0  
  POL(1)=  0  
  POL(s(x1))=  1 + x1  
  POL(F(x1, x2, x3))=  x3  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 2
             ↳Dependency Graph


Dependency Pair:

F(0, 1, x) -> F(s(x), x, x)


Rules:


g(x, y) -> x
g(x, y) -> y
f(0, 1, x) -> f(s(x), x, x)
f(x, y, s(z)) -> s(f(0, 1, z))





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes