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

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

.cabb.bbbbbb
	rule cabb-> aabcca at position 0
.aabcca.bbbbbb
	rule cabb-> aabcca at position 4
.aabcaabcca.bbbb
	rule a-> b at position 5
.aabcabbcca.bbbb
	rule cabb-> aabcca at position 8
.aabcabbcaabcca.bb
	rule a-> b at position 9
.aabcabbcabbcca.bb
	rule cabb-> aabcca at position 7
.aabcabbaabccacca.bb
	rule a-> b at position 7
.aabcabbbabccacca.bb
	rule a-> b at position 8
.aabcabbbbbccacca.bb
	rule cabb-> aabcca at position 14
.aabcabbbbbccacaabcca.
	rule a-> b at position 15
.aabcabbbbbccacabbcca.
	rule cabb-> aabcca at position 13
.aabcabbbbbccaaabccacca.
	rule a-> b at position 13
.aabcabbbbbccababccacca.
	rule a-> b at position 14
.aabcabbbbbccabbbccacca.
	rule cabb-> aabcca at position 11
.aabcabbbbbcaabccabccacca.
	rule a-> b at position 12
.aabcabbbbbcabbccabccacca.
	rule cabb-> aabcca at position 10
.aabcabbbbbaabccaccabccacca.
	rule a-> b at position 10
.aabcabbbbbbabccaccabccacca.
	rule a-> b at position 11
.aabcabbbbbbbbccaccabccacca.