Term Rewriting System R:
[X]
ag(X) -> ah(X)
ag(X) -> g(X)
ac -> d
ac -> c
ah(d) -> ag(c)
ah(X) -> h(X)
mark(g(X)) -> ag(X)
mark(h(X)) -> ah(X)
mark(c) -> ac
mark(d) -> d

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

AG(X) -> AH(X)
AH(d) -> AG(c)
MARK(g(X)) -> AG(X)
MARK(h(X)) -> AH(X)
MARK(c) -> AC

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Instantiation Transformation


Dependency Pairs:

AH(d) -> AG(c)
AG(X) -> AH(X)


Rules:


ag(X) -> ah(X)
ag(X) -> g(X)
ac -> d
ac -> c
ah(d) -> ag(c)
ah(X) -> h(X)
mark(g(X)) -> ag(X)
mark(h(X)) -> ah(X)
mark(c) -> ac
mark(d) -> d





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

AG(X) -> AH(X)
one new Dependency Pair is created:

AG(c) -> AH(c)

The transformation is resulting in no new DP problems.


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