*(

*(

R

↳Dependency Pair Analysis

*'(x, *(y,z)) -> *'(*(x,y),z)

*'(x, *(y,z)) -> *'(x,y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Polynomial Ordering

***'( x, *(y, z)) -> *'(x, y)**

*(x, *(y,z)) -> *(*(x,y),z)

*(x,x) ->x

The following dependency pairs can be strictly oriented:

*'(x, *(y,z)) -> *'(x,y)

*'(x, *(y,z)) -> *'(*(x,y),z)

Additionally, the following usable rules using the Ce-refinement can be oriented:

*(x, *(y,z)) -> *(*(x,y),z)

*(x,x) ->x

Used ordering: Polynomial ordering with Polynomial interpretation:

_{ }^{ }POL(*'(x)_{1}, x_{2})= 1 + x _{2}_{ }^{ }_{ }^{ }POL(*(x)_{1}, x_{2})= 1 + x _{1}+ x_{2}_{ }^{ }

resulting in one new DP problem.

R

↳DPs

→DP Problem 1

↳Polo

→DP Problem 2

↳Dependency Graph

*(x, *(y,z)) -> *(*(x,y),z)

*(x,x) ->x

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes