/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: active(2nd(cons(X,cons(Y,Z)))) -> mark(Y) active(from(X)) -> mark(cons(X,from(s(X)))) mark(2nd(X)) -> active(2nd(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(from(X)) -> active(from(mark(X))) mark(s(X)) -> active(s(mark(X))) 2nd(mark(X)) -> 2nd(X) 2nd(active(X)) -> 2nd(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) from(mark(X)) -> from(X) from(active(X)) -> from(X) s(mark(X)) -> s(X) s(active(X)) -> s(X) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 1 1] [0] [from](x0) = [1 1 1]x0 + [1] [1 1 1] [0], [1 1 1] [2nd](x0) = [0 0 0]x0 [0 0 0] , [1 1 1] [mark](x0) = [0 0 0]x0 [0 0 0] , [1 1 1] [s](x0) = [0 0 0]x0 [0 0 0] , [1 1 1] [1 0 1] [1] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [0] [0 0 0] [0 0 0] [0], [1 1 1] [active](x0) = [0 0 0]x0 [0 0 0] orientation: [1 1 1] [1 1 1] [1 0 1] [2] [1 1 1] active(2nd(cons(X,cons(Y,Z)))) = [0 0 0]X + [0 0 0]Y + [0 0 0]Z + [0] >= [0 0 0]Y = mark(Y) [0 0 0] [0 0 0] [0 0 0] [0] [0 0 0] [3 3 3] [1] [3 3 3] [1] active(from(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(cons(X,from(s(X)))) [0 0 0] [0] [0 0 0] [0] [1 1 1] [1 1 1] mark(2nd(X)) = [0 0 0]X >= [0 0 0]X = active(2nd(mark(X))) [0 0 0] [0 0 0] [1 1 1] [1 0 1] [1] [1 1 1] [1 0 1] [1] mark(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = active(cons(mark(X1),X2)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [3 3 3] [1] [3 3 3] [1] mark(from(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = active(from(mark(X))) [0 0 0] [0] [0 0 0] [0] [1 1 1] [1 1 1] mark(s(X)) = [0 0 0]X >= [0 0 0]X = active(s(mark(X))) [0 0 0] [0 0 0] [1 1 1] [1 1 1] 2nd(mark(X)) = [0 0 0]X >= [0 0 0]X = 2nd(X) [0 0 0] [0 0 0] [1 1 1] [1 1 1] 2nd(active(X)) = [0 0 0]X >= [0 0 0]X = 2nd(X) [0 0 0] [0 0 0] [1 1 1] [1 0 1] [1] [1 1 1] [1 0 1] [1] cons(mark(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 1 1] [1 1 1] [1] [1 1 1] [1 0 1] [1] cons(X1,mark(X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 1 1] [1 0 1] [1] [1 1 1] [1 0 1] [1] cons(active(X1),X2) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 1 1] [1 1 1] [1] [1 1 1] [1 0 1] [1] cons(X1,active(X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(X1,X2) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 1 1] [0] [1 1 1] [0] from(mark(X)) = [1 1 1]X + [1] >= [1 1 1]X + [1] = from(X) [1 1 1] [0] [1 1 1] [0] [1 1 1] [0] [1 1 1] [0] from(active(X)) = [1 1 1]X + [1] >= [1 1 1]X + [1] = from(X) [1 1 1] [0] [1 1 1] [0] [1 1 1] [1 1 1] s(mark(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 0 0] [0 0 0] [1 1 1] [1 1 1] s(active(X)) = [0 0 0]X >= [0 0 0]X = s(X) [0 0 0] [0 0 0] problem: active(from(X)) -> mark(cons(X,from(s(X)))) mark(2nd(X)) -> active(2nd(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(from(X)) -> active(from(mark(X))) mark(s(X)) -> active(s(mark(X))) 2nd(mark(X)) -> 2nd(X) 2nd(active(X)) -> 2nd(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) from(mark(X)) -> from(X) from(active(X)) -> from(X) s(mark(X)) -> s(X) s(active(X)) -> s(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [1] [from](x0) = [0 0 0]x0 + [0] [1 0 1] [1], [1 0 1] [1] [2nd](x0) = [0 0 0]x0 + [0] [1 0 1] [1], [1 0 1] [mark](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [s](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 0 1] [active](x0) = [0 0 0]x0 [0 0 0] orientation: [2 0 2] [2] [2 0 2] [1] active(from(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(cons(X,from(s(X)))) [0 0 0] [0] [0 0 0] [0] [2 0 2] [2] [2 0 2] [2] mark(2nd(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = active(2nd(mark(X))) [0 0 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] [2 0 2] [2] [2 0 2] [2] mark(from(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = active(from(mark(X))) [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 1] [1] [1 0 1] [1] 2nd(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = 2nd(X) [1 0 1] [1] [1 0 1] [1] [1 0 1] [1] [1 0 1] [1] 2nd(active(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = 2nd(X) [1 0 1] [1] [1 0 1] [1] [1 0 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 = cons(X1,X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 1] [1 0 1] [1 0 1] [1 0 0] cons(X1,mark(X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(X1,X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 1] [1 0 0] [1 0 1] [1 0 0] cons(active(X1),X2) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(X1,X2) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 1] [1 0 1] [1 0 1] [1 0 0] cons(X1,active(X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(X1,X2) [0 0 0] [0 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 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] problem: mark(2nd(X)) -> active(2nd(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(from(X)) -> active(from(mark(X))) mark(s(X)) -> active(s(mark(X))) 2nd(mark(X)) -> 2nd(X) 2nd(active(X)) -> 2nd(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) from(mark(X)) -> from(X) from(active(X)) -> from(X) s(mark(X)) -> s(X) s(active(X)) -> s(X) Matrix Interpretation Processor: dim=1 interpretation: [from](x0) = x0 + 4, [2nd](x0) = 2x0 + 2, [mark](x0) = 4x0 + 1, [s](x0) = 2x0 + 2, [cons](x0, x1) = 4x0 + 4x1 + 6, [active](x0) = x0 + 5 orientation: mark(2nd(X)) = 8X + 9 >= 8X + 9 = active(2nd(mark(X))) mark(cons(X1,X2)) = 16X1 + 16X2 + 25 >= 16X1 + 4X2 + 15 = active(cons(mark(X1),X2)) mark(from(X)) = 4X + 17 >= 4X + 10 = active(from(mark(X))) mark(s(X)) = 8X + 9 >= 8X + 9 = active(s(mark(X))) 2nd(mark(X)) = 8X + 4 >= 2X + 2 = 2nd(X) 2nd(active(X)) = 2X + 12 >= 2X + 2 = 2nd(X) cons(mark(X1),X2) = 16X1 + 4X2 + 10 >= 4X1 + 4X2 + 6 = cons(X1,X2) cons(X1,mark(X2)) = 4X1 + 16X2 + 10 >= 4X1 + 4X2 + 6 = cons(X1,X2) cons(active(X1),X2) = 4X1 + 4X2 + 26 >= 4X1 + 4X2 + 6 = cons(X1,X2) cons(X1,active(X2)) = 4X1 + 4X2 + 26 >= 4X1 + 4X2 + 6 = cons(X1,X2) from(mark(X)) = 4X + 5 >= X + 4 = from(X) from(active(X)) = X + 9 >= X + 4 = from(X) s(mark(X)) = 8X + 4 >= 2X + 2 = s(X) s(active(X)) = 2X + 12 >= 2X + 2 = s(X) problem: mark(2nd(X)) -> active(2nd(mark(X))) mark(s(X)) -> active(s(mark(X))) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [2nd](x0) = [0 0 0]x0 + [0] [0 1 1] [1], [1 1 1] [mark](x0) = [0 1 0]x0 [0 0 1] , [1 0 0] [0] [s](x0) = [0 0 1]x0 + [1] [0 1 0] [0], [1 0 0] [active](x0) = [0 0 0]x0 [0 0 1] orientation: [1 1 1] [1] [1 1 1] [0] mark(2nd(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = active(2nd(mark(X))) [0 1 1] [1] [0 1 1] [1] [1 1 1] [1] [1 1 1] mark(s(X)) = [0 0 1]X + [1] >= [0 0 0]X = active(s(mark(X))) [0 1 0] [0] [0 1 0] problem: Qed