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


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

.aa.bababa
	rule aa-> babcc at position 0
.babcc.bababa
	rule cb-> a at position 4
.babca.ababa
	rule aa-> babcc at position 4
.babcbabcc.baba
	rule cb-> a at position 3
.babaabcc.baba
	rule aa-> babcc at position 3
.babbabccbcc.baba
	rule cb-> a at position 7
.babbabcacc.baba
	rule a->  at position 7
.babbabccc.baba
	rule cb-> a at position 8
.babbabcca.aba
	rule aa-> babcc at position 8
.babbabccbabcc.ba
	rule cb-> a at position 7
.babbabcaabcc.ba
	rule aa-> babcc at position 7
.babbabcbabccbcc.ba
	rule cb-> a at position 6
.babbabaabccbcc.ba
	rule c->  at position 9
.babbabaabcbcc.ba
	rule cb-> a at position 9
.babbabaabacc.ba
	rule cb-> a at position 11
.babbabaabaca.a
	rule aa-> babcc at position 11
.babbabaabacbabcc.
	rule cb-> a at position 10
.babbabaabaaabcc.
	rule aa-> babcc at position 10
.babbabaabababccbcc.
	rule c->  at position 13
.babbabaabababcbcc.
	rule cb-> a at position 13
.babbabaabababacc.