f(a, h(

h(g(

h(h(

g(h(

R

↳Dependency Pair Analysis

F(a, h(x)) -> F(g(x), h(x))

F(a, h(x)) -> G(x)

H(g(x)) -> H(a)

G(h(x)) -> G(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

**F(a, h( x)) -> F(g(x), h(x))**

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

h(g(x)) -> h(a)

h(h(x)) ->x

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

innermost

On this DP problem, a Narrowing SCC transformation can be performed.

As a result of transforming the rule

no new Dependency Pairs are created.

F(a, h(x)) -> F(g(x), h(x))

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes