f(

R

↳Dependency Pair Analysis

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Forward Instantiation Transformation

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

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

innermost

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

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

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:

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

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

innermost

Duration:

0:00 minutes