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


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

.abac.baccacc
	rule abac-> ccaaaa at position 0
.ccaaaa.baccacc
	rule a-> b at position 3
.ccabaa.baccacc
	rule abac-> ccaaaa at position 5
.ccabaccaaaa.cacc
	rule abac-> ccaaaa at position 2
.ccccaaaacaaaa.cacc
	rule a-> b at position 6
.ccccaabacaaaa.cacc
	rule abac-> ccaaaa at position 5
.ccccaccaaaaaaaa.cacc
	rule a-> b at position 10
.ccccaccaaabaaaa.cacc
	rule a-> b at position 13
.ccccaccaaabaaba.cacc
	rule abac-> ccaaaa at position 12
.ccccaccaaabaccaaaa.acc
	rule abac-> ccaaaa at position 9
.ccccaccaaccaaaacaaaa.acc
	rule a-> b at position 13
.ccccaccaaccaabacaaaa.acc
	rule a-> b at position 16
.ccccaccaaccaabacbaaa.acc
	rule a-> b at position 19
.ccccaccaaccaabacbaab.acc
	rule abac-> ccaaaa at position 18
.ccccaccaaccaabacbaccaaaa.c
	rule a-> b at position 22
.ccccaccaaccaabacbaccaaba.c
	rule abac-> ccaaaa at position 21
.ccccaccaaccaabacbaccaccaaaa.