/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: active(f(f(X))) -> mark(c(f(g(f(X))))) active(c(X)) -> mark(d(X)) active(h(X)) -> mark(c(d(X))) mark(f(X)) -> active(f(mark(X))) mark(c(X)) -> active(c(X)) mark(g(X)) -> active(g(X)) mark(d(X)) -> active(d(X)) mark(h(X)) -> active(h(mark(X))) f(mark(X)) -> f(X) f(active(X)) -> f(X) c(mark(X)) -> c(X) c(active(X)) -> c(X) g(mark(X)) -> g(X) g(active(X)) -> g(X) d(mark(X)) -> d(X) d(active(X)) -> d(X) h(mark(X)) -> h(X) h(active(X)) -> h(X) Proof: Matrix Interpretation Processor: dim=1 interpretation: [mark](x0) = x0, [active](x0) = x0, [c](x0) = x0, [d](x0) = x0, [f](x0) = 4x0, [h](x0) = 4x0 + 1, [g](x0) = x0 orientation: active(f(f(X))) = 16X >= 16X = mark(c(f(g(f(X))))) active(c(X)) = X >= X = mark(d(X)) active(h(X)) = 4X + 1 >= X = mark(c(d(X))) mark(f(X)) = 4X >= 4X = active(f(mark(X))) mark(c(X)) = X >= X = active(c(X)) mark(g(X)) = X >= X = active(g(X)) mark(d(X)) = X >= X = active(d(X)) mark(h(X)) = 4X + 1 >= 4X + 1 = active(h(mark(X))) f(mark(X)) = 4X >= 4X = f(X) f(active(X)) = 4X >= 4X = f(X) c(mark(X)) = X >= X = c(X) c(active(X)) = X >= X = c(X) g(mark(X)) = X >= X = g(X) g(active(X)) = X >= X = g(X) d(mark(X)) = X >= X = d(X) d(active(X)) = X >= X = d(X) h(mark(X)) = 4X + 1 >= 4X + 1 = h(X) h(active(X)) = 4X + 1 >= 4X + 1 = h(X) problem: active(f(f(X))) -> mark(c(f(g(f(X))))) active(c(X)) -> mark(d(X)) mark(f(X)) -> active(f(mark(X))) mark(c(X)) -> active(c(X)) mark(g(X)) -> active(g(X)) mark(d(X)) -> active(d(X)) mark(h(X)) -> active(h(mark(X))) f(mark(X)) -> f(X) f(active(X)) -> f(X) c(mark(X)) -> c(X) c(active(X)) -> c(X) g(mark(X)) -> g(X) g(active(X)) -> g(X) d(mark(X)) -> d(X) d(active(X)) -> d(X) h(mark(X)) -> h(X) h(active(X)) -> h(X) String Reversal Processor: f(f(active(X))) -> f(g(f(c(mark(X))))) c(active(X)) -> d(mark(X)) f(mark(X)) -> mark(f(active(X))) c(mark(X)) -> c(active(X)) g(mark(X)) -> g(active(X)) d(mark(X)) -> d(active(X)) h(mark(X)) -> mark(h(active(X))) mark(f(X)) -> f(X) active(f(X)) -> f(X) mark(c(X)) -> c(X) active(c(X)) -> c(X) mark(g(X)) -> g(X) active(g(X)) -> g(X) mark(d(X)) -> d(X) active(d(X)) -> d(X) mark(h(X)) -> h(X) active(h(X)) -> h(X) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [mark](x0) = [1 0 0]x0 + [1] [0 0 1] [0], [1 0 0] [0] [active](x0) = [1 0 0]x0 + [1] [0 0 1] [0], [1 0 0] [1] [c](x0) = [0 0 0]x0 + [0] [0 0 1] [0], [1 0 0] [d](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [0] [f](x0) = [1 0 1]x0 + [1] [0 1 0] [1], [1 0 0] [0] [h](x0) = [1 0 0]x0 + [1] [0 0 0] [1], [1 0 1] [g](x0) = [0 0 1]x0 [0 0 0] orientation: [2 0 1] [2] [1 0 1] [2] f(f(active(X))) = [2 0 1]X + [3] >= [1 0 1]X + [3] = f(g(f(c(mark(X))))) [1 0 1] [2] [0 0 0] [2] [1 0 0] [1] [1 0 0] c(active(X)) = [0 0 0]X + [0] >= [0 0 0]X = d(mark(X)) [0 0 1] [0] [0 0 0] [1 0 1] [0] [1 0 1] [0] f(mark(X)) = [1 0 1]X + [1] >= [1 0 1]X + [1] = mark(f(active(X))) [1 0 0] [2] [1 0 0] [2] [1 0 0] [1] [1 0 0] [1] c(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = c(active(X)) [0 0 1] [0] [0 0 1] [0] [1 0 1] [1 0 1] g(mark(X)) = [0 0 1]X >= [0 0 1]X = g(active(X)) [0 0 0] [0 0 0] [1 0 0] [1 0 0] d(mark(X)) = [0 0 0]X >= [0 0 0]X = d(active(X)) [0 0 0] [0 0 0] [1 0 0] [0] [1 0 0] [0] h(mark(X)) = [1 0 0]X + [1] >= [1 0 0]X + [1] = mark(h(active(X))) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 1] [0] mark(f(X)) = [1 0 1]X + [1] >= [1 0 1]X + [1] = f(X) [0 1 0] [1] [0 1 0] [1] [1 0 1] [0] [1 0 1] [0] active(f(X)) = [1 0 1]X + [1] >= [1 0 1]X + [1] = f(X) [0 1 0] [1] [0 1 0] [1] [1 0 0] [1] [1 0 0] [1] mark(c(X)) = [1 0 0]X + [2] >= [0 0 0]X + [0] = c(X) [0 0 1] [0] [0 0 1] [0] [1 0 0] [1] [1 0 0] [1] active(c(X)) = [1 0 0]X + [2] >= [0 0 0]X + [0] = c(X) [0 0 1] [0] [0 0 1] [0] [1 0 1] [0] [1 0 1] mark(g(X)) = [1 0 1]X + [1] >= [0 0 1]X = g(X) [0 0 0] [0] [0 0 0] [1 0 1] [0] [1 0 1] active(g(X)) = [1 0 1]X + [1] >= [0 0 1]X = g(X) [0 0 0] [0] [0 0 0] [1 0 0] [0] [1 0 0] mark(d(X)) = [1 0 0]X + [1] >= [0 0 0]X = d(X) [0 0 0] [0] [0 0 0] [1 0 0] [0] [1 0 0] active(d(X)) = [1 0 0]X + [1] >= [0 0 0]X = d(X) [0 0 0] [0] [0 0 0] [1 0 0] [0] [1 0 0] [0] mark(h(X)) = [1 0 0]X + [1] >= [1 0 0]X + [1] = h(X) [0 0 0] [1] [0 0 0] [1] [1 0 0] [0] [1 0 0] [0] active(h(X)) = [1 0 0]X + [1] >= [1 0 0]X + [1] = h(X) [0 0 0] [1] [0 0 0] [1] problem: f(f(active(X))) -> f(g(f(c(mark(X))))) f(mark(X)) -> mark(f(active(X))) c(mark(X)) -> c(active(X)) g(mark(X)) -> g(active(X)) d(mark(X)) -> d(active(X)) h(mark(X)) -> mark(h(active(X))) mark(f(X)) -> f(X) active(f(X)) -> f(X) mark(c(X)) -> c(X) active(c(X)) -> c(X) mark(g(X)) -> g(X) active(g(X)) -> g(X) mark(d(X)) -> d(X) active(d(X)) -> d(X) mark(h(X)) -> h(X) active(h(X)) -> h(X) String Reversal Processor: active(f(f(X))) -> mark(c(f(g(f(X))))) mark(f(X)) -> active(f(mark(X))) mark(c(X)) -> active(c(X)) mark(g(X)) -> active(g(X)) mark(d(X)) -> active(d(X)) mark(h(X)) -> active(h(mark(X))) f(mark(X)) -> f(X) f(active(X)) -> f(X) c(mark(X)) -> c(X) c(active(X)) -> c(X) g(mark(X)) -> g(X) g(active(X)) -> g(X) d(mark(X)) -> d(X) d(active(X)) -> d(X) h(mark(X)) -> h(X) h(active(X)) -> h(X) Bounds Processor: bound: 2 enrichment: match automaton: final states: {18,15,13,11,3,16,14,12,10,7,1} transitions: mark1(65) -> 66* g1(73) -> 74* g1(75) -> 76* g1(62) -> 63* g1(67) -> 68* d0(2) -> 15* c2(86) -> 87* h1(45) -> 46* h1(51) -> 52* h1(97) -> 98* h1(53) -> 54* h1(115) -> 116* h1(29) -> 30* h1(121) -> 122* h1(137) -> 138* h1(105) -> 106* h1(131) -> 132* f70() -> 2* active0(15) -> 14* active0(17) -> 16* active0(13) -> 12* active0(11) -> 10* active0(9) -> 7* g0(2) -> 13* g0(3) -> 4* mark0(2) -> 8* mark0(6) -> 1* active2(87) -> 88* f0(8) -> 9* f0(4) -> 5* f0(2) -> 3* c0(2) -> 11* c0(5) -> 6* f1(27) -> 28* f1(109) -> 110* f1(135) -> 136* f1(125) -> 126* f1(43) -> 44* f1(119) -> 120* f1(63) -> 64* f1(37) -> 38* f1(35) -> 36* f1(81) -> 82* active1(20) -> 21* c1(64) -> 65* c1(19) -> 20* f2(89) -> 90* f2(103) -> 104* f2(93) -> 94* h0(8) -> 17* h0(2) -> 18* 94 -> 82,62 74 -> 63* 132 -> 17* 68 -> 63* 17 -> 137,135 46 -> 17* 64 -> 86* 30 -> 17* 126 -> 82,9,43,53,62 7 -> 8* 104 -> 82,9,43,53,62 12 -> 8* 14 -> 8* 16 -> 8* 106 -> 17* 66 -> 7,8 28 -> 82,62,9 11 -> 115,109 2 -> 29,27 82 -> 62* 52 -> 17* 54 -> 17* 88 -> 66,7,81 116 -> 17* 6 -> 45,35 138 -> 17* 21 -> 1* 36 -> 82,62,75,9 38 -> 73,9 76 -> 63* 44 -> 82,62,67,9 13 -> 121,119 8 -> 81* 1 -> 7* 20 -> 93,51,37 90 -> 82,9,43,53,62 65 -> 97,89 110 -> 82,9,43,53,62 5 -> 19* 9 -> 53,43 120 -> 82,9,43,53,62 122 -> 17* 136 -> 82,9,43,53,62 15 -> 131,125 10 -> 8* 98 -> 17* 87 -> 105,103 problem: Qed