MAYBE Problem: h(1(1(x1))) -> 1(h(x1)) 1(1(h(b(x1)))) -> 1(1(s(b(x1)))) 1(s(x1)) -> s(1(x1)) b(s(x1)) -> b(h(x1)) h(1(b(x1))) -> t(1(1(b(x1)))) 1(t(x1)) -> t(1(1(1(x1)))) b(t(x1)) -> b(h(x1)) Proof: Complexity Transformation Processor: strict: h(1(1(x1))) -> 1(h(x1)) 1(1(h(b(x1)))) -> 1(1(s(b(x1)))) 1(s(x1)) -> s(1(x1)) b(s(x1)) -> b(h(x1)) h(1(b(x1))) -> t(1(1(b(x1)))) 1(t(x1)) -> t(1(1(1(x1)))) b(t(x1)) -> b(h(x1)) weak: Matrix Interpretation Processor: dimension: 1 max_matrix: 1 interpretation: [t](x0) = x0 + 1, [s](x0) = x0, [b](x0) = x0, [h](x0) = x0, [1](x0) = x0 orientation: h(1(1(x1))) = x1 >= x1 = 1(h(x1)) 1(1(h(b(x1)))) = x1 >= x1 = 1(1(s(b(x1)))) 1(s(x1)) = x1 >= x1 = s(1(x1)) b(s(x1)) = x1 >= x1 = b(h(x1)) h(1(b(x1))) = x1 >= x1 + 1 = t(1(1(b(x1)))) 1(t(x1)) = x1 + 1 >= x1 + 1 = t(1(1(1(x1)))) b(t(x1)) = x1 + 1 >= x1 = b(h(x1)) problem: strict: h(1(1(x1))) -> 1(h(x1)) 1(1(h(b(x1)))) -> 1(1(s(b(x1)))) 1(s(x1)) -> s(1(x1)) b(s(x1)) -> b(h(x1)) h(1(b(x1))) -> t(1(1(b(x1)))) 1(t(x1)) -> t(1(1(1(x1)))) weak: b(t(x1)) -> b(h(x1)) Matrix Interpretation Processor: dimension: 1 max_matrix: 1 interpretation: [t](x0) = x0 + 1, [s](x0) = x0, [b](x0) = x0, [h](x0) = x0 + 1, [1](x0) = x0 orientation: h(1(1(x1))) = x1 + 1 >= x1 + 1 = 1(h(x1)) 1(1(h(b(x1)))) = x1 + 1 >= x1 = 1(1(s(b(x1)))) 1(s(x1)) = x1 >= x1 = s(1(x1)) b(s(x1)) = x1 >= x1 + 1 = b(h(x1)) h(1(b(x1))) = x1 + 1 >= x1 + 1 = t(1(1(b(x1)))) 1(t(x1)) = x1 + 1 >= x1 + 1 = t(1(1(1(x1)))) b(t(x1)) = x1 + 1 >= x1 + 1 = b(h(x1)) problem: strict: h(1(1(x1))) -> 1(h(x1)) 1(s(x1)) -> s(1(x1)) b(s(x1)) -> b(h(x1)) h(1(b(x1))) -> t(1(1(b(x1)))) 1(t(x1)) -> t(1(1(1(x1)))) weak: 1(1(h(b(x1)))) -> 1(1(s(b(x1)))) b(t(x1)) -> b(h(x1)) Matrix Interpretation Processor: dimension: 1 max_matrix: 1 interpretation: [t](x0) = x0, [s](x0) = x0, [b](x0) = x0, [h](x0) = x0, [1](x0) = x0 + 1 orientation: h(1(1(x1))) = x1 + 2 >= x1 + 1 = 1(h(x1)) 1(s(x1)) = x1 + 1 >= x1 + 1 = s(1(x1)) b(s(x1)) = x1 >= x1 = b(h(x1)) h(1(b(x1))) = x1 + 1 >= x1 + 2 = t(1(1(b(x1)))) 1(t(x1)) = x1 + 1 >= x1 + 3 = t(1(1(1(x1)))) 1(1(h(b(x1)))) = x1 + 2 >= x1 + 2 = 1(1(s(b(x1)))) b(t(x1)) = x1 >= x1 = b(h(x1)) problem: strict: 1(s(x1)) -> s(1(x1)) b(s(x1)) -> b(h(x1)) h(1(b(x1))) -> t(1(1(b(x1)))) 1(t(x1)) -> t(1(1(1(x1)))) weak: h(1(1(x1))) -> 1(h(x1)) 1(1(h(b(x1)))) -> 1(1(s(b(x1)))) b(t(x1)) -> b(h(x1)) Open