/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: active(f(0())) -> mark(cons(0(),f(s(0())))) active(f(s(0()))) -> mark(f(p(s(0())))) active(p(s(0()))) -> mark(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)) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [cons](x0, x1) = x0 + [0 0 0]x1 [0 0 0] , [1 0 0] [0] [ok](x0) = [0 0 0]x0 + [1] [0 0 1] [0], [f](x0) = x0 , [1 0 1] [0] [s](x0) = [0 1 0]x0 + [0] [0 0 0] [1], [1 0 1] [0] [mark](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [0] [0] = [0] [0], [1 0 0] [0] [proper](x0) = [0 0 0]x0 + [1] [0 0 1] [0], [1 1 1] [top](x0) = [1 1 1]x0 [0 0 0] , [p](x0) = x0 , [1 0 1] [0] [active](x0) = [0 0 0]x0 + [0] [0 0 0] [1] orientation: [0] [0] active(f(0())) = [0] >= [0] = mark(cons(0(),f(s(0())))) [1] [1] [1] [1] active(f(s(0()))) = [0] >= [0] = mark(f(p(s(0())))) [1] [1] [1] [0] active(p(s(0()))) = [0] >= [0] = mark(0()) [1] [1] [1 0 1] [0] [1 0 1] [0] active(f(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = f(active(X)) [0 0 0] [1] [0 0 0] [1] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [0] active(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(active(X1),X2) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1] [1 0 1] [1] [1 0 1] [1] active(s(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = s(active(X)) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 1] [0] active(p(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = p(active(X)) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 1] [0] f(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(f(X)) [0 0 0] [1] [0 0 0] [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 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = mark(cons(X1,X2)) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [1] [1 0 1] [1] [1 0 1] [1] s(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(s(X)) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 1] [0] p(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(p(X)) [0 0 0] [1] [0 0 0] [1] [1 0 0] [0] [1 0 0] [0] proper(f(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = f(proper(X)) [0 0 1] [0] [0 0 1] [0] [0] [0] proper(0()) = [1] >= [1] = ok(0()) [0] [0] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] [0] proper(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(proper(X1),proper(X2)) [0 0 1] [0 0 0] [0] [0 0 1] [0 0 0] [0] [1 0 1] [0] [1 0 1] [0] proper(s(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = s(proper(X)) [0 0 0] [1] [0 0 0] [1] [1 0 0] [0] [1 0 0] [0] proper(p(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = p(proper(X)) [0 0 1] [0] [0 0 1] [0] [1 0 0] [0] [1 0 0] [0] f(ok(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = ok(f(X)) [0 0 1] [0] [0 0 1] [0] [1 0 0] [1 0 0] [0] [1 0 0] [1 0 0] [0] cons(ok(X1),ok(X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = ok(cons(X1,X2)) [0 0 1] [0 0 0] [0] [0 0 1] [0 0 0] [0] [1 0 1] [0] [1 0 1] [0] s(ok(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = ok(s(X)) [0 0 0] [1] [0 0 0] [1] [1 0 0] [0] [1 0 0] [0] p(ok(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = ok(p(X)) [0 0 1] [0] [0 0 1] [0] [1 0 1] [1] [1 0 1] [1] top(mark(X)) = [1 0 1]X + [1] >= [1 0 1]X + [1] = top(proper(X)) [0 0 0] [0] [0 0 0] [0] [1 0 1] [1] [1 0 1] [1] top(ok(X)) = [1 0 1]X + [1] >= [1 0 1]X + [1] = top(active(X)) [0 0 0] [0] [0 0 0] [0] problem: active(f(0())) -> mark(cons(0(),f(s(0())))) 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 1] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 1] [0 0 0] , [ok](x0) = x0 , [1 0 1] [f](x0) = [0 0 0]x0 [0 1 0] , [1 0 0] [s](x0) = [0 0 0]x0 [0 0 1] , [1 0 0] [mark](x0) = [0 1 0]x0 [0 1 1] , [0] [0] = [1] [0], [proper](x0) = x0 , [1 0 1] [0] [top](x0) = [0 0 0]x0 + [1] [0 0 1] [1], [1 0 1] [p](x0) = [0 0 0]x0 [0 0 0] , [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] [0] [0] active(f(s(0()))) = [0] >= [0] = mark(f(p(s(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 1] [1 0 1] [1 0 1] 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 0 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 0 1] f(mark(X)) = [0 0 0]X >= [0 0 0]X = mark(f(X)) [0 1 0] [0 1 0] [1 0 0] [1 0 1] [1 0 0] [1 0 1] 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 1 1] [0 0 0] [0 0 1] [0 0 0] [1 0 0] [1 0 0] s(mark(X)) = [0 0 0]X >= [0 0 0]X = mark(s(X)) [0 1 1] [0 0 1] [1 1 1] [1 0 1] p(mark(X)) = [0 0 0]X >= [0 0 0]X = mark(p(X)) [0 0 0] [0 0 0] [1 0 1] [1 0 1] proper(f(X)) = [0 0 0]X >= [0 0 0]X = f(proper(X)) [0 1 0] [0 1 0] [0] [0] proper(0()) = [1] >= [1] = ok(0()) [0] [0] [1 0 0] [1 0 1] [1 0 0] [1 0 1] 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] [1 0 0] [1 0 0] proper(s(X)) = [0 0 0]X >= [0 0 0]X = s(proper(X)) [0 0 1] [0 0 1] [1 0 1] [1 0 1] proper(p(X)) = [0 0 0]X >= [0 0 0]X = p(proper(X)) [0 0 0] [0 0 0] [1 0 1] [1 0 1] f(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(f(X)) [0 1 0] [0 1 0] [1 0 0] [1 0 1] [1 0 0] [1 0 1] 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] [1 0 0] [1 0 0] s(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(s(X)) [0 0 1] [0 0 1] [1 0 1] [1 0 1] p(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(p(X)) [0 0 0] [0 0 0] [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 1 1] [1] [0 0 1] [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 1] [1] [0 0 0] [1] 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=1 interpretation: [cons](x0, x1) = 4x0 + x1 + 2, [ok](x0) = x0, [f](x0) = 4x0, [s](x0) = x0, [mark](x0) = x0 + 4, [0] = 2, [proper](x0) = x0, [top](x0) = x0 + 4, [p](x0) = x0, [active](x0) = x0 orientation: active(f(X)) = 4X >= 4X = f(active(X)) active(cons(X1,X2)) = 4X1 + X2 + 2 >= 4X1 + X2 + 2 = cons(active(X1),X2) active(s(X)) = X >= X = s(active(X)) active(p(X)) = X >= X = p(active(X)) f(mark(X)) = 4X + 16 >= 4X + 4 = mark(f(X)) cons(mark(X1),X2) = 4X1 + X2 + 18 >= 4X1 + X2 + 6 = mark(cons(X1,X2)) s(mark(X)) = X + 4 >= X + 4 = mark(s(X)) p(mark(X)) = X + 4 >= X + 4 = mark(p(X)) proper(f(X)) = 4X >= 4X = f(proper(X)) proper(0()) = 2 >= 2 = ok(0()) proper(cons(X1,X2)) = 4X1 + X2 + 2 >= 4X1 + X2 + 2 = cons(proper(X1),proper(X2)) proper(s(X)) = X >= X = s(proper(X)) proper(p(X)) = X >= X = p(proper(X)) f(ok(X)) = 4X >= 4X = ok(f(X)) cons(ok(X1),ok(X2)) = 4X1 + X2 + 2 >= 4X1 + X2 + 2 = ok(cons(X1,X2)) s(ok(X)) = X >= X = ok(s(X)) p(ok(X)) = X >= X = ok(p(X)) top(mark(X)) = X + 8 >= X + 4 = top(proper(X)) top(ok(X)) = X + 4 >= X + 4 = 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)) 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=3 interpretation: [1 0 0] [1 1 0] [0] [cons](x0, x1) = [0 0 0]x0 + [0 1 0]x1 + [0] [0 0 1] [0 0 1] [1], [1 0 1] [0] [ok](x0) = [0 1 0]x0 + [1] [0 0 0] [0], [1 1 0] [0] [f](x0) = [0 1 0]x0 + [0] [0 0 1] [1], [1] [s](x0) = x0 + [0] [0], [1 0 0] [mark](x0) = [0 1 0]x0 [0 0 0] , [1] [0] = [0] [0], [1 0 1] [0] [proper](x0) = [0 0 0]x0 + [1] [0 0 1] [0], [1 0 0] [top](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [0] [p](x0) = [0 1 0]x0 + [0] [0 0 1] [1], [1 0 1] [active](x0) = [0 1 0]x0 [0 0 1] orientation: [1 1 1] [1] [1 1 1] [0] active(f(X)) = [0 1 0]X + [0] >= [0 1 0]X + [0] = f(active(X)) [0 0 1] [1] [0 0 1] [1] [1 0 1] [1 1 1] [1] [1 0 1] [1 1 0] [0] active(cons(X1,X2)) = [0 0 0]X1 + [0 1 0]X2 + [0] >= [0 0 0]X1 + [0 1 0]X2 + [0] = cons(active(X1),X2) [0 0 1] [0 0 1] [1] [0 0 1] [0 0 1] [1] [1 0 1] [1] [1 0 1] [1] active(s(X)) = [0 1 0]X + [0] >= [0 1 0]X + [0] = s(active(X)) [0 0 1] [0] [0 0 1] [0] [1 1 1] [1] [1 1 1] [0] active(p(X)) = [0 1 0]X + [0] >= [0 1 0]X + [0] = p(active(X)) [0 0 1] [1] [0 0 1] [1] [1 0 0] [1] [1 0 0] [1] s(mark(X)) = [0 1 0]X + [0] >= [0 1 0]X + [0] = mark(s(X)) [0 0 0] [0] [0 0 0] [0] [1 1 0] [0] [1 1 0] p(mark(X)) = [0 1 0]X + [0] >= [0 1 0]X = mark(p(X)) [0 0 0] [1] [0 0 0] [1 1 1] [1] [1 0 1] [1] proper(f(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = f(proper(X)) [0 0 1] [1] [0 0 1] [1] [1] [1] proper(0()) = [1] >= [1] = ok(0()) [0] [0] [1 0 1] [1 1 1] [1] [1 0 1] [1 0 1] [1] proper(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [1] >= [0 0 0]X1 + [0 0 0]X2 + [1] = cons(proper(X1),proper(X2)) [0 0 1] [0 0 1] [1] [0 0 1] [0 0 1] [1] [1 0 1] [1] [1 0 1] [1] proper(s(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = s(proper(X)) [0 0 1] [0] [0 0 1] [0] [1 1 1] [1] [1 0 1] [1] proper(p(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = p(proper(X)) [0 0 1] [1] [0 0 1] [1] [1 1 1] [1] [1 1 1] [1] f(ok(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = ok(f(X)) [0 0 0] [1] [0 0 0] [0] [1 0 1] [1 1 1] [1] [1 0 1] [1 1 1] [1] cons(ok(X1),ok(X2)) = [0 0 0]X1 + [0 1 0]X2 + [1] >= [0 0 0]X1 + [0 1 0]X2 + [1] = ok(cons(X1,X2)) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [0] [1 0 1] [1] [1 0 1] [1] s(ok(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = ok(s(X)) [0 0 0] [0] [0 0 0] [0] [1 1 1] [1] [1 1 1] [1] p(ok(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = ok(p(X)) [0 0 0] [1] [0 0 0] [0] [1 0 1] [1 0 1] top(ok(X)) = [0 0 0]X >= [0 0 0]X = top(active(X)) [0 0 0] [0 0 0] problem: active(s(X)) -> s(active(X)) 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) = 4x0 + 2x1 + 2, [ok](x0) = 2x0 + 1, [f](x0) = x0, [s](x0) = 4x0, [mark](x0) = 2x0, [0] = 4, [proper](x0) = 4x0, [top](x0) = x0 + 4, [p](x0) = 2x0, [active](x0) = x0 orientation: active(s(X)) = 4X >= 4X = s(active(X)) s(mark(X)) = 8X >= 8X = mark(s(X)) p(mark(X)) = 4X >= 4X = mark(p(X)) proper(f(X)) = 4X >= 4X = f(proper(X)) proper(0()) = 16 >= 9 = ok(0()) proper(cons(X1,X2)) = 16X1 + 8X2 + 8 >= 16X1 + 8X2 + 2 = cons(proper(X1),proper(X2)) proper(s(X)) = 16X >= 16X = s(proper(X)) proper(p(X)) = 8X >= 8X = p(proper(X)) f(ok(X)) = 2X + 1 >= 2X + 1 = ok(f(X)) cons(ok(X1),ok(X2)) = 8X1 + 4X2 + 8 >= 8X1 + 4X2 + 5 = ok(cons(X1,X2)) s(ok(X)) = 8X + 4 >= 8X + 1 = ok(s(X)) p(ok(X)) = 4X + 2 >= 4X + 1 = ok(p(X)) top(ok(X)) = 2X + 5 >= X + 4 = top(active(X)) problem: active(s(X)) -> s(active(X)) 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)) Matrix Interpretation Processor: dim=1 interpretation: [ok](x0) = 4x0 + 4, [f](x0) = 2x0 + 1, [s](x0) = 6x0 + 5, [mark](x0) = 2x0 + 1, [proper](x0) = x0, [p](x0) = 5x0 + 4, [active](x0) = x0 orientation: active(s(X)) = 6X + 5 >= 6X + 5 = s(active(X)) s(mark(X)) = 12X + 11 >= 12X + 11 = mark(s(X)) p(mark(X)) = 10X + 9 >= 10X + 9 = mark(p(X)) proper(f(X)) = 2X + 1 >= 2X + 1 = f(proper(X)) proper(s(X)) = 6X + 5 >= 6X + 5 = s(proper(X)) proper(p(X)) = 5X + 4 >= 5X + 4 = p(proper(X)) f(ok(X)) = 8X + 9 >= 8X + 8 = ok(f(X)) problem: active(s(X)) -> s(active(X)) 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)) Matrix Interpretation Processor: dim=1 interpretation: [f](x0) = 3x0 + 4, [s](x0) = 3x0 + 4, [mark](x0) = x0, [proper](x0) = 4x0 + 6, [p](x0) = 2x0 + 4, [active](x0) = 4x0 + 3 orientation: active(s(X)) = 12X + 19 >= 12X + 13 = s(active(X)) s(mark(X)) = 3X + 4 >= 3X + 4 = mark(s(X)) p(mark(X)) = 2X + 4 >= 2X + 4 = mark(p(X)) proper(f(X)) = 12X + 22 >= 12X + 22 = f(proper(X)) proper(s(X)) = 12X + 22 >= 12X + 22 = s(proper(X)) proper(p(X)) = 8X + 22 >= 8X + 16 = p(proper(X)) problem: s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) proper(s(X)) -> s(proper(X)) Matrix Interpretation Processor: dim=1 interpretation: [f](x0) = x0, [s](x0) = 2x0 + 2, [mark](x0) = 3x0 + 4, [proper](x0) = 3x0 + 1, [p](x0) = 3x0 + 4 orientation: s(mark(X)) = 6X + 10 >= 6X + 10 = mark(s(X)) p(mark(X)) = 9X + 16 >= 9X + 16 = mark(p(X)) proper(f(X)) = 3X + 1 >= 3X + 1 = f(proper(X)) proper(s(X)) = 6X + 7 >= 6X + 4 = s(proper(X)) problem: s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) proper(f(X)) -> f(proper(X)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [f](x0) = [0 1 0]x0 + [1] [0 0 0] [0], [1 0 0] [0] [s](x0) = [0 1 0]x0 + [1] [0 0 0] [1], [1 0 0] [0] [mark](x0) = [0 0 1]x0 + [0] [0 0 0] [1], [1 1 0] [proper](x0) = [0 1 0]x0 [0 0 0] , [1 0 0] [0] [p](x0) = [0 1 0]x0 + [1] [0 0 0] [1] orientation: [1 0 0] [0] [1 0 0] [0] s(mark(X)) = [0 0 1]X + [1] >= [0 0 0]X + [1] = mark(s(X)) [0 0 0] [1] [0 0 0] [1] [1 0 0] [0] [1 0 0] [0] p(mark(X)) = [0 0 1]X + [1] >= [0 0 0]X + [1] = mark(p(X)) [0 0 0] [1] [0 0 0] [1] [1 1 0] [1] [1 1 0] [0] proper(f(X)) = [0 1 0]X + [1] >= [0 1 0]X + [1] = f(proper(X)) [0 0 0] [0] [0 0 0] [0] problem: s(mark(X)) -> mark(s(X)) p(mark(X)) -> mark(p(X)) Matrix Interpretation Processor: dim=3 interpretation: [1 1 1] [s](x0) = [0 1 0]x0 [0 0 1] , [1 0 0] [0] [mark](x0) = [0 0 1]x0 + [1] [0 1 0] [0], [1 1 1] [p](x0) = [1 1 0]x0 [1 0 1] orientation: [1 1 1] [1] [1 1 1] [0] s(mark(X)) = [0 0 1]X + [1] >= [0 0 1]X + [1] = mark(s(X)) [0 1 0] [0] [0 1 0] [0] [1 1 1] [1] [1 1 1] [0] p(mark(X)) = [1 0 1]X + [1] >= [1 0 1]X + [1] = mark(p(X)) [1 1 0] [0] [1 1 0] [0] problem: Qed