Term Rewriting System R:
[X]
f(X) -> g(nh(nf(X)))
f(X) -> nf(X)
h(X) -> nh(X)
activate(nh(X)) -> h(activate(X))
activate(nf(X)) -> f(activate(X))
activate(X) -> X

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

ACTIVATE(nh(X)) -> H(activate(X))
ACTIVATE(nh(X)) -> ACTIVATE(X)
ACTIVATE(nf(X)) -> F(activate(X))
ACTIVATE(nf(X)) -> ACTIVATE(X)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering


Dependency Pairs:

ACTIVATE(nf(X)) -> ACTIVATE(X)
ACTIVATE(nh(X)) -> ACTIVATE(X)


Rules:


f(X) -> g(nh(nf(X)))
f(X) -> nf(X)
h(X) -> nh(X)
activate(nh(X)) -> h(activate(X))
activate(nf(X)) -> f(activate(X))
activate(X) -> X


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVATE(nf(X)) -> ACTIVATE(X)


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

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(n__h(x1))=  x1  
  POL(n__f(x1))=  1 + x1  
  POL(ACTIVATE(x1))=  x1  

resulting in one new DP problem. 



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


Dependency Pair:

ACTIVATE(nh(X)) -> ACTIVATE(X)


Rules:


f(X) -> g(nh(nf(X)))
f(X) -> nf(X)
h(X) -> nh(X)
activate(nh(X)) -> h(activate(X))
activate(nf(X)) -> f(activate(X))
activate(X) -> X


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVATE(nh(X)) -> ACTIVATE(X)


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

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(n__h(x1))=  1 + x1  
  POL(ACTIVATE(x1))=  x1  

resulting in one new DP problem. 



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


Dependency Pair:


Rules:


f(X) -> g(nh(nf(X)))
f(X) -> nf(X)
h(X) -> nh(X)
activate(nh(X)) -> h(activate(X))
activate(nf(X)) -> f(activate(X))
activate(X) -> X


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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