a(f, a(f,

a(h,

R

↳Dependency Pair Analysis

A(f, a(f,x)) -> A(x,x)

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

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

A(h,x) -> A(f,x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

**A(h, x) -> A(f, x)**

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

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

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

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳Nar

→DP Problem 2

↳Remaining Obligation(s)

The following remains to be proven:

**A(h, a(f, x'')) -> A(f, a(g, a(x'', x'')))**

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

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

Duration:

0:00 minutes