/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 { 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 0 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 ab-> bbaca at position 8
.bbacbbacbbaca.bcbb
	rule b->  at position 8
.bbacbbacbaca.bcbb
	rule b->  at position 8
.bbacbbacaca.bcbb
	rule cac->  at position 7
.bbacbbaa.bcbb
	rule ab-> bbaca at position 7
.bbacbbabbaca.cbb
	rule cac->  at position 10
.bbacbbabba.bb
	rule ab-> bbaca at position 9
.bbacbbabbbbaca.b
	rule a->  at position 11
.bbacbbabbbbca.b
	rule ab-> bbaca at position 12
.bbacbbabbbbcbbaca.