MAYBE Problem: b(b(x1)) -> b(a(x1)) a(b(x1)) -> b(c(c(x1))) a(c(x1)) -> a(a(x1)) c(a(x1)) -> b(a(a(x1))) Proof: RT Transformation Processor: strict: b(b(x1)) -> b(a(x1)) a(b(x1)) -> b(c(c(x1))) a(c(x1)) -> a(a(x1)) c(a(x1)) -> b(a(a(x1))) weak: Matrix Interpretation Processor: dimension: 1 interpretation: [c](x0) = x0 + 17, [a](x0) = x0 + 4, [b](x0) = x0 + 10 orientation: b(b(x1)) = x1 + 20 >= x1 + 14 = b(a(x1)) a(b(x1)) = x1 + 14 >= x1 + 44 = b(c(c(x1))) a(c(x1)) = x1 + 21 >= x1 + 8 = a(a(x1)) c(a(x1)) = x1 + 21 >= x1 + 18 = b(a(a(x1))) problem: strict: a(b(x1)) -> b(c(c(x1))) weak: b(b(x1)) -> b(a(x1)) a(c(x1)) -> a(a(x1)) c(a(x1)) -> b(a(a(x1))) Open