Term Rewriting System R:
[x, y]
f(g(x)) -> g(f(f(x)))
f(h(x)) -> h(g(x))
f'(s(x), y, y) -> f'(y, x, s(x))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(g(x)) -> F(f(x))
F(g(x)) -> F(x)
F'(s(x), y, y) -> F'(y, x, s(x))

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering
       →DP Problem 2
         ↳Polo


Dependency Pairs:

F(g(x)) -> F(x)
F(g(x)) -> F(f(x))


Rules:


f(g(x)) -> g(f(f(x)))
f(h(x)) -> h(g(x))
f'(s(x), y, y) -> f'(y, x, s(x))





The following dependency pairs can be strictly oriented:

F(g(x)) -> F(x)
F(g(x)) -> F(f(x))


Additionally, the following usable rules using the Ce-refinement can be oriented:

f(g(x)) -> g(f(f(x)))
f(h(x)) -> h(g(x))


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(g(x1))=  1 + x1  
  POL(h(x1))=  0  
  POL(f(x1))=  x1  
  POL(F(x1))=  1 + x1  

resulting in one new DP problem. 



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


Dependency Pair:


Rules:


f(g(x)) -> g(f(f(x)))
f(h(x)) -> h(g(x))
f'(s(x), y, y) -> f'(y, x, s(x))





Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polynomial Ordering


Dependency Pair:

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


Rules:


f(g(x)) -> g(f(f(x)))
f(h(x)) -> h(g(x))
f'(s(x), y, y) -> f'(y, x, s(x))





The following dependency pair can be strictly oriented:

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


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

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

resulting in one new DP problem. 



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


Dependency Pair:


Rules:


f(g(x)) -> g(f(f(x)))
f(h(x)) -> h(g(x))
f'(s(x), y, y) -> f'(y, x, s(x))





Using the Dependency Graph resulted in no new DP problems.

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