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


The system was reversed.

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


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

.cba.aaaaaa
	rule cba-> aaacca at position 0
.aaacca.aaaaaa
	rule aa-> b at position 5
.aaaccb.aaaaa
	rule cba-> aaacca at position 4
.aaacaaacca.aaaa
	rule aa-> b at position 4
.aaacbacca.aaaa
	rule aa-> b at position 8
.aaacbaccb.aaa
	rule cba-> aaacca at position 7
.aaacbacaaacca.aa
	rule aa-> b at position 7
.aaacbacbacca.aa
	rule cba-> aaacca at position 6
.aaacbaaaaccacca.aa
	rule aa-> b at position 14
.aaacbaaaaccaccb.a
	rule cba-> aaacca at position 13
.aaacbaaaaccacaaacca.
	rule aa-> b at position 13
.aaacbaaaaccacbacca.
	rule cba-> aaacca at position 12
.aaacbaaaaccaaaaccacca.
	rule aa-> b at position 11
.aaacbaaaaccbaaccacca.
	rule cba-> aaacca at position 10
.aaacbaaaacaaaccaaccacca.
	rule aa-> b at position 10
.aaacbaaaacbaccaaccacca.
	rule cba-> aaacca at position 9
.aaacbaaaaaaaccaccaaccacca.