/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 }, 
it remains to prove termination of the 2-rule system
{ 0 0 0 -> 1 0 1 ,
  1 0 1 -> 0 1 0 }


The system was reversed.

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


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

.aaa.baa
	rule aaa-> bab at position 0
.bab.baa
	rule bab-> aba at position 0
.aba.baa
	rule bab-> aba at position 1
.aaba.aa
	rule aaa-> bab at position 3
.aabbab.
	rule bab-> aba at position 3
.aababa.
	rule bab-> aba at position 2
.aaabaa.