g(s(

g(0) -> 0

f(0) -> s(0)

f(s(

R

↳Dependency Pair Analysis

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Polynomial Ordering

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

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

g(0) -> 0

f(0) -> s(0)

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

innermost

The following dependency pairs can be strictly oriented:

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

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

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(G(x)_{1})= x _{1}_{ }^{ }_{ }^{ }POL(s(x)_{1})= 1 + x _{1}_{ }^{ }_{ }^{ }POL(F(x)_{1})= x _{1}_{ }^{ }

resulting in one new DP problem.

R

↳DPs

→DP Problem 1

↳Polo

→DP Problem 2

↳Dependency Graph

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

g(0) -> 0

f(0) -> s(0)

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

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes