/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: strict: a(c(a(x1))) -> a(b(b(x1))) a(c(a(x1))) -> a(c(b(x1))) a(c(c(x1))) -> b(b(c(x1))) b(c(a(x1))) -> c(b(a(x1))) weak: c(b(c(x1))) -> b(c(c(x1))) b(b(b(x1))) -> c(a(c(x1))) Proof: String Reversal Processor: strict: a(c(a(x1))) -> b(b(a(x1))) a(c(a(x1))) -> b(c(a(x1))) c(c(a(x1))) -> c(b(b(x1))) a(c(b(x1))) -> a(b(c(x1))) weak: c(b(c(x1))) -> c(c(b(x1))) b(b(b(x1))) -> c(a(c(x1))) Arctic Interpretation Processor: dimension: 1 interpretation: [c](x0) = x0, [a](x0) = 8x0, [b](x0) = 4x0 orientation: a(c(a(x1))) = 16x1 >= 16x1 = b(b(a(x1))) a(c(a(x1))) = 16x1 >= 12x1 = b(c(a(x1))) c(c(a(x1))) = 8x1 >= 8x1 = c(b(b(x1))) a(c(b(x1))) = 12x1 >= 12x1 = a(b(c(x1))) c(b(c(x1))) = 4x1 >= 4x1 = c(c(b(x1))) b(b(b(x1))) = 12x1 >= 8x1 = c(a(c(x1))) problem: strict: a(c(a(x1))) -> b(b(a(x1))) c(c(a(x1))) -> c(b(b(x1))) a(c(b(x1))) -> a(b(c(x1))) weak: c(b(c(x1))) -> c(c(b(x1))) Arctic Interpretation Processor: dimension: 1 interpretation: [c](x0) = x0, [a](x0) = 13x0, [b](x0) = x0 orientation: a(c(a(x1))) = 26x1 >= 13x1 = b(b(a(x1))) c(c(a(x1))) = 13x1 >= x1 = c(b(b(x1))) a(c(b(x1))) = 13x1 >= 13x1 = a(b(c(x1))) c(b(c(x1))) = x1 >= x1 = c(c(b(x1))) problem: strict: a(c(b(x1))) -> a(b(c(x1))) weak: c(b(c(x1))) -> c(c(b(x1))) String Reversal Processor: strict: b(c(a(x1))) -> c(b(a(x1))) weak: c(b(c(x1))) -> b(c(c(x1))) Bounds Processor: bound: 1 enrichment: match-rt automaton: final states: {4} transitions: c1(11) -> 12* c1(20) -> 21* c1(13) -> 14* a1(9) -> 10* b1(10) -> 11* b1(14) -> 15* b0(4) -> 4* c0(4) -> 4* a0(4) -> 4* 12 -> 13,4 14 -> 20* 4 -> 9* 21 -> 14* 15 -> 4* problem: strict: weak: c(b(c(x1))) -> b(c(c(x1))) Qed