Term Rewriting System R:
[X, Y]
f(X) -> if(X, c, nf(true))
f(X) -> nf(X)
if(true, X, Y) -> X
if(false, X, Y) -> activate(Y)
activate(nf(X)) -> f(X)
activate(X) -> X

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(X) -> IF(X, c, nf(true))
IF(false, X, Y) -> ACTIVATE(Y)
ACTIVATE(nf(X)) -> F(X)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

ACTIVATE(nf(X)) -> F(X)
IF(false, X, Y) -> ACTIVATE(Y)
F(X) -> IF(X, c, nf(true))


Rules:


f(X) -> if(X, c, nf(true))
f(X) -> nf(X)
if(true, X, Y) -> X
if(false, X, Y) -> activate(Y)
activate(nf(X)) -> f(X)
activate(X) -> X


Strategy:

innermost



Innermost Termination of R could not be shown.
Duration:
0:00 minutes