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


The system was reversed.

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


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

.ba.ca
	rule ba-> aabbca at position 0
.aabbca.ca
	rule a->  at position 5
.aabbc.ca
	rule cc->  at position 4
.aabb.a
	rule ba-> aabbca at position 3
.aabaabbca.
	rule a->  at position 3
.aababbca.
	rule b->  at position 4
.aababca.
	rule b->  at position 4
.aabaca.