R
↳Dependency Pair Analysis
+'(*(x, y), *(a, y)) -> *'(+(x, a), y)
+'(*(x, y), *(a, y)) -> +'(x, a)
*'(*(x, y), z) -> *'(x, *(y, z))
*'(*(x, y), z) -> *'(y, z)
R
↳DPs
→DP Problem 1
↳Forward Instantiation Transformation
*'(*(x, y), z) -> *'(y, z)
+(*(x, y), *(a, y)) -> *(+(x, a), y)
*(*(x, y), z) -> *(x, *(y, z))
innermost
one new Dependency Pair is created:
*'(*(x, y), z) -> *'(y, z)
*'(*(x, *(x'', y'')), z'') -> *'(*(x'', y''), z'')
R
↳DPs
→DP Problem 1
↳FwdInst
→DP Problem 2
↳Polynomial Ordering
*'(*(x, *(x'', y'')), z'') -> *'(*(x'', y''), z'')
+(*(x, y), *(a, y)) -> *(+(x, a), y)
*(*(x, y), z) -> *(x, *(y, z))
innermost
*'(*(x, *(x'', y'')), z'') -> *'(*(x'', y''), z'')
*(*(x, y), z) -> *(x, *(y, z))
POL(*'(x1, x2)) = 1 + x1 + x2 POL(*(x1, x2)) = 1 + x1 + x2
R
↳DPs
→DP Problem 1
↳FwdInst
→DP Problem 2
↳Polo
...
→DP Problem 3
↳Dependency Graph
+(*(x, y), *(a, y)) -> *(+(x, a), y)
*(*(x, y), z) -> *(x, *(y, z))
innermost