YES Problem: minus(0()) -> 0() +(x,0()) -> x +(0(),y) -> y +(minus(1()),1()) -> 0() minus(minus(x)) -> x +(x,minus(y)) -> minus(+(minus(x),y)) +(x,+(y,z)) -> +(+(x,y),z) +(minus(+(x,1())),1()) -> minus(x) Proof: DP Processor: DPs: +#(x,minus(y)) -> minus#(x) +#(x,minus(y)) -> +#(minus(x),y) +#(x,minus(y)) -> minus#(+(minus(x),y)) +#(x,+(y,z)) -> +#(x,y) +#(x,+(y,z)) -> +#(+(x,y),z) +#(minus(+(x,1())),1()) -> minus#(x) TRS: minus(0()) -> 0() +(x,0()) -> x +(0(),y) -> y +(minus(1()),1()) -> 0() minus(minus(x)) -> x +(x,minus(y)) -> minus(+(minus(x),y)) +(x,+(y,z)) -> +(+(x,y),z) +(minus(+(x,1())),1()) -> minus(x) Matrix Interpretation Processor: dim=1 usable rules: minus(0()) -> 0() +(x,0()) -> x +(0(),y) -> y +(minus(1()),1()) -> 0() minus(minus(x)) -> x +(x,minus(y)) -> minus(+(minus(x),y)) +(x,+(y,z)) -> +(+(x,y),z) +(minus(+(x,1())),1()) -> minus(x) interpretation: [+#](x0, x1) = x0 + 4x1 + 7, [minus#](x0) = x0 + 2, [1] = 1, [+](x0, x1) = x0 + 4x1 + 5, [minus](x0) = x0 + 1, [0] = 6 orientation: +#(x,minus(y)) = x + 4y + 11 >= x + 2 = minus#(x) +#(x,minus(y)) = x + 4y + 11 >= x + 4y + 8 = +#(minus(x),y) +#(x,minus(y)) = x + 4y + 11 >= x + 4y + 8 = minus#(+(minus(x),y)) +#(x,+(y,z)) = x + 4y + 16z + 27 >= x + 4y + 7 = +#(x,y) +#(x,+(y,z)) = x + 4y + 16z + 27 >= x + 4y + 4z + 12 = +#(+(x,y),z) +#(minus(+(x,1())),1()) = x + 21 >= x + 2 = minus#(x) minus(0()) = 7 >= 6 = 0() +(x,0()) = x + 29 >= x = x +(0(),y) = 4y + 11 >= y = y +(minus(1()),1()) = 11 >= 6 = 0() minus(minus(x)) = x + 2 >= x = x +(x,minus(y)) = x + 4y + 9 >= x + 4y + 7 = minus(+(minus(x),y)) +(x,+(y,z)) = x + 4y + 16z + 25 >= x + 4y + 4z + 10 = +(+(x,y),z) +(minus(+(x,1())),1()) = x + 19 >= x + 1 = minus(x) problem: DPs: TRS: minus(0()) -> 0() +(x,0()) -> x +(0(),y) -> y +(minus(1()),1()) -> 0() minus(minus(x)) -> x +(x,minus(y)) -> minus(+(minus(x),y)) +(x,+(y,z)) -> +(+(x,y),z) +(minus(+(x,1())),1()) -> minus(x) Qed