f(0) -> s(0)

f(s(0)) -> s(s(0))

f(s(0)) -> *(s(s(0)), f(0))

f(+(

f(+(

R

↳Dependency Pair Analysis

F(s(0)) -> F(0)

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

f(0) -> s(0)

f(s(0)) -> s(s(0))

f(s(0)) -> *(s(s(0)), f(0))

f(+(x, s(0))) -> +(s(s(0)), f(x))

f(+(x,y)) -> *(f(x), f(y))

The following dependency pairs can be strictly oriented:

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

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

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

The following rules can be oriented:

f(0) -> s(0)

f(s(0)) -> s(s(0))

f(s(0)) -> *(s(s(0)), f(0))

f(+(x, s(0))) -> +(s(s(0)), f(x))

f(+(x,y)) -> *(f(x), f(y))

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{+, f} > *

{+, f} > s

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

f(0) -> s(0)

f(s(0)) -> s(s(0))

f(s(0)) -> *(s(s(0)), f(0))

f(+(x, s(0))) -> +(s(s(0)), f(x))

f(+(x,y)) -> *(f(x), f(y))

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes