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


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


NO

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


The system was reversed.

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


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

.a.acacac
	rule a-> cbb at position 0
.cbb.acacac
	rule bac-> aca at position 2
.cbaca.acac
	rule bac-> aca at position 1
.cacaa.acac
	rule a-> cbb at position 3
.caccbba.acac
	rule a-> b at position 6
.caccbbb.acac
	rule bac-> aca at position 6
.caccbbaca.ac
	rule bac-> aca at position 5
.caccbacaa.ac
	rule bac-> aca at position 4
.caccacaaa.ac
	rule a-> cbb at position 8
.caccacaacbb.ac
	rule bac-> aca at position 10
.caccacaacbaca.
	rule bac-> aca at position 9
.caccacaacacaa.
	rule a-> cbb at position 12
.caccacaacacacbb.