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


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


NO

After renaming modulo the bijection { 0 ↦ 0, q0 ↦ 1, 1 ↦ 2, q1 ↦ 3, q2 ↦ 4, q3 ↦ 5, q4 ↦ 6, q5 ↦ 7, q6 ↦ 8, q7 ↦ 9, q8 ↦ 10, q9 ↦ 11, h ↦ 12 },
it remains to prove termination of the 43-rule system
{ 0 1 0 ⟶ 0 0 1 ,
  0 1 2 ⟶ 0 2 1 ,
  2 1 0 ⟶ 0 0 3 ,
  2 1 2 ⟶ 0 2 3 ,
  2 3 0 ⟶ 2 0 3 ,
  2 3 2 ⟶ 2 2 3 ,
  0 3 0 ⟶ 0 0 4 ,
  0 3 2 ⟶ 0 2 4 ,
  2 4 0 ⟶ 2 0 4 ,
  2 4 2 ⟶ 2 2 4 ,
  0 4 ⟶ 5 2 ,
  2 5 ⟶ 5 2 ,
  0 5 ⟶ 6 0 ,
  2 6 ⟶ 6 2 ,
  0 6 0 ⟶ 2 0 7 ,
  0 6 2 ⟶ 2 2 7 ,
  2 7 0 ⟶ 0 0 3 ,
  2 7 2 ⟶ 0 2 3 ,
  0 7 ⟶ 8 0 ,
  2 8 ⟶ 8 2 ,
  2 9 0 ⟶ 0 0 10 ,
  2 9 2 ⟶ 0 2 10 ,
  0 10 ⟶ 0 1 ,
  2 10 0 ⟶ 2 0 10 ,
  2 10 2 ⟶ 2 2 10 ,
  0 8 ⟶ 11 0 ,
  0 11 0 ⟶ 2 0 9 ,
  0 11 2 ⟶ 2 2 9 ,
  2 11 ⟶ 11 2 ,
  12 1 ⟶ 12 0 1 ,
  1 12 ⟶ 1 0 12 ,
  12 3 ⟶ 12 0 3 ,
  3 12 ⟶ 3 0 12 ,
  12 4 ⟶ 12 0 4 ,
  4 12 ⟶ 4 0 12 ,
  12 5 ⟶ 12 0 5 ,
  5 12 ⟶ 5 0 12 ,
  12 6 ⟶ 12 0 6 ,
  6 12 ⟶ 6 0 12 ,
  12 7 ⟶ 12 0 7 ,
  7 12 ⟶ 7 0 12 ,
  12 8 ⟶ 12 0 8 ,
  8 12 ⟶ 8 0 12 }

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

.aba.m
	rule aba-> aab at position 0
.aab.m
	rule bm-> bam at position 2
.aabam.