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