f(a, f(a,

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

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

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

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

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:

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

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

innermost

Duration:

0:00 minutes