f(0, 1,

f(

0 -> 2

1 -> 2

R

↳Dependency Pair Analysis

F(0, 1,x) -> F(x,x,x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Forward Instantiation Transformation

**F(0, 1, x) -> F(x, x, x)**

f(0, 1,x) -> f(x,x,x)

f(x,y,z) -> 2

0 -> 2

1 -> 2

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(0, 1,x) -> F(x,x,x)

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes