YES Problem: f(c(s(x),y)) -> f(c(x,s(y))) f(c(s(x),s(y))) -> g(c(x,y)) g(c(x,s(y))) -> g(c(s(x),y)) g(c(s(x),s(y))) -> f(c(x,y)) Proof: Matrix Interpretation Processor: dim=1 interpretation: [g](x0) = 2x0 + 2, [f](x0) = 2x0, [c](x0, x1) = 2x0 + 2x1, [s](x0) = x0 + 2 orientation: f(c(s(x),y)) = 4x + 4y + 8 >= 4x + 4y + 8 = f(c(x,s(y))) f(c(s(x),s(y))) = 4x + 4y + 16 >= 4x + 4y + 2 = g(c(x,y)) g(c(x,s(y))) = 4x + 4y + 10 >= 4x + 4y + 10 = g(c(s(x),y)) g(c(s(x),s(y))) = 4x + 4y + 18 >= 4x + 4y = f(c(x,y)) problem: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [g](x0) = [1 1 0]x0 [0 0 0] , [1 0 0] [1] [f](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 1 0] [1 0 0] [c](x0, x1) = [0 0 0]x0 + [0 0 1]x1 [0 0 1] [0 1 0] , [0] [s](x0) = x0 + [0] [1] orientation: [1 1 0] [1 0 0] [1] [1 1 0] [1 0 0] [1] f(c(s(x),y)) = [0 0 0]x + [0 0 0]y + [0] >= [0 0 0]x + [0 0 0]y + [0] = f(c(x,s(y))) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1] [1 1 0] [1 0 1] [1] [1 1 0] [1 0 1] g(c(x,s(y))) = [1 1 0]x + [1 0 1]y + [1] >= [1 1 0]x + [1 0 1]y = g(c(s(x),y)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] problem: f(c(s(x),y)) -> f(c(x,s(y))) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [f](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 0 1] [1 0 0] [0] [c](x0, x1) = [0 1 0]x0 + [0 0 0]x1 + [0] [0 0 0] [0 0 0] [1], [1 0 0] [0] [s](x0) = [0 0 1]x0 + [0] [0 0 1] [1] orientation: [1 0 1] [1 0 0] [1] [1 0 1] [1 0 0] [0] f(c(s(x),y)) = [0 0 0]x + [0 0 0]y + [0] >= [0 0 0]x + [0 0 0]y + [0] = f(c(x,s(y))) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1] problem: Qed