f(0,

f(s(

R

↳Dependency Pair Analysis

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Forward Instantiation Transformation

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

f(0,y) -> 0

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳Argument Filtering and Ordering

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

f(0,y) -> 0

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

The following dependency pair can be strictly oriented:

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

The following rules can be oriented:

f(0,y) -> 0

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

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(0)= 0 _{ }^{ }_{ }^{ }POL(s(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(F(x)_{1}, x_{2})= x _{1}+ x_{2}_{ }^{ }

resulting in one new DP problem.

Used Argument Filtering System:

F(x,_{1}x) -> F(_{2}x,_{1}x)_{2}

s(x) -> s(_{1}x)_{1}

f(x,_{1}x) ->_{2}x_{1}

R

↳DPs

→DP Problem 1

↳FwdInst

→DP Problem 2

↳AFS

...

→DP Problem 3

↳Dependency Graph

f(0,y) -> 0

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

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes