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)
R
↳DPs
→DP Problem 1
↳Polynomial Ordering
→DP Problem 2
↳Remaining
+'(+(x, y), z) -> +'(y, z)
+'(+(x, y), z) -> +'(x, +(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))
+'(+(x, y), z) -> +'(y, z)
+'(+(x, y), z) -> +'(x, +(y, z))
POL(+(x1, x2)) = 1 + x1 + x2 POL(+'(x1, x2)) = x1
R
↳DPs
→DP Problem 1
↳Polo
→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))
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Remaining Obligation(s)
*'(*(x, y), z) -> *'(y, z)
*'(*(x, y), z) -> *'(x, *(y, z))
*'(+(y, z), x) -> *'(x, z)
*'(+(y, z), x) -> *'(x, y)
*'(x, +(y, z)) -> *'(x, z)
*'(x, +(y, z)) -> *'(x, y)
*(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))