Term Rewriting System R:
[X, Y]
+(X, 0) -> X
+(X, s(Y)) -> s(+(X, Y))
f(0, s(0), X) -> f(X, +(X, X), X)
g(X, Y) -> X
g(X, Y) -> Y

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

+'(X, s(Y)) -> +'(X, Y)
F(0, s(0), X) -> F(X, +(X, X), X)
F(0, s(0), X) -> +'(X, X)

Furthermore, R contains two SCCs. 


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


Dependency Pair:

+'(X, s(Y)) -> +'(X, Y)


Rules:


+(X, 0) -> X
+(X, s(Y)) -> s(+(X, Y))
f(0, s(0), X) -> f(X, +(X, X), X)
g(X, Y) -> X
g(X, Y) -> Y


Strategy:

innermost




The following dependency pair can be strictly oriented:

+'(X, s(Y)) -> +'(X, Y)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

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

resulting in one new DP problem. 



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


Dependency Pair:


Rules:


+(X, 0) -> X
+(X, s(Y)) -> s(+(X, Y))
f(0, s(0), X) -> f(X, +(X, X), X)
g(X, Y) -> X
g(X, Y) -> Y


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Narrowing Transformation


Dependency Pair:

F(0, s(0), X) -> F(X, +(X, X), X)


Rules:


+(X, 0) -> X
+(X, s(Y)) -> s(+(X, Y))
f(0, s(0), X) -> f(X, +(X, X), X)
g(X, Y) -> X
g(X, Y) -> Y


Strategy:

innermost




On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

F(0, s(0), X) -> F(X, +(X, X), X)
two new Dependency Pairs are created:

F(0, s(0), 0) -> F(0, 0, 0)
F(0, s(0), s(Y')) -> F(s(Y'), s(+(s(Y'), Y')), s(Y'))

The transformation is resulting in no new DP problems.


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