/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

After renaming modulo { 0->0, q0->1, h->2, 1->3, q1->4, q2->5, q3->6, q4->7, q5->8 }, 
it remains to prove termination of the 31-rule system
{ 0 1 0 -> 0 0 1 ,
  0 1 2 -> 0 0 1 2 ,
  0 1 3 -> 0 3 1 ,
  3 1 0 -> 0 0 4 ,
  3 1 2 -> 0 0 4 2 ,
  3 1 3 -> 0 3 4 ,
  3 4 0 -> 3 0 4 ,
  3 4 2 -> 3 0 4 2 ,
  3 4 3 -> 3 3 4 ,
  0 4 0 -> 0 0 5 ,
  0 4 2 -> 0 0 5 2 ,
  0 4 3 -> 0 3 5 ,
  3 5 0 -> 3 0 5 ,
  3 5 2 -> 3 0 5 2 ,
  3 5 3 -> 3 3 5 ,
  0 5 -> 6 3 ,
  3 6 -> 6 3 ,
  0 6 -> 7 0 ,
  3 7 -> 7 3 ,
  0 7 0 -> 3 0 8 ,
  0 7 2 -> 3 0 8 2 ,
  0 7 3 -> 3 3 8 ,
  3 8 0 -> 0 0 4 ,
  3 8 2 -> 0 0 4 2 ,
  3 8 3 -> 0 3 4 ,
  2 1 -> 2 0 1 ,
  2 4 -> 2 0 4 ,
  2 5 -> 2 0 5 ,
  2 6 -> 2 0 6 ,
  2 7 -> 2 0 7 ,
  2 8 -> 2 0 8 }


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

.abc.
	rule abc-> aabc at position 0
.aabc.