/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: a(s(x1)) -> s(a(x1)) b(a(b(s(x1)))) -> a(b(s(a(x1)))) b(a(b(b(x1)))) -> a(b(a(b(x1)))) a(b(a(a(x1)))) -> b(a(b(a(x1)))) Proof: String Reversal Processor: s(a(x1)) -> a(s(x1)) s(b(a(b(x1)))) -> a(s(b(a(x1)))) b(b(a(b(x1)))) -> b(a(b(a(x1)))) a(a(b(a(x1)))) -> a(b(a(b(x1)))) Matrix Interpretation Processor: dim=1 interpretation: [b](x0) = x0 + 1, [a](x0) = x0 + 1, [s](x0) = 4x0 + 3 orientation: s(a(x1)) = 4x1 + 7 >= 4x1 + 4 = a(s(x1)) s(b(a(b(x1)))) = 4x1 + 15 >= 4x1 + 12 = a(s(b(a(x1)))) b(b(a(b(x1)))) = x1 + 4 >= x1 + 4 = b(a(b(a(x1)))) a(a(b(a(x1)))) = x1 + 4 >= x1 + 4 = a(b(a(b(x1)))) problem: b(b(a(b(x1)))) -> b(a(b(a(x1)))) a(a(b(a(x1)))) -> a(b(a(b(x1)))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {6,1} transitions: f30() -> 2* b0(5) -> 1* b0(2) -> 7* b0(8) -> 9* b0(3) -> 4* a0(7) -> 8* a0(2) -> 3* a0(9) -> 6* a0(4) -> 5* 1 -> 7* 6 -> 3* problem: Qed