R
↳Dependency Pair Analysis
+'(x, +(y, z)) -> +'(+(x, y), z)
+'(x, +(y, z)) -> +'(x, y)
+'(*(x, y), +(x, z)) -> +'(y, z)
+'(*(x, y), +(*(x, z), u)) -> +'(*(x, +(y, z)), u)
+'(*(x, y), +(*(x, z), u)) -> +'(y, z)
R
↳DPs
→DP Problem 1
↳Argument Filtering and Ordering
+'(*(x, y), +(*(x, z), u)) -> +'(y, z)
+'(*(x, y), +(*(x, z), u)) -> +'(*(x, +(y, z)), u)
+'(*(x, y), +(x, z)) -> +'(y, z)
+'(x, +(y, z)) -> +'(x, y)
+'(x, +(y, z)) -> +'(+(x, y), z)
+(x, +(y, z)) -> +(+(x, y), z)
+(*(x, y), +(x, z)) -> *(x, +(y, z))
+(*(x, y), +(*(x, z), u)) -> +(*(x, +(y, z)), u)
+'(*(x, y), +(*(x, z), u)) -> +'(y, z)
+'(*(x, y), +(x, z)) -> +'(y, z)
+(x, +(y, z)) -> +(+(x, y), z)
+(*(x, y), +(x, z)) -> *(x, +(y, z))
+(*(x, y), +(*(x, z), u)) -> +(*(x, +(y, z)), u)
+'(x1, x2) -> x1
+(x1, x2) -> x1
*(x1, x2) -> *(x1, x2)
R
↳DPs
→DP Problem 1
↳AFS
→DP Problem 2
↳Remaining Obligation(s)
+'(*(x, y), +(*(x, z), u)) -> +'(*(x, +(y, z)), u)
+'(x, +(y, z)) -> +'(x, y)
+'(x, +(y, z)) -> +'(+(x, y), z)
+(x, +(y, z)) -> +(+(x, y), z)
+(*(x, y), +(x, z)) -> *(x, +(y, z))
+(*(x, y), +(*(x, z), u)) -> +(*(x, +(y, z)), u)