/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 -> 0 1 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.aba
	rule aaa-> abb at position 0
.abb.aba
	rule bab-> aba at position 2
.ababa.a
	rule bab-> aba at position 1
.aabaa.a
	rule aaa-> abb at position 3
.aababb.
	rule bab-> aba at position 2
.aaabab.
	rule bab-> aba at position 3
.aaaaba.