/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

After renaming modulo the bijection { a ↦ 0, b ↦ 1, c ↦ 2 },
it remains to prove termination of the 2-rule system
{ 0 0 1 ⟶ 1 1 2 0 0 ,
  0 2 ⟶ 0 0 }

The system was reversed.

After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1, 2 ↦ 2 },
it remains to prove termination of the 2-rule system
{ 0 1 1 ⟶ 1 1 2 0 0 ,
  2 1 ⟶ 1 1 }

Loop of length 11 starting with a string of length 9
using right expansion and the encoding { 0 ↦ a, 1 ↦ b, ... }:

.abb.bbbbbb
	rule abb-> bbcaa at position 0
.bbcaa.bbbbbb
	rule abb-> bbcaa at position 4
.bbcabbcaa.bbbb
	rule abb-> bbcaa at position 8
.bbcabbcabbcaa.bb
	rule abb-> bbcaa at position 7
.bbcabbcbbcaacaa.bb
	rule cb-> bb at position 6
.bbcabbbbbcaacaa.bb
	rule abb-> bbcaa at position 14
.bbcabbbbbcaacabbcaa.
	rule abb-> bbcaa at position 13
.bbcabbbbbcaacbbcaacaa.
	rule cb-> bb at position 12
.bbcabbbbbcaabbbcaacaa.
	rule abb-> bbcaa at position 11
.bbcabbbbbcabbcaabcaacaa.
	rule abb-> bbcaa at position 10
.bbcabbbbbcbbcaacaabcaacaa.
	rule cb-> bb at position 9
.bbcabbbbbbbbcaacaabcaacaa.