f(

f(s(

f(c(

g(

g(

R

↳Dependency Pair Analysis

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

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

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

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

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

g(x,y) ->x

g(x,y) ->y

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

resulting in one new DP problem.

Used Argument Filtering System:

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

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

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

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

g(x,y) ->x

g(x,y) ->y

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

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

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

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

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

g(x,y) ->x

g(x,y) ->y

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(c(x)_{1})= 1 + x _{1}_{ }^{ }

resulting in one new DP problem.

Used Argument Filtering System:

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳Dependency Graph

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

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

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

g(x,y) ->x

g(x,y) ->y

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes