a(f, a(f,

a(

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Forward Instantiation Transformation

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

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

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

innermost

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

As a result of transforming the rule

no new Dependency Pairs are created.

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳Narrowing Transformation

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

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

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

innermost

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

As a result of transforming the rule

two new Dependency Pairs are created:

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

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳Nar

...

→DP Problem 3

↳Forward Instantiation Transformation

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

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

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

innermost

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

As a result of transforming the rule

two new Dependency Pairs are created:

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

A(g, g) -> A(f, g)

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

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes