/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 ⟶ 0 2 2 0 0 0 ,
  0 2 ⟶ 1 }

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 1 2 2 1 ,
  2 1 ⟶ 0 }

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

.abb.bbbbbb
	rule abb-> bbbccb at position 0
.bbbccb.bbbbbb
	rule cb-> a at position 4
.bbbca.bbbbbb
	rule abb-> bbbccb at position 4
.bbbcbbbccb.bbbb
	rule cb-> a at position 3
.bbbabbccb.bbbb
	rule cb-> a at position 7
.bbbabbca.bbbb
	rule abb-> bbbccb at position 7
.bbbabbcbbbccb.bb
	rule cb-> a at position 6
.bbbabbabbccb.bb
	rule abb-> bbbccb at position 6
.bbbabbbbbccbccb.bb
	rule cb-> a at position 10
.bbbabbbbbcaccb.bb
	rule cb-> a at position 12
.bbbabbbbbcaca.bb
	rule abb-> bbbccb at position 12
.bbbabbbbbcacbbbccb.
	rule cb-> a at position 11
.bbbabbbbbcaabbccb.
	rule abb-> bbbccb at position 11
.bbbabbbbbcabbbccbccb.
	rule abb-> bbbccb at position 10
.bbbabbbbbcbbbccbbccbccb.
	rule cb-> a at position 9
.bbbabbbbbabbccbbccbccb.
	rule abb-> bbbccb at position 9
.bbbabbbbbbbbccbccbbccbccb.