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


The system was reversed.

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


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

.abb.bbbbbb
	rule abb-> bbbcc at position 0
.bbbcc.bbbbbb
	rule cb-> ba at position 4
.bbbcba.bbbbb
	rule cb-> ba at position 3
.bbbbaa.bbbbb
	rule abb-> bbbcc at position 5
.bbbbabbbcc.bbb
	rule cb-> ba at position 9
.bbbbabbbcba.bb
	rule cb-> ba at position 8
.bbbbabbbbaa.bb
	rule abb-> bbbcc at position 10
.bbbbabbbbabbbcc.
	rule abb-> bbbcc at position 9
.bbbbabbbbbbbccbcc.
	rule cb-> ba at position 13
.bbbbabbbbbbbcbacc.
	rule cb-> ba at position 12
.bbbbabbbbbbbbaacc.