f(a, f(

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Forward Instantiation Transformation

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

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

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

As a result of transforming the rule

one new Dependency Pair is created:

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

F(a, f(a, a)) -> F(a, f(f(a, a), a))

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳Narrowing Transformation

**F(a, f(a, a)) -> F(a, f(f(a, a), a))**

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

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, f(a, a)) -> F(a, f(f(a, a), a))

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes