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


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

.c.bc
	rule c->= cba at position 0
.cba.bc
	rule abc-> c at position 2
.cbc.