*(

*(+(

*(*(

+(+(

R

↳Dependency Pair Analysis

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

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

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

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

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

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

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳Remaining

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

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

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

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

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

The following dependency pairs can be strictly oriented:

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

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

The following usable rule w.r.t. to the AFS can be oriented:

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

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

+' > +

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 3

↳Dependency Graph

→DP Problem 2

↳Remaining

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

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

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

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

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Remaining Obligation(s)

The following remains to be proven:

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

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

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

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

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

Duration:

0:00 minutes