/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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 2 ,
  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 ⟶ 2 1 2 0 0 ,
  2 1 ⟶ 1 1 }

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

.abb.bbbbbb
	rule abb-> cbcaa at position 0
.cbcaa.bbbbbb
	rule abb-> cbcaa at position 4
.cbcacbcaa.bbbb
	rule cb-> bb at position 4
.cbcabbcaa.bbbb
	rule abb-> cbcaa at position 8
.cbcabbcacbcaa.bb
	rule cb-> bb at position 8
.cbcabbcabbcaa.bb
	rule abb-> cbcaa at position 7
.cbcabbccbcaacaa.bb
	rule cb-> bb at position 7
.cbcabbcbbcaacaa.bb
	rule cb-> bb at position 6
.cbcabbbbbcaacaa.bb
	rule abb-> cbcaa at position 14
.cbcabbbbbcaacacbcaa.
	rule cb-> bb at position 14
.cbcabbbbbcaacabbcaa.
	rule abb-> cbcaa at position 13
.cbcabbbbbcaaccbcaacaa.
	rule cb-> bb at position 13
.cbcabbbbbcaacbbcaacaa.
	rule cb-> bb at position 12
.cbcabbbbbcaabbbcaacaa.
	rule abb-> cbcaa at position 11
.cbcabbbbbcacbcaabcaacaa.
	rule cb-> bb at position 11
.cbcabbbbbcabbcaabcaacaa.
	rule abb-> cbcaa at position 10
.cbcabbbbbccbcaacaabcaacaa.
	rule cb-> bb at position 10
.cbcabbbbbcbbcaacaabcaacaa.
	rule cb-> bb at position 9
.cbcabbbbbbbbcaacaabcaacaa.