Term Rewriting System R:
[x, y]
D(t) -> 1
D(constant) -> 0
D(+(x, y)) -> +(D(x), D(y))
D(*(x, y)) -> +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) -> -(D(x), D(y))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

D'(+(x, y)) -> D'(x)
D'(+(x, y)) -> D'(y)
D'(*(x, y)) -> D'(x)
D'(*(x, y)) -> D'(y)
D'(-(x, y)) -> D'(x)
D'(-(x, y)) -> D'(y)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering


Dependency Pairs:

D'(-(x, y)) -> D'(y)
D'(-(x, y)) -> D'(x)
D'(*(x, y)) -> D'(y)
D'(*(x, y)) -> D'(x)
D'(+(x, y)) -> D'(y)
D'(+(x, y)) -> D'(x)


Rules:


D(t) -> 1
D(constant) -> 0
D(+(x, y)) -> +(D(x), D(y))
D(*(x, y)) -> +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) -> -(D(x), D(y))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

D'(-(x, y)) -> D'(y)
D'(-(x, y)) -> D'(x)


There are no usable rules for innermost that need to be oriented.

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

resulting in one new DP problem. 



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


Dependency Pairs:

D'(*(x, y)) -> D'(y)
D'(*(x, y)) -> D'(x)
D'(+(x, y)) -> D'(y)
D'(+(x, y)) -> D'(x)


Rules:


D(t) -> 1
D(constant) -> 0
D(+(x, y)) -> +(D(x), D(y))
D(*(x, y)) -> +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) -> -(D(x), D(y))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

D'(*(x, y)) -> D'(y)
D'(*(x, y)) -> D'(x)


There are no usable rules for innermost that need to be oriented.

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

resulting in one new DP problem. 



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


Dependency Pairs:

D'(+(x, y)) -> D'(y)
D'(+(x, y)) -> D'(x)


Rules:


D(t) -> 1
D(constant) -> 0
D(+(x, y)) -> +(D(x), D(y))
D(*(x, y)) -> +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) -> -(D(x), D(y))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

D'(+(x, y)) -> D'(y)
D'(+(x, y)) -> D'(x)


There are no usable rules for innermost that need to be oriented.

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

resulting in one new DP problem. 



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


Dependency Pair:


Rules:


D(t) -> 1
D(constant) -> 0
D(+(x, y)) -> +(D(x), D(y))
D(*(x, y)) -> +(*(y, D(x)), *(x, D(y)))
D(-(x, y)) -> -(D(x), D(y))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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