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

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

.abbc.bbccbcc
	rule abbc-> ccaaaa at position 0
.ccaaaa.bbccbcc
	rule a-> b at position 3
.ccabaa.bbccbcc
	rule a-> b at position 4
.ccabba.bbccbcc
	rule abbc-> ccaaaa at position 5
.ccabbccaaaa.cbcc
	rule abbc-> ccaaaa at position 2
.ccccaaaacaaaa.cbcc
	rule a-> b at position 6
.ccccaabacaaaa.cbcc
	rule a-> b at position 7
.ccccaabbcaaaa.cbcc
	rule abbc-> ccaaaa at position 5
.ccccaccaaaaaaaa.cbcc
	rule a-> b at position 10
.ccccaccaaabaaaa.cbcc
	rule a-> b at position 11
.ccccaccaaabbaaa.cbcc
	rule a-> b at position 13
.ccccaccaaabbaba.cbcc
	rule a-> b at position 14
.ccccaccaaabbabb.cbcc
	rule abbc-> ccaaaa at position 12
.ccccaccaaabbccaaaa.bcc
	rule abbc-> ccaaaa at position 9
.ccccaccaaccaaaacaaaa.bcc
	rule a-> b at position 13
.ccccaccaaccaabacaaaa.bcc
	rule a-> b at position 14
.ccccaccaaccaabbcaaaa.bcc
	rule a-> b at position 16
.ccccaccaaccaabbcbaaa.bcc
	rule a-> b at position 17
.ccccaccaaccaabbcbbaa.bcc
	rule a-> b at position 19
.ccccaccaaccaabbcbbab.bcc
	rule abbc-> ccaaaa at position 18
.ccccaccaaccaabbcbbccaaaa.c
	rule a-> b at position 20
.ccccaccaaccaabbcbbccbaaa.c
	rule a-> b at position 22
.ccccaccaaccaabbcbbccbaba.c
	rule a-> b at position 23
.ccccaccaaccaabbcbbccbabb.c
	rule abbc-> ccaaaa at position 21
.ccccaccaaccaabbcbbccbccaaaa.