/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: active(from(X)) -> mark(cons(X,from(s(X)))) active(length(nil())) -> mark(0()) active(length(cons(X,Y))) -> mark(s(length1(Y))) active(length1(X)) -> mark(length(X)) mark(from(X)) -> active(from(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) mark(length(X)) -> active(length(X)) mark(nil()) -> active(nil()) mark(0()) -> active(0()) mark(length1(X)) -> active(length1(X)) from(mark(X)) -> from(X) from(active(X)) -> from(X) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) length(mark(X)) -> length(X) length(active(X)) -> length(X) length1(mark(X)) -> length1(X) length1(active(X)) -> length1(X) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [mark](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [0] [length1](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 0 1] [active](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [1 0 0] [0] [cons](x0, x1) = [0 0 0]x0 + [1 0 0]x1 + [1] [0 0 0] [0 0 0] [0], [0] [nil] = [0] [0], [1 0 1] [from](x0) = [0 0 0]x0 [1 0 1] , [0] [0] = [0] [0], [1 0 0] [0] [length](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 0 1] [s](x0) = [0 0 0]x0 [0 0 0] orientation: [2 0 2] [2 0 2] active(from(X)) = [0 0 0]X >= [0 0 0]X = mark(cons(X,from(s(X)))) [0 0 0] [0 0 0] [1] [0] active(length(nil())) = [0] >= [0] = mark(0()) [0] [0] [1 0 1] [1 0 0] [1] [1 0 0] [1] active(length(cons(X,Y))) = [0 0 0]X + [0 0 0]Y + [0] >= [0 0 0]Y + [0] = mark(s(length1(Y))) [0 0 0] [0 0 0] [0] [0 0 0] [0] [1 0 0] [1] [1 0 0] [1] active(length1(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(length(X)) [0 0 0] [0] [0 0 0] [0] [2 0 2] [2 0 2] mark(from(X)) = [0 0 0]X >= [0 0 0]X = active(from(mark(X))) [0 0 0] [0 0 0] [1 0 1] [1 0 0] [1 0 1] [1 0 0] mark(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = active(cons(mark(X1),X2)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 1] [1 0 1] mark(s(X)) = [0 0 0]X >= [0 0 0]X = active(s(mark(X))) [0 0 0] [0 0 0] [1 0 0] [1] [1 0 0] [1] mark(length(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = active(length(X)) [0 0 0] [0] [0 0 0] [0] [0] [0] mark(nil()) = [0] >= [0] = active(nil()) [0] [0] [0] [0] mark(0()) = [0] >= [0] = active(0()) [0] [0] [1 0 0] [1] [1 0 0] [1] mark(length1(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = active(length1(X)) [0 0 0] [0] [0 0 0] [0] [1 0 1] [1 0 1] from(mark(X)) = [0 0 0]X >= [0 0 0]X = from(X) [1 0 1] [1 0 1] [1 0 1] [1 0 1] from(active(X)) = [0 0 0]X >= [0 0 0]X = from(X) [1 0 1] [1 0 1] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [0] cons(mark(X1),X2) = [0 0 0]X1 + [1 0 0]X2 + [1] >= [0 0 0]X1 + [1 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 1] [0] [1 0 1] [1 0 0] [0] cons(X1,mark(X2)) = [0 0 0]X1 + [1 0 1]X2 + [1] >= [0 0 0]X1 + [1 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [0] cons(active(X1),X2) = [0 0 0]X1 + [1 0 0]X2 + [1] >= [0 0 0]X1 + [1 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 1] [0] [1 0 1] [1 0 0] [0] cons(X1,active(X2)) = [0 0 0]X1 + [1 0 1]X2 + [1] >= [0 0 0]X1 + [1 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 1] s(mark(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 0 0] [0 0 0] [1 0 1] [1 0 1] s(active(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 0 0] [0 0 0] [1 0 1] [0] [1 0 0] [0] length(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 0] [0] length(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 0] [0] length1(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length1(X) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 0] [0] length1(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length1(X) [0 0 0] [1] [0 0 0] [1] problem: active(from(X)) -> mark(cons(X,from(s(X)))) active(length(cons(X,Y))) -> mark(s(length1(Y))) active(length1(X)) -> mark(length(X)) mark(from(X)) -> active(from(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) mark(length(X)) -> active(length(X)) mark(nil()) -> active(nil()) mark(0()) -> active(0()) mark(length1(X)) -> active(length1(X)) from(mark(X)) -> from(X) from(active(X)) -> from(X) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) length(mark(X)) -> length(X) length(active(X)) -> length(X) length1(mark(X)) -> length1(X) length1(active(X)) -> length1(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [mark](x0) = [1 1 1]x0 [0 0 0] , [1 0 0] [1] [length1](x0) = [0 0 0]x0 + [0] [1 0 0] [0], [1 0 1] [active](x0) = [1 0 1]x0 [0 0 0] , [1 0 1] [1 0 0] [0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [1] [0 0 0] [0 0 0] [0], [0] [nil] = [0] [0], [1 0 1] [1] [from](x0) = [0 0 0]x0 + [0] [1 0 1] [1], [0] [0] = [0] [0], [1 0 0] [0] [length](x0) = [0 0 0]x0 + [0] [1 0 0] [1], [1 0 1] [s](x0) = [0 0 0]x0 [0 0 0] orientation: [2 0 2] [2] [2 0 2] [1] active(from(X)) = [2 0 2]X + [2] >= [2 0 2]X + [2] = mark(cons(X,from(s(X)))) [0 0 0] [0] [0 0 0] [0] [2 0 2] [2 0 0] [1] [2 0 0] [1] active(length(cons(X,Y))) = [2 0 2]X + [2 0 0]Y + [1] >= [2 0 0]Y + [1] = mark(s(length1(Y))) [0 0 0] [0 0 0] [0] [0 0 0] [0] [2 0 0] [1] [2 0 0] [1] active(length1(X)) = [2 0 0]X + [1] >= [2 0 0]X + [1] = mark(length(X)) [0 0 0] [0] [0 0 0] [0] [2 0 2] [2] [2 0 2] [2] mark(from(X)) = [2 0 2]X + [2] >= [2 0 2]X + [2] = active(from(mark(X))) [0 0 0] [0] [0 0 0] [0] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] mark(cons(X1,X2)) = [1 0 1]X1 + [1 0 0]X2 + [1] >= [1 0 1]X1 + [1 0 0]X2 = active(cons(mark(X1),X2)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 0 1] [1 0 1] mark(s(X)) = [1 0 1]X >= [1 0 1]X = active(s(mark(X))) [0 0 0] [0 0 0] [2 0 0] [1] [2 0 0] [1] mark(length(X)) = [2 0 0]X + [1] >= [2 0 0]X + [1] = active(length(X)) [0 0 0] [0] [0 0 0] [0] [0] [0] mark(nil()) = [0] >= [0] = active(nil()) [0] [0] [0] [0] mark(0()) = [0] >= [0] = active(0()) [0] [0] [2 0 0] [1] [2 0 0] [1] mark(length1(X)) = [2 0 0]X + [1] >= [2 0 0]X + [1] = active(length1(X)) [0 0 0] [0] [0 0 0] [0] [1 0 1] [1] [1 0 1] [1] from(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = from(X) [1 0 1] [1] [1 0 1] [1] [1 0 1] [1] [1 0 1] [1] from(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = from(X) [1 0 1] [1] [1 0 1] [1] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [0] cons(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 1] [0] [1 0 1] [1 0 0] [0] cons(X1,mark(X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [0] cons(active(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 1] [0] [1 0 1] [1 0 0] [0] cons(X1,active(X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 0 1] s(mark(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 0 0] [0 0 0] [1 0 1] [1 0 1] s(active(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 0 0] [0 0 0] [1 0 1] [0] [1 0 0] [0] length(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [1 0 1] [1] [1 0 0] [1] [1 0 1] [0] [1 0 0] [0] length(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [1 0 1] [1] [1 0 0] [1] [1 0 1] [1] [1 0 0] [1] length1(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length1(X) [1 0 1] [0] [1 0 0] [0] [1 0 1] [1] [1 0 0] [1] length1(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length1(X) [1 0 1] [0] [1 0 0] [0] problem: active(length(cons(X,Y))) -> mark(s(length1(Y))) active(length1(X)) -> mark(length(X)) mark(from(X)) -> active(from(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) mark(length(X)) -> active(length(X)) mark(nil()) -> active(nil()) mark(0()) -> active(0()) mark(length1(X)) -> active(length1(X)) from(mark(X)) -> from(X) from(active(X)) -> from(X) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) length(mark(X)) -> length(X) length(active(X)) -> length(X) length1(mark(X)) -> length1(X) length1(active(X)) -> length1(X) Matrix Interpretation Processor: dim=1 interpretation: [mark](x0) = x0 + 1, [length1](x0) = x0 + 3, [active](x0) = x0, [cons](x0, x1) = x0 + x1 + 7, [nil] = 1, [from](x0) = x0, [0] = 5, [length](x0) = x0 + 2, [s](x0) = x0 + 5 orientation: active(length(cons(X,Y))) = X + Y + 9 >= Y + 9 = mark(s(length1(Y))) active(length1(X)) = X + 3 >= X + 3 = mark(length(X)) mark(from(X)) = X + 1 >= X + 1 = active(from(mark(X))) mark(cons(X1,X2)) = X1 + X2 + 8 >= X1 + X2 + 8 = active(cons(mark(X1),X2)) mark(s(X)) = X + 6 >= X + 6 = active(s(mark(X))) mark(length(X)) = X + 3 >= X + 2 = active(length(X)) mark(nil()) = 2 >= 1 = active(nil()) mark(0()) = 6 >= 5 = active(0()) mark(length1(X)) = X + 4 >= X + 3 = active(length1(X)) from(mark(X)) = X + 1 >= X = from(X) from(active(X)) = X >= X = from(X) cons(mark(X1),X2) = X1 + X2 + 8 >= X1 + X2 + 7 = cons(X1,X2) cons(X1,mark(X2)) = X1 + X2 + 8 >= X1 + X2 + 7 = cons(X1,X2) cons(active(X1),X2) = X1 + X2 + 7 >= X1 + X2 + 7 = cons(X1,X2) cons(X1,active(X2)) = X1 + X2 + 7 >= X1 + X2 + 7 = cons(X1,X2) s(mark(X)) = X + 6 >= X + 5 = s(X) s(active(X)) = X + 5 >= X + 5 = s(X) length(mark(X)) = X + 3 >= X + 2 = length(X) length(active(X)) = X + 2 >= X + 2 = length(X) length1(mark(X)) = X + 4 >= X + 3 = length1(X) length1(active(X)) = X + 3 >= X + 3 = length1(X) problem: active(length(cons(X,Y))) -> mark(s(length1(Y))) active(length1(X)) -> mark(length(X)) mark(from(X)) -> active(from(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) from(active(X)) -> from(X) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(active(X)) -> s(X) length(active(X)) -> length(X) length1(active(X)) -> length1(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [mark](x0) = [0 0 1]x0 [0 1 0] , [1 0 0] [length1](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [active](x0) = [0 0 1]x0 [0 1 0] , [1 0 0] [1 0 0] [1] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [1] [0 1 1] [0 0 0] [0], [1 0 0] [0] [from](x0) = [0 0 0]x0 + [0] [0 1 1] [1], [1 0 0] [length](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [s](x0) = [0 0 0]x0 [0 1 1] orientation: [1 0 0] [1 0 0] [1] [1 0 0] active(length(cons(X,Y))) = [0 0 0]X + [0 0 0]Y + [0] >= [0 0 0]Y = mark(s(length1(Y))) [0 0 0] [0 0 0] [0] [0 0 0] [1 0 0] [1 0 0] active(length1(X)) = [0 0 0]X >= [0 0 0]X = mark(length(X)) [0 0 0] [0 0 0] [1 1 1] [1] [1 0 1] [0] mark(from(X)) = [0 1 1]X + [1] >= [0 1 1]X + [1] = active(from(mark(X))) [0 0 0] [0] [0 0 0] [0] [1 1 1] [1 0 0] [1] [1 0 1] [1 0 0] [1] mark(cons(X1,X2)) = [0 1 1]X1 + [0 0 0]X2 + [0] >= [0 1 1]X1 + [0 0 0]X2 + [0] = active(cons(mark(X1),X2)) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1] [1 1 1] [1 0 1] mark(s(X)) = [0 1 1]X >= [0 1 1]X = active(s(mark(X))) [0 0 0] [0 0 0] [1 0 0] [0] [1 0 0] [0] from(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = from(X) [0 1 1] [1] [0 1 1] [1] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1] cons(active(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 1 1] [0 0 0] [0] [0 1 1] [0 0 0] [0] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1] cons(X1,active(X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 1 1] [0 0 0] [0] [0 1 1] [0 0 0] [0] [1 0 0] [1 0 0] s(active(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 1 1] [0 1 1] [1 0 0] [1 0 0] length(active(X)) = [0 0 0]X >= [0 0 0]X = length(X) [0 0 0] [0 0 0] [1 0 0] [1 0 0] length1(active(X)) = [0 0 0]X >= [0 0 0]X = length1(X) [0 0 0] [0 0 0] problem: active(length1(X)) -> mark(length(X)) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) from(active(X)) -> from(X) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(active(X)) -> s(X) length(active(X)) -> length(X) length1(active(X)) -> length1(X) Matrix Interpretation Processor: dim=1 interpretation: [mark](x0) = x0, [length1](x0) = 2x0 + 2, [active](x0) = x0, [cons](x0, x1) = x0 + x1, [from](x0) = x0, [length](x0) = x0 + 1, [s](x0) = x0 orientation: active(length1(X)) = 2X + 2 >= X + 1 = mark(length(X)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = active(cons(mark(X1),X2)) mark(s(X)) = X >= X = active(s(mark(X))) from(active(X)) = X >= X = from(X) cons(active(X1),X2) = X1 + X2 >= X1 + X2 = cons(X1,X2) cons(X1,active(X2)) = X1 + X2 >= X1 + X2 = cons(X1,X2) s(active(X)) = X >= X = s(X) length(active(X)) = X + 1 >= X + 1 = length(X) length1(active(X)) = 2X + 2 >= 2X + 2 = length1(X) problem: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(s(X)) -> active(s(mark(X))) from(active(X)) -> from(X) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(active(X)) -> s(X) length(active(X)) -> length(X) length1(active(X)) -> length1(X) Matrix Interpretation Processor: dim=3 interpretation: [1 1 1] [mark](x0) = [0 1 1]x0 [0 0 0] , [1 0 0] [length1](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [active](x0) = [0 1 1]x0 [0 0 0] , [1 0 0] [1 0 0] [0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [1] [0 1 1] [0 0 0] [0], [1 0 0] [from](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [1] [length](x0) = [0 0 0]x0 + [0] [1 0 0] [0], [1 0 0] [0] [s](x0) = [0 1 1]x0 + [0] [0 0 0] [1] orientation: [1 1 1] [1 0 0] [1] [1 1 1] [1 0 0] [0] mark(cons(X1,X2)) = [0 1 1]X1 + [0 0 0]X2 + [1] >= [0 1 1]X1 + [0 0 0]X2 + [1] = active(cons(mark(X1),X2)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 1 1] [1] [1 1 1] [0] mark(s(X)) = [0 1 1]X + [1] >= [0 1 1]X + [1] = active(s(mark(X))) [0 0 0] [0] [0 0 0] [0] [1 0 0] [1 0 0] from(active(X)) = [0 0 0]X >= [0 0 0]X = from(X) [0 0 0] [0 0 0] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] [0] cons(active(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 1 1] [0 0 0] [0] [0 1 1] [0 0 0] [0] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] [0] cons(X1,active(X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(X1,X2) [0 1 1] [0 0 0] [0] [0 1 1] [0 0 0] [0] [1 0 0] [0] [1 0 0] [0] s(active(X)) = [0 1 1]X + [0] >= [0 1 1]X + [0] = s(X) [0 0 0] [1] [0 0 0] [1] [1 0 0] [1] [1 0 0] [1] length(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [1 0 0] [0] [1 0 0] [0] [1 0 0] [1 0 0] length1(active(X)) = [0 0 0]X >= [0 0 0]X = length1(X) [0 0 0] [0 0 0] problem: from(active(X)) -> from(X) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) s(active(X)) -> s(X) length(active(X)) -> length(X) length1(active(X)) -> length1(X) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [length1](x0) = [0 0 0]x0 [0 0 0] , [0] [active](x0) = x0 + [1] [1], [1 0 1] [1 0 1] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 0 1] [from](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [0] [length](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 0 1] [s](x0) = [0 0 0]x0 [0 0 0] orientation: [1 0 1] [1] [1 0 1] from(active(X)) = [0 0 0]X + [0] >= [0 0 0]X = from(X) [0 0 0] [0] [0 0 0] [1 0 1] [1 0 1] [1] [1 0 1] [1 0 1] cons(active(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 0 1] [1 0 1] [1] [1 0 1] [1 0 1] cons(X1,active(X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [1 0 1] [1] [1 0 1] s(active(X)) = [0 0 0]X + [0] >= [0 0 0]X = s(X) [0 0 0] [0] [0 0 0] [1 0 1] [1] [1 0 1] [0] length(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [0 0 0] [1] [0 0 0] [1] [1 1 0] [1] [1 1 0] length1(active(X)) = [0 0 0]X + [0] >= [0 0 0]X = length1(X) [0 0 0] [0] [0 0 0] problem: Qed