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


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


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

.cc.aaaa
	rule cc-> aacab at position 0
.aacab.aaaa
	rule a->  at position 3
.aacb.aaaa
	rule ba-> cb at position 3
.aaccb.aaa
	rule ba-> cb at position 4
.aacccb.aa
	rule ba-> cb at position 5
.aaccccb.a
	rule ba-> cb at position 6
.aacccccb.
	rule cc-> aacab at position 5
.aacccaacabb.
	rule a->  at position 5
.aacccacabb.
	rule a->  at position 5
.aaccccabb.
	rule cc-> aacab at position 4
.aaccaacababb.
	rule a->  at position 7
.aaccaacbabb.
	rule ba-> cb at position 7
.aaccaaccbbb.
	rule cc-> aacab at position 6
.aaccaaaacabbbb.