+(

+(+(

*(

R

↳Dependency Pair Analysis

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

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

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

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

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

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

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

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

innermost

The following dependency pairs can be strictly oriented:

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

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

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

The following usable rules for innermost can be oriented:

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

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

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

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

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

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

innermost

Using the Dependency Graph the DP problem was split into 1 DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳DGraph

...

→DP Problem 3

↳Remaining Obligation(s)

The following remains to be proven:

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

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

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

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

innermost

Duration:

0:00 minutes