*(

R

↳Dependency Pair Analysis

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

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

innermost

The following dependency pairs can be strictly oriented:

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

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

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

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

trivial

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}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

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

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes