/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 0 0 0 ,
  1 1 -> 0 0 1 }


The system was reversed.

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


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

.bb.aaabaaab
	rule bb-> baa at position 0
.baa.aaabaaab
	rule aaaa-> aaab at position 2
.baaaab.baaab
	rule aaaa-> aaab at position 1
.baaabb.baaab
	rule bb-> baa at position 5
.baaabbaa.aaab
	rule aaaa-> aaab at position 7
.baaabbaaaab.b
	rule aaaa-> aaab at position 6
.baaabbaaabb.b
	rule bb-> baa at position 10
.baaabbaaabbaa.
	rule bb-> baa at position 9
.baaabbaaabaaaa.
	rule aaaa-> aaab at position 10
.baaabbaaabaaab.