YES Problem: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) Proof: DP Processor: DPs: +#(+(x,y),z) -> +#(y,z) +#(+(x,y),z) -> +#(x,+(y,z)) +#(f(x),f(y)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) EDG Processor: DPs: +#(+(x,y),z) -> +#(y,z) +#(+(x,y),z) -> +#(x,+(y,z)) +#(f(x),f(y)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) graph: +#(f(x),f(y)) -> +#(x,y) -> +#(+(x,y),z) -> +#(y,z) +#(f(x),f(y)) -> +#(x,y) -> +#(+(x,y),z) -> +#(x,+(y,z)) +#(f(x),f(y)) -> +#(x,y) -> +#(f(x),f(y)) -> +#(x,y) +#(f(x),f(y)) -> +#(x,y) -> +#(f(x),+(f(y),z)) -> +#(x,y) +#(f(x),f(y)) -> +#(x,y) -> +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) -> +#(f(x),f(y)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) -> +#(f(x),+(f(y),z)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) -> +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) +#(f(x),+(f(y),z)) -> +#(x,y) -> +#(+(x,y),z) -> +#(y,z) +#(f(x),+(f(y),z)) -> +#(x,y) -> +#(+(x,y),z) -> +#(x,+(y,z)) +#(f(x),+(f(y),z)) -> +#(x,y) -> +#(f(x),f(y)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(x,y) -> +#(f(x),+(f(y),z)) -> +#(x,y) +#(f(x),+(f(y),z)) -> +#(x,y) -> +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) +#(+(x,y),z) -> +#(y,z) -> +#(+(x,y),z) -> +#(y,z) +#(+(x,y),z) -> +#(y,z) -> +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) -> +#(f(x),f(y)) -> +#(x,y) +#(+(x,y),z) -> +#(y,z) -> +#(f(x),+(f(y),z)) -> +#(x,y) +#(+(x,y),z) -> +#(y,z) -> +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) +#(+(x,y),z) -> +#(x,+(y,z)) -> +#(+(x,y),z) -> +#(y,z) +#(+(x,y),z) -> +#(x,+(y,z)) -> +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(x,+(y,z)) -> +#(f(x),f(y)) -> +#(x,y) +#(+(x,y),z) -> +#(x,+(y,z)) -> +#(f(x),+(f(y),z)) -> +#(x,y) +#(+(x,y),z) -> +#(x,+(y,z)) -> +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) Arctic Interpretation Processor: dimension: 1 interpretation: [+#](x0, x1) = x0 + x1 + 3, [f](x0) = 1x0 + 4, [+](x0, x1) = x0 + x1 + 3 orientation: +#(+(x,y),z) = x + y + z + 3 >= y + z + 3 = +#(y,z) +#(+(x,y),z) = x + y + z + 3 >= x + y + z + 3 = +#(x,+(y,z)) +#(f(x),f(y)) = 1x + 1y + 4 >= x + y + 3 = +#(x,y) +#(f(x),+(f(y),z)) = 1x + 1y + z + 4 >= x + y + 3 = +#(x,y) +#(f(x),+(f(y),z)) = 1x + 1y + z + 4 >= 1x + 1y + z + 4 = +#(f(+(x,y)),z) +(+(x,y),z) = x + y + z + 3 >= x + y + z + 3 = +(x,+(y,z)) +(f(x),f(y)) = 1x + 1y + 4 >= 1x + 1y + 4 = f(+(x,y)) +(f(x),+(f(y),z)) = 1x + 1y + z + 4 >= 1x + 1y + z + 4 = +(f(+(x,y)),z) problem: DPs: +#(+(x,y),z) -> +#(y,z) +#(+(x,y),z) -> +#(x,+(y,z)) +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) SCC Processor: #sccs: 2 #rules: 3 #arcs: 23/9 DPs: +#(+(x,y),z) -> +#(y,z) +#(+(x,y),z) -> +#(x,+(y,z)) TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) Subterm Criterion Processor: simple projection: pi(+#) = 0 problem: DPs: TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) Qed DPs: +#(f(x),+(f(y),z)) -> +#(f(+(x,y)),z) TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) Subterm Criterion Processor: simple projection: pi(+#) = 1 problem: DPs: TRS: +(+(x,y),z) -> +(x,+(y,z)) +(f(x),f(y)) -> f(+(x,y)) +(f(x),+(f(y),z)) -> +(f(+(x,y)),z) Qed