YES Problem: a(b(x1)) -> b(a(a(x1))) b(c(x1)) -> c(b(x1)) a(a(x1)) -> a(c(a(x1))) Proof: String Reversal Processor: b(a(x1)) -> a(a(b(x1))) c(b(x1)) -> b(c(x1)) a(a(x1)) -> a(c(a(x1))) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [c](x0) = [0 1 1]x0 [0 0 0] , [1 0 1] [1] [a](x0) = [0 1 1]x0 + [1] [0 0 0] [1], [1 1 1] [b](x0) = [1 1 1]x0 [0 0 1] orientation: [1 1 2] [3] [1 1 2] [3] b(a(x1)) = [1 1 2]x1 + [3] >= [1 1 2]x1 + [3] = a(a(b(x1))) [0 0 0] [1] [0 0 0] [1] [1 1 1] [1 1 1] c(b(x1)) = [1 1 2]x1 >= [1 1 1]x1 = b(c(x1)) [0 0 0] [0 0 0] [1 0 1] [3] [1 0 1] [2] a(a(x1)) = [0 1 1]x1 + [3] >= [0 1 1]x1 + [3] = a(c(a(x1))) [0 0 0] [1] [0 0 0] [1] problem: b(a(x1)) -> a(a(b(x1))) c(b(x1)) -> b(c(x1)) String Reversal Processor: a(b(x1)) -> b(a(a(x1))) b(c(x1)) -> c(b(x1)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [c](x0) = [0 0 0]x0 + [1] [0 1 1] [0], [a](x0) = x0 , [1 1 1] [0] [b](x0) = [0 0 0]x0 + [1] [0 1 1] [0] orientation: [1 1 1] [0] [1 1 1] [0] a(b(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = b(a(a(x1))) [0 1 1] [0] [0 1 1] [0] [1 1 1] [1] [1 1 1] [0] b(c(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = c(b(x1)) [0 1 1] [1] [0 1 1] [1] problem: a(b(x1)) -> b(a(a(x1))) KBO Processor: weight function: w0 = 1 w(b) = 1 w(a) = 0 precedence: a > b problem: Qed