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


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 -> }


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

.abb.bbbbbb
	rule abb-> bbbaca at position 0
.bbbaca.bbbbbb
	rule abb-> bbbaca at position 5
.bbbacbbbaca.bbbb
	rule cb->  at position 4
.bbbabbaca.bbbb
	rule abb-> bbbaca at position 8
.bbbabbacbbbaca.bb
	rule cb->  at position 7
.bbbabbabbaca.bb
	rule abb-> bbbaca at position 6
.bbbabbbbbacaaca.bb
	rule abb-> bbbaca at position 14
.bbbabbbbbacaacbbbaca.
	rule cb->  at position 13
.bbbabbbbbacaabbaca.
	rule abb-> bbbaca at position 12
.bbbabbbbbacabbbacaaca.
	rule abb-> bbbaca at position 11
.bbbabbbbbacbbbacabacaaca.
	rule cb->  at position 10
.bbbabbbbbabbacabacaaca.
	rule abb-> bbbaca at position 9
.bbbabbbbbbbbacaacabacaaca.