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


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


NO

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


The system was reversed.

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


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

.cbba.bababa
	rule cbba-> aaacca at position 0
.aaacca.bababa
	rule a-> b at position 5
.aaaccb.bababa
	rule cbba-> aaacca at position 4
.aaacaaacca.baba
	rule a-> b at position 4
.aaacbaacca.baba
	rule a-> b at position 5
.aaacbbacca.baba
	rule a-> b at position 9
.aaacbbaccb.baba
	rule cbba-> aaacca at position 8
.aaacbbacaaacca.ba
	rule a-> b at position 8
.aaacbbacbaacca.ba
	rule a-> b at position 9
.aaacbbacbbacca.ba
	rule cbba-> aaacca at position 7
.aaacbbaaaaccacca.ba
	rule a-> b at position 7
.aaacbbabaaccacca.ba
	rule a-> b at position 9
.aaacbbababccacca.ba
	rule a-> b at position 12
.aaacbbababccbcca.ba
	rule a-> b at position 15
.aaacbbababccbccb.ba
	rule cbba-> aaacca at position 14
.aaacbbababccbcaaacca.
	rule a-> b at position 14
.aaacbbababccbcbaacca.
	rule a-> b at position 15
.aaacbbababccbcbbacca.
	rule cbba-> aaacca at position 13
.aaacbbababccbaaaccacca.
	rule a-> b at position 13
.aaacbbababccbbaaccacca.
	rule cbba-> aaacca at position 11
.aaacbbababcaaaccaaccacca.
	rule a-> b at position 11
.aaacbbababcbaaccaaccacca.
	rule a-> b at position 12
.aaacbbababcbbaccaaccacca.
	rule cbba-> aaacca at position 10
.aaacbbababaaaccaccaaccacca.
	rule a-> b at position 11
.aaacbbabababaccaccaaccacca.