/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: strict: c(c(c(x1))) -> b(b(b(x1))) weak: b(a(a(x1))) -> a(b(c(x1))) b(b(b(x1))) -> a(a(b(x1))) b(c(a(x1))) -> a(c(a(x1))) a(c(b(x1))) -> c(a(a(x1))) Proof: String Reversal Processor: strict: c(c(c(x1))) -> b(b(b(x1))) weak: a(a(b(x1))) -> c(b(a(x1))) b(b(b(x1))) -> b(a(a(x1))) a(c(b(x1))) -> a(c(a(x1))) b(c(a(x1))) -> a(a(c(x1))) Matrix Interpretation Processor: dim=2 interpretation: [1 1] [0] [b](x0) = [1 0]x0 + [1], [1 1] [0] [c](x0) = [1 0]x0 + [1], [1 1] [a](x0) = [1 0]x0 orientation: [3 2] [2] [3 2] [2] c(c(c(x1))) = [2 1]x1 + [2] >= [2 1]x1 + [2] = b(b(b(x1))) [3 2] [1] [3 2] [1] a(a(b(x1))) = [2 1]x1 + [1] >= [2 1]x1 + [1] = c(b(a(x1))) [3 2] [2] [3 2] [0] b(b(b(x1))) = [2 1]x1 + [2] >= [2 1]x1 + [1] = b(a(a(x1))) [3 2] [2] [3 2] [1] a(c(b(x1))) = [2 1]x1 + [1] >= [2 1]x1 + [0] = a(c(a(x1))) [3 2] [1] [3 2] [1] b(c(a(x1))) = [2 1]x1 + [1] >= [2 1]x1 + [1] = a(a(c(x1))) problem: strict: c(c(c(x1))) -> b(b(b(x1))) weak: a(a(b(x1))) -> c(b(a(x1))) b(c(a(x1))) -> a(a(c(x1))) String Reversal Processor: strict: c(c(c(x1))) -> b(b(b(x1))) weak: b(a(a(x1))) -> a(b(c(x1))) a(c(b(x1))) -> c(a(a(x1))) Bounds Processor: bound: 1 enrichment: match-rt automaton: final states: {4} transitions: b1(11) -> 12* b1(9) -> 10* b1(32) -> 33* b1(14) -> 15* b1(29) -> 30* b1(10) -> 11* a1(22) -> 23* a1(15) -> 16* a1(33) -> 34* a1(21) -> 22* c1(13) -> 14* c1(31) -> 32* c1(23) -> 24* c0(4) -> 4* b0(4) -> 4* a0(4) -> 4* 24 -> 4* 30 -> 10* 12 -> 14,4 16 -> 10* 4 -> 13,9 11 -> 21* 21 -> 31* 34 -> 30* 23 -> 29* problem: strict: weak: b(a(a(x1))) -> a(b(c(x1))) a(c(b(x1))) -> c(a(a(x1))) Qed