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


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

.ab.bbbabb
	rule ab-> ca at position 0
.ca.bbbabb
	rule ab-> ca at position 1
.cca.bbabb
	rule cc-> bab at position 0
.baba.bbabb
	rule ab-> ca at position 3
.babca.babb
	rule ab-> ca at position 4
.babcca.abb
	rule cc-> bab at position 3
.babbaba.abb
	rule ab-> ca at position 4
.babbcaa.abb
	rule aa-> b at position 6
.babbcab.bb
	rule ab-> ca at position 5
.babbcca.bb
	rule cc-> bab at position 4
.babbbaba.bb
	rule ab-> ca at position 5
.babbbcaa.bb
	rule ab-> ca at position 7
.babbbcaca.b
	rule ab-> ca at position 8
.babbbcacca.
	rule cc-> bab at position 7
.babbbcababa.
	rule ab-> ca at position 6
.babbbccaaba.
	rule cc-> bab at position 5
.babbbbabaaba.
	rule aa-> b at position 8
.babbbbabbba.