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