f(h(

g(i(

h(a) -> b

i(a) -> b

R

↳Dependency Pair Analysis

F(h(x)) -> F(i(x))

F(h(x)) -> I(x)

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

G(i(x)) -> H(x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

→DP Problem 2

↳Nar

**F(h( x)) -> F(i(x))**

f(h(x)) -> f(i(x))

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

h(a) -> b

i(a) -> b

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(h(x)) -> F(i(x))

The transformation is resulting in no new DP problems.

R

↳DPs

→DP Problem 1

↳Nar

→DP Problem 2

↳Narrowing Transformation

**G(i( x)) -> G(h(x))**

f(h(x)) -> f(i(x))

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

h(a) -> b

i(a) -> b

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.

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

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes