Term Rewriting System R:
[X]
f(g(X)) -> f(X)

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

F(g(X)) -> F(X)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Forward Instantiation Transformation`

Dependency Pair:

F(g(X)) -> F(X)

Rule:

f(g(X)) -> f(X)

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

F(g(X)) -> F(X)
one new Dependency Pair is created:

F(g(g(X''))) -> F(g(X''))

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳FwdInst`
`           →DP Problem 2`
`             ↳Forward Instantiation Transformation`

Dependency Pair:

F(g(g(X''))) -> F(g(X''))

Rule:

f(g(X)) -> f(X)

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

F(g(g(X''))) -> F(g(X''))
one new Dependency Pair is created:

F(g(g(g(X'''')))) -> F(g(g(X'''')))

The transformation is resulting in one new DP problem:

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

Dependency Pair:

F(g(g(g(X'''')))) -> F(g(g(X'''')))

Rule:

f(g(X)) -> f(X)

The following dependency pair can be strictly oriented:

F(g(g(g(X'''')))) -> F(g(g(X'''')))

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

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(g(x1)) =  1 + x1 POL(F(x1)) =  1 + x1

resulting in one new DP problem.

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

Dependency Pair:

Rule:

f(g(X)) -> f(X)

Using the Dependency Graph resulted in no new DP problems.

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