YES Problem: active(f(0())) -> mark(cons(0(),f(s(0())))) active(f(s(0()))) -> mark(f(p(s(0())))) active(p(s(X))) -> mark(X) active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) f(mark(X)) -> mark(f(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(p(X)) -> p(proper(X)) f(ok(X)) -> ok(f(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) p(ok(X)) -> ok(p(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 1] [0 0 0] , [ok](x0) = x0 , [1 0 0] [f](x0) = [0 0 0]x0 [0 1 1] , [s](x0) = x0 , [1 1 1] [mark](x0) = [0 0 0]x0 [0 0 0] , [0] [0] = [1] [0], [proper](x0) = x0 , [1 0 1] [0] [top](x0) = [0 0 0]x0 + [1] [0 0 0] [1], [1 0 0] [p](x0) = [0 0 0]x0 [0 1 1] , [1 0 1] [active](x0) = [0 0 0]x0 [0 0 0] orientation: [1] [0] active(f(0())) = [0] >= [0] = mark(cons(0(),f(s(0())))) [0] [0] [1] [1] active(f(s(0()))) = [0] >= [0] = mark(f(p(s(0())))) [0] [0] [1 1 1] [1 1 1] active(p(s(X))) = [0 0 0]X >= [0 0 0]X = mark(X) [0 0 0] [0 0 0] [1 1 1] [1 0 1] active(f(X)) = [0 0 0]X >= [0 0 0]X = f(active(X)) [0 0 0] [0 0 0] [1 0 1] [1 0 0] [1 0 1] [1 0 0] active(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(active(X1),X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 1] [1 0 1] active(s(X)) = [0 0 0]X >= [0 0 0]X = s(active(X)) [0 0 0] [0 0 0] [1 1 1] [1 0 1] active(p(X)) = [0 0 0]X >= [0 0 0]X = p(active(X)) [0 0 0] [0 0 0] [1 1 1] [1 1 1] f(mark(X)) = [0 0 0]X >= [0 0 0]X = mark(f(X)) [0 0 0] [0 0 0] [1 1 1] [1 0 0] [1 0 1] [1 0 0] cons(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = mark(cons(X1,X2)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 1 1] [1 1 1] s(mark(X)) = [0 0 0]X >= [0 0 0]X = mark(s(X)) [0 0 0] [0 0 0] [1 1 1] [1 1 1] p(mark(X)) = [0 0 0]X >= [0 0 0]X = mark(p(X)) [0 0 0] [0 0 0] [1 0 0] [1 0 0] proper(f(X)) = [0 0 0]X >= [0 0 0]X = f(proper(X)) [0 1 1] [0 1 1] [0] [0] proper(0()) = [1] >= [1] = ok(0()) [0] [0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] proper(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(proper(X1),proper(X2)) [0 0 1] [0 0 0] [0 0 1] [0 0 0] proper(s(X)) = X >= X = s(proper(X)) [1 0 0] [1 0 0] proper(p(X)) = [0 0 0]X >= [0 0 0]X = p(proper(X)) [0 1 1] [0 1 1] [1 0 0] [1 0 0] f(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(f(X)) [0 1 1] [0 1 1] [1 0 0] [1 0 0] [1 0 0] [1 0 0] cons(ok(X1),ok(X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = ok(cons(X1,X2)) [0 0 1] [0 0 0] [0 0 1] [0 0 0] s(ok(X)) = X >= X = ok(s(X)) [1 0 0] [1 0 0] p(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(p(X)) [0 1 1] [0 1 1] [1 1 1] [0] [1 0 1] [0] top(mark(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = top(proper(X)) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 1] [0] top(ok(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = top(active(X)) [0 0 0] [1] [0 0 0] [1] problem: active(f(s(0()))) -> mark(f(p(s(0())))) active(p(s(X))) -> mark(X) active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) f(mark(X)) -> mark(f(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(p(X)) -> p(proper(X)) f(ok(X)) -> ok(f(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) p(ok(X)) -> ok(p(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = x0 + 2x1, [ok](x0) = x0, [f](x0) = 4x0, [s](x0) = x0 + 1, [mark](x0) = x0, [0] = 1, [proper](x0) = x0, [top](x0) = x0, [p](x0) = x0, [active](x0) = x0 orientation: active(f(s(0()))) = 8 >= 8 = mark(f(p(s(0())))) active(p(s(X))) = X + 1 >= X = mark(X) active(f(X)) = 4X >= 4X = f(active(X)) active(cons(X1,X2)) = X1 + 2X2 >= X1 + 2X2 = cons(active(X1),X2) active(s(X)) = X + 1 >= X + 1 = s(active(X)) active(p(X)) = X >= X = p(active(X)) f(mark(X)) = 4X >= 4X = mark(f(X)) cons(mark(X1),X2) = X1 + 2X2 >= X1 + 2X2 = mark(cons(X1,X2)) s(mark(X)) = X + 1 >= X + 1 = mark(s(X)) p(mark(X)) = X >= X = mark(p(X)) proper(f(X)) = 4X >= 4X = f(proper(X)) proper(0()) = 1 >= 1 = ok(0()) proper(cons(X1,X2)) = X1 + 2X2 >= X1 + 2X2 = cons(proper(X1),proper(X2)) proper(s(X)) = X + 1 >= X + 1 = s(proper(X)) proper(p(X)) = X >= X = p(proper(X)) f(ok(X)) = 4X >= 4X = ok(f(X)) cons(ok(X1),ok(X2)) = X1 + 2X2 >= X1 + 2X2 = ok(cons(X1,X2)) s(ok(X)) = X + 1 >= X + 1 = ok(s(X)) p(ok(X)) = X >= X = ok(p(X)) top(mark(X)) = X >= X = top(proper(X)) top(ok(X)) = X >= X = top(active(X)) problem: active(f(s(0()))) -> mark(f(p(s(0())))) active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) f(mark(X)) -> mark(f(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(p(X)) -> p(proper(X)) f(ok(X)) -> ok(f(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) p(ok(X)) -> ok(p(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [ok](x0) = x0 , [1 1 0] [f](x0) = [0 0 1]x0 [0 0 0] , [s](x0) = x0 , [1 0 0] [mark](x0) = [0 1 1]x0 [0 0 1] , [0] [0] = [0] [1], [proper](x0) = x0 , [1 1 0] [top](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [p](x0) = [0 1 0]x0 [0 0 0] , [1 1 0] [active](x0) = [0 0 0]x0 [0 0 0] orientation: [1] [0] active(f(s(0()))) = [0] >= [0] = mark(f(p(s(0())))) [0] [0] [1 1 1] [1 1 0] active(f(X)) = [0 0 0]X >= [0 0 0]X = f(active(X)) [0 0 0] [0 0 0] [1 1 0] [1 0 0] [1 1 0] [1 0 0] active(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(active(X1),X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 1 0] [1 1 0] active(s(X)) = [0 0 0]X >= [0 0 0]X = s(active(X)) [0 0 0] [0 0 0] [1 1 0] [1 1 0] active(p(X)) = [0 0 0]X >= [0 0 0]X = p(active(X)) [0 0 0] [0 0 0] [1 1 1] [1 1 0] f(mark(X)) = [0 0 1]X >= [0 0 1]X = mark(f(X)) [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] cons(mark(X1),X2) = [0 1 1]X1 + [0 0 0]X2 >= [0 1 0]X1 + [0 0 0]X2 = mark(cons(X1,X2)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] s(mark(X)) = [0 1 1]X >= [0 1 1]X = mark(s(X)) [0 0 1] [0 0 1] [1 0 0] [1 0 0] p(mark(X)) = [0 1 1]X >= [0 1 0]X = mark(p(X)) [0 0 0] [0 0 0] [1 1 0] [1 1 0] proper(f(X)) = [0 0 1]X >= [0 0 1]X = f(proper(X)) [0 0 0] [0 0 0] [0] [0] proper(0()) = [0] >= [0] = ok(0()) [1] [1] [1 0 0] [1 0 0] [1 0 0] [1 0 0] proper(cons(X1,X2)) = [0 1 0]X1 + [0 0 0]X2 >= [0 1 0]X1 + [0 0 0]X2 = cons(proper(X1),proper(X2)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] proper(s(X)) = X >= X = s(proper(X)) [1 0 0] [1 0 0] proper(p(X)) = [0 1 0]X >= [0 1 0]X = p(proper(X)) [0 0 0] [0 0 0] [1 1 0] [1 1 0] f(ok(X)) = [0 0 1]X >= [0 0 1]X = ok(f(X)) [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] cons(ok(X1),ok(X2)) = [0 1 0]X1 + [0 0 0]X2 >= [0 1 0]X1 + [0 0 0]X2 = ok(cons(X1,X2)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] s(ok(X)) = X >= X = ok(s(X)) [1 0 0] [1 0 0] p(ok(X)) = [0 1 0]X >= [0 1 0]X = ok(p(X)) [0 0 0] [0 0 0] [1 1 1] [1 1 0] top(mark(X)) = [0 0 0]X >= [0 0 0]X = top(proper(X)) [0 0 0] [0 0 0] [1 1 0] [1 1 0] top(ok(X)) = [0 0 0]X >= [0 0 0]X = top(active(X)) [0 0 0] [0 0 0] problem: active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) f(mark(X)) -> mark(f(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(p(X)) -> p(proper(X)) f(ok(X)) -> ok(f(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) p(ok(X)) -> ok(p(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 1 0] [ok](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [f](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [s](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [1] [mark](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1] [0] = [0] [0], [1 0 0] [0] [proper](x0) = [0 0 0]x0 + [1] [1 0 0] [0], [1 0 0] [top](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [p](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [0] [active](x0) = [0 0 0]x0 + [0] [0 0 0] [1] orientation: [1 0 0] [0] [1 0 0] active(f(X)) = [0 0 0]X + [0] >= [0 0 0]X = f(active(X)) [0 0 0] [1] [0 0 0] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] active(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 = cons(active(X1),X2) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1 0 0] [0] [1 0 0] active(s(X)) = [0 0 0]X + [0] >= [0 0 0]X = s(active(X)) [0 0 0] [1] [0 0 0] [1 0 0] [0] [1 0 0] active(p(X)) = [0 0 0]X + [0] >= [0 0 0]X = p(active(X)) [0 0 0] [1] [0 0 0] [1 0 0] [1] [1 0 0] [1] f(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(f(X)) [0 0 0] [0] [0 0 0] [0] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1] cons(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = mark(cons(X1,X2)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 0] [1] [1 0 0] [1] s(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(s(X)) [0 0 0] [0] [0 0 0] [0] [1 0 0] [1] [1 0 0] [1] p(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(p(X)) [0 0 0] [0] [0 0 0] [0] [1 0 0] [0] [1 0 0] proper(f(X)) = [0 0 0]X + [1] >= [0 0 0]X = f(proper(X)) [1 0 0] [0] [0 0 0] [1] [1] proper(0()) = [1] >= [0] = ok(0()) [1] [0] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] proper(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 = cons(proper(X1),proper(X2)) [1 0 0] [1 0 0] [0] [0 0 0] [0 0 0] [1 0 0] [0] [1 0 0] proper(s(X)) = [0 0 0]X + [1] >= [0 0 0]X = s(proper(X)) [1 0 0] [0] [0 0 0] [1 0 0] [0] [1 0 0] proper(p(X)) = [0 0 0]X + [1] >= [0 0 0]X = p(proper(X)) [1 0 0] [0] [0 0 0] [1 1 0] [1 0 0] f(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(f(X)) [0 0 0] [0 0 0] [1 1 0] [1 1 0] [1 0 0] [1 0 0] cons(ok(X1),ok(X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = ok(cons(X1,X2)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 1 0] [1 0 0] s(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(s(X)) [0 0 0] [0 0 0] [1 1 0] [1 0 0] p(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(p(X)) [0 0 0] [0 0 0] [1 0 0] [1] [1 0 0] top(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = top(proper(X)) [0 0 0] [0] [0 0 0] [1 1 0] [1 0 0] top(ok(X)) = [0 0 0]X >= [0 0 0]X = top(active(X)) [0 0 0] [0 0 0] problem: active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) f(mark(X)) -> mark(f(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(0()) -> ok(0()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(s(X)) -> s(proper(X)) proper(p(X)) -> p(proper(X)) f(ok(X)) -> ok(f(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) s(ok(X)) -> ok(s(X)) p(ok(X)) -> ok(p(X)) top(ok(X)) -> top(active(X)) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = 3x0 + 2x1 + 1, [ok](x0) = 4x0 + 1, [f](x0) = x0, [s](x0) = 4x0, [mark](x0) = x0, [0] = 2, [proper](x0) = 6x0, [top](x0) = x0 + 6, [p](x0) = x0, [active](x0) = x0 orientation: active(f(X)) = X >= X = f(active(X)) active(cons(X1,X2)) = 3X1 + 2X2 + 1 >= 3X1 + 2X2 + 1 = cons(active(X1),X2) active(s(X)) = 4X >= 4X = s(active(X)) active(p(X)) = X >= X = p(active(X)) f(mark(X)) = X >= X = mark(f(X)) cons(mark(X1),X2) = 3X1 + 2X2 + 1 >= 3X1 + 2X2 + 1 = mark(cons(X1,X2)) s(mark(X)) = 4X >= 4X = mark(s(X)) p(mark(X)) = X >= X = mark(p(X)) proper(f(X)) = 6X >= 6X = f(proper(X)) proper(0()) = 12 >= 9 = ok(0()) proper(cons(X1,X2)) = 18X1 + 12X2 + 6 >= 18X1 + 12X2 + 1 = cons(proper(X1),proper(X2)) proper(s(X)) = 24X >= 24X = s(proper(X)) proper(p(X)) = 6X >= 6X = p(proper(X)) f(ok(X)) = 4X + 1 >= 4X + 1 = ok(f(X)) cons(ok(X1),ok(X2)) = 12X1 + 8X2 + 6 >= 12X1 + 8X2 + 5 = ok(cons(X1,X2)) s(ok(X)) = 16X + 4 >= 16X + 1 = ok(s(X)) p(ok(X)) = 4X + 1 >= 4X + 1 = ok(p(X)) top(ok(X)) = 4X + 7 >= X + 6 = top(active(X)) problem: active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) f(mark(X)) -> mark(f(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(s(X)) -> s(proper(X)) proper(p(X)) -> p(proper(X)) f(ok(X)) -> ok(f(X)) p(ok(X)) -> ok(p(X)) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = x0 + 4x1 + 2, [ok](x0) = 4x0 + 5, [f](x0) = 3x0 + 2, [s](x0) = 4x0 + 1, [mark](x0) = x0 + 6, [proper](x0) = 4x0, [p](x0) = 4x0 + 4, [active](x0) = x0 orientation: active(f(X)) = 3X + 2 >= 3X + 2 = f(active(X)) active(cons(X1,X2)) = X1 + 4X2 + 2 >= X1 + 4X2 + 2 = cons(active(X1),X2) active(s(X)) = 4X + 1 >= 4X + 1 = s(active(X)) active(p(X)) = 4X + 4 >= 4X + 4 = p(active(X)) f(mark(X)) = 3X + 20 >= 3X + 8 = mark(f(X)) cons(mark(X1),X2) = X1 + 4X2 + 8 >= X1 + 4X2 + 8 = mark(cons(X1,X2)) s(mark(X)) = 4X + 25 >= 4X + 7 = mark(s(X)) p(mark(X)) = 4X + 28 >= 4X + 10 = mark(p(X)) proper(f(X)) = 12X + 8 >= 12X + 2 = f(proper(X)) proper(s(X)) = 16X + 4 >= 16X + 1 = s(proper(X)) proper(p(X)) = 16X + 16 >= 16X + 4 = p(proper(X)) f(ok(X)) = 12X + 17 >= 12X + 13 = ok(f(X)) p(ok(X)) = 16X + 24 >= 16X + 21 = ok(p(X)) problem: active(f(X)) -> f(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(s(X)) -> s(active(X)) active(p(X)) -> p(active(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) Matrix Interpretation Processor: dim=1 interpretation: [cons](x0, x1) = x0 + x1, [f](x0) = x0 + 4, [s](x0) = 4x0 + 5, [mark](x0) = x0, [p](x0) = 3x0 + 3, [active](x0) = 5x0 + 6 orientation: active(f(X)) = 5X + 26 >= 5X + 10 = f(active(X)) active(cons(X1,X2)) = 5X1 + 5X2 + 6 >= 5X1 + X2 + 6 = cons(active(X1),X2) active(s(X)) = 20X + 31 >= 20X + 29 = s(active(X)) active(p(X)) = 15X + 21 >= 15X + 21 = p(active(X)) cons(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(cons(X1,X2)) problem: active(cons(X1,X2)) -> cons(active(X1),X2) active(p(X)) -> p(active(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 1 0] [0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [0] [0 0 1] [0 0 0] [1], [1 0 0] [1] [mark](x0) = [0 0 0]x0 + [0] [0 0 1] [0], [1 0 0] [0] [p](x0) = [0 0 0]x0 + [0] [0 0 1] [1], [1 0 1] [0] [active](x0) = [1 0 0]x0 + [1] [0 0 1] [0] orientation: [1 0 1] [1 1 0] [1] [1 0 1] [1 1 0] [0] active(cons(X1,X2)) = [1 0 0]X1 + [1 1 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(active(X1),X2) [0 0 1] [0 0 0] [1] [0 0 1] [0 0 0] [1] [1 0 1] [1] [1 0 1] [0] active(p(X)) = [1 0 0]X + [1] >= [0 0 0]X + [0] = p(active(X)) [0 0 1] [1] [0 0 1] [1] [1 0 0] [1 1 0] [1] [1 0 0] [1 1 0] [1] cons(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = mark(cons(X1,X2)) [0 0 1] [0 0 0] [1] [0 0 1] [0 0 0] [1] problem: cons(mark(X1),X2) -> mark(cons(X1,X2)) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [0 0 0]x1 [0 1 1] [1 0 0] , [1 0 0] [0] [mark](x0) = [0 1 0]x0 + [1] [1 0 0] [0] orientation: [1 1 0] [1 0 0] [1] [1 1 0] [1 0 0] [0] cons(mark(X1),X2) = [0 1 0]X1 + [0 0 0]X2 + [1] >= [0 1 0]X1 + [0 0 0]X2 + [1] = mark(cons(X1,X2)) [1 1 0] [1 0 0] [1] [1 1 0] [1 0 0] [0] problem: Qed