f(

g(

R

↳Dependency Pair Analysis

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Usable Rules (Innermost)

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

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

g(x) -> s(x)

innermost

As we are in the innermost case, we can delete all 1 non-usable-rules.

R

↳DPs

→DP Problem 1

↳UsableRules

→DP Problem 2

↳Rewriting Transformation

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

g(x) -> s(x)

innermost

On this DP problem, a Rewriting SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in no new DP problems.

Duration:

0:00 minutes