/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: strict: b(a(a(x1))) -> c(b(b(x1))) a(a(a(x1))) -> a(c(c(x1))) a(c(b(x1))) -> a(a(b(x1))) c(a(c(x1))) -> c(c(c(x1))) weak: c(a(a(x1))) -> c(a(a(x1))) c(c(a(x1))) -> c(b(b(x1))) a(a(b(x1))) -> b(a(b(x1))) Proof: Arctic Interpretation Processor: dimension: 1 interpretation: [b](x0) = x0, [a](x0) = 4x0, [c](x0) = 4x0 orientation: b(a(a(x1))) = 8x1 >= 4x1 = c(b(b(x1))) a(a(a(x1))) = 12x1 >= 12x1 = a(c(c(x1))) a(c(b(x1))) = 8x1 >= 8x1 = a(a(b(x1))) c(a(c(x1))) = 12x1 >= 12x1 = c(c(c(x1))) c(a(a(x1))) = 12x1 >= 12x1 = c(a(a(x1))) c(c(a(x1))) = 12x1 >= 4x1 = c(b(b(x1))) a(a(b(x1))) = 8x1 >= 4x1 = b(a(b(x1))) problem: strict: a(a(a(x1))) -> a(c(c(x1))) a(c(b(x1))) -> a(a(b(x1))) c(a(c(x1))) -> c(c(c(x1))) weak: c(a(a(x1))) -> c(a(a(x1))) String Reversal Processor: strict: a(a(a(x1))) -> c(c(a(x1))) b(c(a(x1))) -> b(a(a(x1))) c(a(c(x1))) -> c(c(c(x1))) weak: a(a(c(x1))) -> a(a(c(x1))) Bounds Processor: bound: 1 enrichment: match-rt automaton: final states: {4} transitions: c1(49) -> 50* c1(32) -> 33* c1(31) -> 32* c1(64) -> 65* b1(19) -> 20* a1(17) -> 18* a1(18) -> 19* a0(4) -> 4* b0(4) -> 4* c0(4) -> 4* 19 -> 18* 4 -> 49,17 20 -> 4* 65 -> 31* 50 -> 64,17 18 -> 31* 32 -> 50* 33 -> 32,18,19 problem: strict: a(a(a(x1))) -> c(c(a(x1))) c(a(c(x1))) -> c(c(c(x1))) weak: a(a(c(x1))) -> a(a(c(x1))) Arctic Interpretation Processor: dimension: 1 interpretation: [a](x0) = 5x0, [c](x0) = 2x0 orientation: a(a(a(x1))) = 15x1 >= 9x1 = c(c(a(x1))) c(a(c(x1))) = 9x1 >= 6x1 = c(c(c(x1))) a(a(c(x1))) = 12x1 >= 12x1 = a(a(c(x1))) problem: strict: weak: a(a(c(x1))) -> a(a(c(x1))) Qed