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


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


NO

After renaming modulo the bijection { a ↦ 0, b ↦ 1, c ↦ 2 },
it remains to prove termination of the 4-rule system
{ 0 ⟶ ,
  0 1 ⟶ 1 1 0 2 0 ,
  1 ⟶ ,
  2 1 2 ⟶ }

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

.ab.bbbcbb
	rule ab-> bbaca at position 0
.bbaca.bbbcbb
	rule ab-> bbaca at position 4
.bbacbbaca.bbcbb
	rule b->  at position 4
.bbacbaca.bbcbb
	rule a->  at position 5
.bbacbca.bbcbb
	rule cbc->  at position 3
.bbaa.bbcbb
	rule ab-> bbaca at position 3
.bbabbaca.bcbb
	rule a->  at position 7
.bbabbac.bcbb
	rule cbc->  at position 6
.bbabba.bb
	rule ab-> bbaca at position 5
.bbabbbbaca.b
	rule a->  at position 7
.bbabbbbca.b
	rule ab-> bbaca at position 8
.bbabbbbcbbaca.