/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: a__pairNs() -> cons(0(),incr(oddNs())) a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__take(0(),XS) -> nil() a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) a__zip(nil(),XS) -> nil() a__zip(X,nil()) -> nil() a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__tail(cons(X,XS)) -> mark(XS) a__repItems(nil()) -> nil() a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(oddNs()) -> a__oddNs() mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) -> a__zip(mark(X1),mark(X2)) mark(tail(X)) -> a__tail(mark(X)) mark(repItems(X)) -> a__repItems(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() mark(pair(X1,X2)) -> pair(mark(X1),mark(X2)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) a__oddNs() -> oddNs() a__take(X1,X2) -> take(X1,X2) a__zip(X1,X2) -> zip(X1,X2) a__tail(X) -> tail(X) a__repItems(X) -> repItems(X) Proof: Matrix Interpretation Processor: dim=1 interpretation: [tail](x0) = 2x0 + 1, [pairNs] = 0, [repItems](x0) = 2x0, [a__repItems](x0) = 2x0, [a__tail](x0) = 2x0 + 1, [zip](x0, x1) = 2x0 + x1 + 4, [pair](x0, x1) = x0 + x1, [a__zip](x0, x1) = 2x0 + x1 + 4, [take](x0, x1) = x0 + x1, [nil] = 0, [a__take](x0, x1) = x0 + x1, [s](x0) = 2x0, [mark](x0) = x0, [a__incr](x0) = 2x0, [a__oddNs] = 0, [cons](x0, x1) = x0 + x1, [incr](x0) = 2x0, [oddNs] = 0, [0] = 0, [a__pairNs] = 0 orientation: a__pairNs() = 0 >= 0 = cons(0(),incr(oddNs())) a__oddNs() = 0 >= 0 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 2X + 2XS >= 2X + 2XS = cons(s(mark(X)),incr(XS)) a__take(0(),XS) = XS >= 0 = nil() a__take(s(N),cons(X,XS)) = 2N + X + XS >= N + X + XS = cons(mark(X),take(N,XS)) a__zip(nil(),XS) = XS + 4 >= 0 = nil() a__zip(X,nil()) = 2X + 4 >= 0 = nil() a__zip(cons(X,XS),cons(Y,YS)) = 2X + 2XS + Y + YS + 4 >= X + 2XS + Y + YS + 4 = cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__tail(cons(X,XS)) = 2X + 2XS + 1 >= XS = mark(XS) a__repItems(nil()) = 0 >= 0 = nil() a__repItems(cons(X,XS)) = 2X + 2XS >= 2X + 2XS = cons(mark(X),cons(X,repItems(XS))) mark(pairNs()) = 0 >= 0 = a__pairNs() mark(incr(X)) = 2X >= 2X = a__incr(mark(X)) mark(oddNs()) = 0 >= 0 = a__oddNs() mark(take(X1,X2)) = X1 + X2 >= X1 + X2 = a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = a__zip(mark(X1),mark(X2)) mark(tail(X)) = 2X + 1 >= 2X + 1 = a__tail(mark(X)) mark(repItems(X)) = 2X >= 2X = a__repItems(mark(X)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 2X >= 2X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() mark(pair(X1,X2)) = X1 + X2 >= X1 + X2 = pair(mark(X1),mark(X2)) a__pairNs() = 0 >= 0 = pairNs() a__incr(X) = 2X >= 2X = incr(X) a__oddNs() = 0 >= 0 = oddNs() a__take(X1,X2) = X1 + X2 >= X1 + X2 = take(X1,X2) a__zip(X1,X2) = 2X1 + X2 + 4 >= 2X1 + X2 + 4 = zip(X1,X2) a__tail(X) = 2X + 1 >= 2X + 1 = tail(X) a__repItems(X) = 2X >= 2X = repItems(X) problem: a__pairNs() -> cons(0(),incr(oddNs())) a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__take(0(),XS) -> nil() a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__repItems(nil()) -> nil() a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(oddNs()) -> a__oddNs() mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) -> a__zip(mark(X1),mark(X2)) mark(tail(X)) -> a__tail(mark(X)) mark(repItems(X)) -> a__repItems(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() mark(pair(X1,X2)) -> pair(mark(X1),mark(X2)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) a__oddNs() -> oddNs() a__take(X1,X2) -> take(X1,X2) a__zip(X1,X2) -> zip(X1,X2) a__tail(X) -> tail(X) a__repItems(X) -> repItems(X) Matrix Interpretation Processor: dim=1 interpretation: [tail](x0) = x0, [pairNs] = 0, [repItems](x0) = 5x0, [a__repItems](x0) = 5x0, [a__tail](x0) = x0, [zip](x0, x1) = 4x0 + 4x1 + 2, [pair](x0, x1) = x0 + x1 + 2, [a__zip](x0, x1) = 4x0 + 4x1 + 6, [take](x0, x1) = x0 + 4x1 + 1, [nil] = 1, [a__take](x0, x1) = x0 + 4x1 + 2, [s](x0) = x0, [mark](x0) = 4x0, [a__incr](x0) = 4x0, [a__oddNs] = 0, [cons](x0, x1) = 2x0 + x1, [incr](x0) = 4x0, [oddNs] = 0, [0] = 0, [a__pairNs] = 0 orientation: a__pairNs() = 0 >= 0 = cons(0(),incr(oddNs())) a__oddNs() = 0 >= 0 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 8X + 4XS >= 8X + 4XS = cons(s(mark(X)),incr(XS)) a__take(0(),XS) = 4XS + 2 >= 1 = nil() a__take(s(N),cons(X,XS)) = N + 8X + 4XS + 2 >= N + 8X + 4XS + 1 = cons(mark(X),take(N,XS)) a__zip(cons(X,XS),cons(Y,YS)) = 8X + 4XS + 8Y + 4YS + 6 >= 8X + 4XS + 8Y + 4YS + 6 = cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__repItems(nil()) = 5 >= 1 = nil() a__repItems(cons(X,XS)) = 10X + 5XS >= 10X + 5XS = cons(mark(X),cons(X,repItems(XS))) mark(pairNs()) = 0 >= 0 = a__pairNs() mark(incr(X)) = 16X >= 16X = a__incr(mark(X)) mark(oddNs()) = 0 >= 0 = a__oddNs() mark(take(X1,X2)) = 4X1 + 16X2 + 4 >= 4X1 + 16X2 + 2 = a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) = 16X1 + 16X2 + 8 >= 16X1 + 16X2 + 6 = a__zip(mark(X1),mark(X2)) mark(tail(X)) = 4X >= 4X = a__tail(mark(X)) mark(repItems(X)) = 20X >= 20X = a__repItems(mark(X)) mark(cons(X1,X2)) = 8X1 + 4X2 >= 8X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 4X >= 4X = s(mark(X)) mark(nil()) = 4 >= 1 = nil() mark(pair(X1,X2)) = 4X1 + 4X2 + 8 >= 4X1 + 4X2 + 2 = pair(mark(X1),mark(X2)) a__pairNs() = 0 >= 0 = pairNs() a__incr(X) = 4X >= 4X = incr(X) a__oddNs() = 0 >= 0 = oddNs() a__take(X1,X2) = X1 + 4X2 + 2 >= X1 + 4X2 + 1 = take(X1,X2) a__zip(X1,X2) = 4X1 + 4X2 + 6 >= 4X1 + 4X2 + 2 = zip(X1,X2) a__tail(X) = X >= X = tail(X) a__repItems(X) = 5X >= 5X = repItems(X) problem: a__pairNs() -> cons(0(),incr(oddNs())) a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(oddNs()) -> a__oddNs() mark(tail(X)) -> a__tail(mark(X)) mark(repItems(X)) -> a__repItems(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) a__oddNs() -> oddNs() a__tail(X) -> tail(X) a__repItems(X) -> repItems(X) Matrix Interpretation Processor: dim=1 interpretation: [tail](x0) = 2x0 + 2, [pairNs] = 0, [repItems](x0) = 3x0 + 2, [a__repItems](x0) = 3x0 + 3, [a__tail](x0) = 2x0 + 2, [zip](x0, x1) = 4x0 + 4x1, [pair](x0, x1) = 2x0 + 2x1 + 1, [a__zip](x0, x1) = 4x0 + 7x1 + 4, [s](x0) = x0, [mark](x0) = 2x0, [a__incr](x0) = 2x0, [a__oddNs] = 0, [cons](x0, x1) = 4x0 + x1, [incr](x0) = 2x0, [oddNs] = 0, [0] = 0, [a__pairNs] = 0 orientation: a__pairNs() = 0 >= 0 = cons(0(),incr(oddNs())) a__oddNs() = 0 >= 0 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 8X + 2XS >= 8X + 2XS = cons(s(mark(X)),incr(XS)) a__zip(cons(X,XS),cons(Y,YS)) = 16X + 4XS + 28Y + 7YS + 4 >= 16X + 4XS + 16Y + 4YS + 4 = cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__repItems(cons(X,XS)) = 12X + 3XS + 3 >= 12X + 3XS + 2 = cons(mark(X),cons(X,repItems(XS))) mark(pairNs()) = 0 >= 0 = a__pairNs() mark(incr(X)) = 4X >= 4X = a__incr(mark(X)) mark(oddNs()) = 0 >= 0 = a__oddNs() mark(tail(X)) = 4X + 4 >= 4X + 2 = a__tail(mark(X)) mark(repItems(X)) = 6X + 4 >= 6X + 3 = a__repItems(mark(X)) mark(cons(X1,X2)) = 8X1 + 2X2 >= 8X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 2X >= 2X = s(mark(X)) a__pairNs() = 0 >= 0 = pairNs() a__incr(X) = 2X >= 2X = incr(X) a__oddNs() = 0 >= 0 = oddNs() a__tail(X) = 2X + 2 >= 2X + 2 = tail(X) a__repItems(X) = 3X + 3 >= 3X + 2 = repItems(X) problem: a__pairNs() -> cons(0(),incr(oddNs())) a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(oddNs()) -> a__oddNs() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) a__oddNs() -> oddNs() a__tail(X) -> tail(X) Matrix Interpretation Processor: dim=1 interpretation: [tail](x0) = x0, [pairNs] = 0, [a__tail](x0) = 4x0 + 4, [zip](x0, x1) = 2x0 + x1, [pair](x0, x1) = 4x0 + 2x1, [a__zip](x0, x1) = 4x0 + 4x1 + 4, [s](x0) = 2x0, [mark](x0) = x0, [a__incr](x0) = 2x0, [a__oddNs] = 0, [cons](x0, x1) = 4x0 + 2x1, [incr](x0) = 2x0, [oddNs] = 0, [0] = 0, [a__pairNs] = 0 orientation: a__pairNs() = 0 >= 0 = cons(0(),incr(oddNs())) a__oddNs() = 0 >= 0 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 8X + 4XS >= 8X + 4XS = cons(s(mark(X)),incr(XS)) a__zip(cons(X,XS),cons(Y,YS)) = 16X + 8XS + 16Y + 8YS + 4 >= 16X + 4XS + 8Y + 2YS = cons(pair(mark(X),mark(Y)),zip(XS,YS)) mark(pairNs()) = 0 >= 0 = a__pairNs() mark(incr(X)) = 2X >= 2X = a__incr(mark(X)) mark(oddNs()) = 0 >= 0 = a__oddNs() mark(cons(X1,X2)) = 4X1 + 2X2 >= 4X1 + 2X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(s(X)) = 2X >= 2X = s(mark(X)) a__pairNs() = 0 >= 0 = pairNs() a__incr(X) = 2X >= 2X = incr(X) a__oddNs() = 0 >= 0 = oddNs() a__tail(X) = 4X + 4 >= X = tail(X) problem: a__pairNs() -> cons(0(),incr(oddNs())) a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(oddNs()) -> a__oddNs() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) a__oddNs() -> oddNs() Matrix Interpretation Processor: dim=3 interpretation: [1] [pairNs] = [0] [0], [s](x0) = x0 , [1 1 0] [mark](x0) = [0 1 0]x0 [0 0 1] , [1 0 1] [a__incr](x0) = [0 1 0]x0 [0 0 1] , [1] [a__oddNs] = [1] [0], [1 0 0] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [0 0 1]x1 [0 1 0] [0 0 1] , [1 0 1] [incr](x0) = [0 1 0]x0 [0 0 1] , [0] [oddNs] = [1] [0], [0] [0] = [0] [0], [1] [a__pairNs] = [0] [0] orientation: [1] [0] a__pairNs() = [0] >= [0] = cons(0(),incr(oddNs())) [0] [0] [1] [1] a__oddNs() = [1] >= [0] = a__incr(a__pairNs()) [0] [0] [1 1 0] [1 0 1] [1 1 0] [1 0 1] a__incr(cons(X,XS)) = [0 1 0]X + [0 0 1]XS >= [0 1 0]X + [0 0 1]XS = cons(s(mark(X)),incr(XS)) [0 1 0] [0 0 1] [0 1 0] [0 0 1] [1] [1] mark(pairNs()) = [0] >= [0] = a__pairNs() [0] [0] [1 1 1] [1 1 1] mark(incr(X)) = [0 1 0]X >= [0 1 0]X = a__incr(mark(X)) [0 0 1] [0 0 1] [1] [1] mark(oddNs()) = [1] >= [1] = a__oddNs() [0] [0] [1 1 0] [1 0 1] [1 1 0] [1 0 0] mark(cons(X1,X2)) = [0 1 0]X1 + [0 0 1]X2 >= [0 1 0]X1 + [0 0 1]X2 = cons(mark(X1),X2) [0 1 0] [0 0 1] [0 1 0] [0 0 1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [1 1 0] [1 1 0] mark(s(X)) = [0 1 0]X >= [0 1 0]X = s(mark(X)) [0 0 1] [0 0 1] [1] [1] a__pairNs() = [0] >= [0] = pairNs() [0] [0] [1 0 1] [1 0 1] a__incr(X) = [0 1 0]X >= [0 1 0]X = incr(X) [0 0 1] [0 0 1] [1] [0] a__oddNs() = [1] >= [1] = oddNs() [0] [0] problem: a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(oddNs()) -> a__oddNs() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=1 interpretation: [pairNs] = 0, [s](x0) = x0, [mark](x0) = x0, [a__incr](x0) = x0 + 2, [a__oddNs] = 2, [cons](x0, x1) = 4x0 + x1, [incr](x0) = x0 + 2, [oddNs] = 6, [0] = 0, [a__pairNs] = 0 orientation: a__oddNs() = 2 >= 2 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 4X + XS + 2 >= 4X + XS + 2 = cons(s(mark(X)),incr(XS)) mark(pairNs()) = 0 >= 0 = a__pairNs() mark(incr(X)) = X + 2 >= X + 2 = a__incr(mark(X)) mark(oddNs()) = 6 >= 2 = a__oddNs() mark(cons(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(s(X)) = X >= X = s(mark(X)) a__pairNs() = 0 >= 0 = pairNs() a__incr(X) = X + 2 >= X + 2 = incr(X) problem: a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(pairNs()) -> a__pairNs() mark(incr(X)) -> a__incr(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=1 interpretation: [pairNs] = 1, [s](x0) = x0, [mark](x0) = 2x0, [a__incr](x0) = 4x0, [a__oddNs] = 4, [cons](x0, x1) = 4x0 + 2x1, [incr](x0) = 4x0, [0] = 4, [a__pairNs] = 1 orientation: a__oddNs() = 4 >= 4 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 16X + 8XS >= 8X + 8XS = cons(s(mark(X)),incr(XS)) mark(pairNs()) = 2 >= 1 = a__pairNs() mark(incr(X)) = 8X >= 8X = a__incr(mark(X)) mark(cons(X1,X2)) = 8X1 + 4X2 >= 8X1 + 2X2 = cons(mark(X1),X2) mark(0()) = 8 >= 4 = 0() mark(s(X)) = 2X >= 2X = s(mark(X)) a__pairNs() = 1 >= 1 = pairNs() a__incr(X) = 4X >= 4X = incr(X) problem: a__oddNs() -> a__incr(a__pairNs()) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) mark(incr(X)) -> a__incr(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=1 interpretation: [pairNs] = 0, [s](x0) = x0, [mark](x0) = 3x0, [a__incr](x0) = 4x0, [a__oddNs] = 2, [cons](x0, x1) = 6x0 + 2x1 + 6, [incr](x0) = 4x0, [a__pairNs] = 0 orientation: a__oddNs() = 2 >= 0 = a__incr(a__pairNs()) a__incr(cons(X,XS)) = 24X + 8XS + 24 >= 18X + 8XS + 6 = cons(s(mark(X)),incr(XS)) mark(incr(X)) = 12X >= 12X = a__incr(mark(X)) mark(cons(X1,X2)) = 18X1 + 6X2 + 18 >= 18X1 + 2X2 + 6 = cons(mark(X1),X2) mark(s(X)) = 3X >= 3X = s(mark(X)) a__pairNs() = 0 >= 0 = pairNs() a__incr(X) = 4X >= 4X = incr(X) problem: mark(incr(X)) -> a__incr(mark(X)) mark(s(X)) -> s(mark(X)) a__pairNs() -> pairNs() a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [0] [pairNs] = [0] [0], [1 0 0] [s](x0) = [0 1 0]x0 [0 0 0] , [1 1 0] [0] [mark](x0) = [0 1 0]x0 + [0] [1 0 1] [1], [1 0 0] [0] [a__incr](x0) = [0 1 0]x0 + [1] [0 1 1] [0], [1 0 0] [0] [incr](x0) = [0 1 0]x0 + [1] [0 1 1] [0], [1] [a__pairNs] = [0] [0] orientation: [1 1 0] [1] [1 1 0] [0] mark(incr(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = a__incr(mark(X)) [1 1 1] [1] [1 1 1] [1] [1 1 0] [0] [1 1 0] mark(s(X)) = [0 1 0]X + [0] >= [0 1 0]X = s(mark(X)) [1 0 0] [1] [0 0 0] [1] [0] a__pairNs() = [0] >= [0] = pairNs() [0] [0] [1 0 0] [0] [1 0 0] [0] a__incr(X) = [0 1 0]X + [1] >= [0 1 0]X + [1] = incr(X) [0 1 1] [0] [0 1 1] [0] problem: mark(s(X)) -> s(mark(X)) a__incr(X) -> incr(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [s](x0) = [0 0 0]x0 + [0] [0 0 1] [1], [1 0 1] [mark](x0) = [0 0 1]x0 [0 0 1] , [1 0 0] [1] [a__incr](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [incr](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 1] [1] [1 0 1] [0] mark(s(X)) = [0 0 1]X + [1] >= [0 0 0]X + [0] = s(mark(X)) [0 0 1] [1] [0 0 1] [1] [1 0 0] [1] [1 0 0] a__incr(X) = [0 0 0]X + [0] >= [0 0 0]X = incr(X) [0 0 0] [0] [0 0 0] problem: Qed