/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 3-rule system
{ 0 -> ,
  0 1 -> 1 0 0 2 0 0 ,
  2 2 -> 1 }


The system was reversed.

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


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

.ba.a
	rule ba-> aacaab at position 0
.aacaab.a
	rule a->  at position 3
.aacab.a
	rule a->  at position 3
.aacb.a
	rule ba-> aacaab at position 3
.aacaacaab.
	rule a->  at position 3
.aacacaab.
	rule a->  at position 3
.aaccaab.
	rule cc-> b at position 2
.aabaab.