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


The system was reversed.

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


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

.abb.bbbb
	rule abb-> bbbaca at position 0
.bbbaca.bbbb
	rule abb-> bbbaca at position 5
.bbbacbbbaca.bb
	rule cb-> a at position 4
.bbbaabbaca.bb
	rule abb-> bbbaca at position 4
.bbbabbbacaaca.bb
	rule abb-> bbbaca at position 12
.bbbabbbacaacbbbaca.
	rule cb-> a at position 11
.bbbabbbacaaabbaca.
	rule abb-> bbbaca at position 11
.bbbabbbacaabbbacaaca.
	rule abb-> bbbaca at position 10
.bbbabbbacabbbacabacaaca.
	rule abb-> bbbaca at position 9
.bbbabbbacbbbacabacabacaaca.
	rule cb-> a at position 8
.bbbabbbaabbacabacabacaaca.
	rule abb-> bbbaca at position 8
.bbbabbbabbbacaacabacabacaaca.
	rule abb-> bbbaca at position 7
.bbbabbbbbbacabacaacabacabacaaca.