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


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


NO

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


The system was reversed.

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


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

.ababc.babcbc
	rule ababc-> cbcbababa at position 0
.cbcbababa.babcbc
	rule ababc-> cbcbababa at position 8
.cbcbababcbcbababa.bc
	rule ababc-> cbcbababa at position 4
.cbcbcbcbabababcbababa.bc
	rule ababc-> cbcbababa at position 18
.cbcbcbcbabababcbabcbcbababa.