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

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

.ab.bbbbbb
	rule ab-> bbaca at position 0
.bbaca.bbbbbb
	rule ab-> bbaca at position 4
.bbacbbaca.bbbbb
	rule b->  at position 4
.bbacbaca.bbbbb
	rule b->  at position 4
.bbacaca.bbbbb
	rule a->  at position 4
.bbacca.bbbbb
	rule ab-> bbaca at position 5
.bbaccbbaca.bbbb
	rule ccb->  at position 3
.bbabaca.bbbb
	rule ab-> bbaca at position 6
.bbabacbbaca.bbb
	rule b->  at position 6
.bbabacbaca.bbb
	rule b->  at position 6
.bbabacaca.bbb
	rule a->  at position 6
.bbabacca.bbb
	rule ab-> bbaca at position 7
.bbabaccbbaca.bb
	rule ccb->  at position 5
.bbababaca.bb
	rule ab-> bbaca at position 4
.bbabbbacaaca.bb
	rule a->  at position 8
.bbabbbacaca.bb
	rule a->  at position 8
.bbabbbacca.bb
	rule ab-> bbaca at position 9
.bbabbbaccbbaca.b
	rule ccb->  at position 7
.bbabbbabaca.b
	rule ab-> bbaca at position 6
.bbabbbbbacaaca.b
	rule a->  at position 10
.bbabbbbbacaca.b
	rule a->  at position 10
.bbabbbbbacca.b
	rule ab-> bbaca at position 11
.bbabbbbbaccbbaca.
	rule ccb->  at position 9
.bbabbbbbabaca.
	rule ab-> bbaca at position 8
.bbabbbbbbbacaaca.