/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

After renaming modulo { b->0, a->1 }, 
it remains to prove termination of the 2-rule system
{ 0 1 0 1 1 0 -> 0 0 1 0 1 0 ,
  0 1 0 0 -> 0 0 1 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 1 1 0 1 0 -> 0 1 0 1 0 0 ,
  0 0 1 0 -> 0 1 0 1 1 0 0 }


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

.aaba.bababa
	rule aaba-> ababbaa at position 0
.ababbaa.bababa
	rule aaba-> ababbaa at position 5
.ababbababbaa.baba
	rule abbaba-> ababaa at position 2
.abababaabbaa.baba
	rule aaba-> ababbaa at position 10
.abababaabbababbaa.ba
	rule abbaba-> ababaa at position 7
.abababaababaabbaa.ba
	rule aaba-> ababbaa at position 15
.abababaababaabbababbaa.
	rule abbaba-> ababaa at position 12
.abababaababaababaabbaa.
	rule aaba-> ababbaa at position 11
.abababaababababbaabaabbaa.
	rule aaba-> ababbaa at position 16
.abababaababababbababbaaabbaa.
	rule abbaba-> ababaa at position 13
.abababaabababababaabbaaabbaa.