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

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

H(f(f(x))) -> H(f(g(f(x))))
H(f(f(x))) -> F(g(f(x)))
F(g(f(x))) -> F(f(x))

Furthermore, R contains two SCCs.

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

Dependency Pair:

F(g(f(x))) -> F(f(x))

Rules:

h(f(f(x))) -> h(f(g(f(x))))
f(g(f(x))) -> f(f(x))

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

F(g(f(x))) -> F(f(x))
no new Dependency Pairs are created.
The transformation is resulting in no new DP problems.

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

The following remains to be proven:
Dependency Pair:

H(f(f(x))) -> H(f(g(f(x))))

Rules:

h(f(f(x))) -> h(f(g(f(x))))
f(g(f(x))) -> f(f(x))

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