f(s(

g(0, 1) -> s(0)

0 -> 1

R

↳Dependency Pair Analysis

F(s(x)) -> F(g(x,x))

F(s(x)) -> G(x,x)

Furthermore,

R

↳DPs

→DP Problem 1

↳Narrowing Transformation

**F(s( x)) -> F(g(x, x))**

f(s(x)) -> f(g(x,x))

g(0, 1) -> s(0)

0 -> 1

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(s(x)) -> F(g(x,x))

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes