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

The system was reversed.

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

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

.cabb.bbbbbb
	rule cabb-> abacca at position 0
.abacca.bbbbbb
	rule cabb-> abacca at position 4
.abacabacca.bbbb
	rule a-> b at position 6
.abacabbcca.bbbb
	rule cabb-> abacca at position 8
.abacabbcabacca.bb
	rule a-> b at position 10
.abacabbcabbcca.bb
	rule cabb-> abacca at position 7
.abacabbabaccacca.bb
	rule a-> b at position 7
.abacabbbbaccacca.bb
	rule a-> b at position 9
.abacabbbbbccacca.bb
	rule cabb-> abacca at position 14
.abacabbbbbccacabacca.
	rule a-> b at position 16
.abacabbbbbccacabbcca.
	rule cabb-> abacca at position 13
.abacabbbbbccaabaccacca.
	rule a-> b at position 13
.abacabbbbbccabbaccacca.
	rule cabb-> abacca at position 11
.abacabbbbbcabaccaaccacca.
	rule a-> b at position 13
.abacabbbbbcabbccaaccacca.
	rule cabb-> abacca at position 10
.abacabbbbbabaccaccaaccacca.
	rule a-> b at position 10
.abacabbbbbbbaccaccaaccacca.
	rule a-> b at position 12
.abacabbbbbbbbccaccaaccacca.