/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 2-rule system
{ 0 ⟶ 1 ,
  1 1 1 2 ⟶ 2 2 0 1 0 0 }

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

.bbbc.bbccbcc
	rule bbbc-> ccabaa at position 0
.ccabaa.bbccbcc
	rule a-> b at position 2
.ccbbaa.bbccbcc
	rule a-> b at position 4
.ccbbba.bbccbcc
	rule a-> b at position 5
.ccbbbb.bbccbcc
	rule bbbc-> ccabaa at position 5
.ccbbbccabaa.cbcc
	rule bbbc-> ccabaa at position 2
.ccccabaacabaa.cbcc
	rule a-> b at position 6
.ccccabbacabaa.cbcc
	rule a-> b at position 7
.ccccabbbcabaa.cbcc
	rule bbbc-> ccabaa at position 5
.ccccaccabaaabaa.cbcc
	rule a-> b at position 9
.ccccaccabbaabaa.cbcc
	rule a-> b at position 10
.ccccaccabbbabaa.cbcc
	rule a-> b at position 11
.ccccaccabbbbbaa.cbcc
	rule a-> b at position 13
.ccccaccabbbbbba.cbcc
	rule a-> b at position 14
.ccccaccabbbbbbb.cbcc
	rule bbbc-> ccabaa at position 12
.ccccaccabbbbccabaa.bcc
	rule bbbc-> ccabaa at position 9
.ccccaccabccabaacabaa.bcc
	rule a-> b at position 13
.ccccaccabccabbacabaa.bcc
	rule a-> b at position 14
.ccccaccabccabbbcabaa.bcc
	rule a-> b at position 16
.ccccaccabccabbbcbbaa.bcc
	rule a-> b at position 18
.ccccaccabccabbbcbbba.bcc
	rule a-> b at position 19
.ccccaccabccabbbcbbbb.bcc
	rule bbbc-> ccabaa at position 18
.ccccaccabccabbbcbbccabaa.c
	rule a-> b at position 20
.ccccaccabccabbbcbbccbbaa.c
	rule a-> b at position 22
.ccccaccabccabbbcbbccbbba.c
	rule a-> b at position 23
.ccccaccabccabbbcbbccbbbb.c
	rule bbbc-> ccabaa at position 21
.ccccaccabccabbbcbbccbccabaa.