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

↳Remaining Obligation(s)

The following remains to be proven:

**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

Duration:

0:00 minutes