f(a, f(

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Forward Instantiation Transformation

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

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

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.

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

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

Duration:

0:00 minutes