f(

R

↳Dependency Pair Analysis

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

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

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

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

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

Duration:

0:00 minutes