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


The system was reversed.

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


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

.aabb.bb
	rule aabb-> bbbbbaaaaa at position 0
.bbbbbaaaaa.bb
	rule aabb-> bbbbbaaaaa at position 8
.bbbbbaaabbbbbaaaaa.