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


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


NO

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


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

.ab.cbcbbc
	rule ab-> baca at position 0
.baca.cbcbbc
	rule a->  at position 3
.bac.cbcbbc
	rule cc-> b at position 2
.bab.bcbbc
	rule ab-> baca at position 1
.bbaca.bcbbc
	rule ab-> baca at position 4
.bbacbaca.cbbc
	rule cb->  at position 3
.bbaaca.cbbc
	rule a->  at position 5
.bbaac.cbbc
	rule cc-> b at position 4
.bbaab.bbc
	rule ab-> baca at position 3
.bbabaca.bbc
	rule a->  at position 4
.bbabca.bbc
	rule ab-> baca at position 5
.bbabcbaca.bc
	rule a->  at position 6
.bbabcbca.bc
	rule ab-> baca at position 7
.bbabcbcbaca.c
	rule a->  at position 10
.bbabcbcbac.c
	rule cc-> b at position 9
.bbabcbcbab.
	rule ab-> baca at position 8
.bbabcbcbbaca.
	rule a->  at position 9
.bbabcbcbbca.