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


The system was reversed.

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


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

.cab.abab
	rule cab-> abacc at position 0
.abacc.abab
	rule cab-> abacc at position 4
.abacabacc.ab
	rule a->  at position 6
.abacabcc.ab
	rule cab-> abacc at position 7
.abacabcabacc.
	rule cab-> abacc at position 6
.abacababaccacc.
	rule c->  at position 9
.abacababacacc.
	rule c->  at position 9
.abacababaacc.
	rule a-> b at position 9
.abacabababcc.