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


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


NO

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


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

.aaaa.bbaabbbba
	rule aaaa-> bbba at position 0
.bbba.bbaabbbba
	rule babb-> abba at position 2
.bbabba.aabbbba
	rule babb-> abba at position 1
.babbaa.aabbbba
	rule babb-> abba at position 0
.abbaaa.aabbbba
	rule aaaa-> bbba at position 4
.abbabbba.bbbba
	rule babb-> abba at position 2
.ababbaba.bbbba
	rule babb-> abba at position 1
.aabbaaba.bbbba
	rule babb-> abba at position 6
.aabbaaabba.bba
	rule babb-> abba at position 8
.aabbaaababba.a
	rule babb-> abba at position 7
.aabbaaaabbaa.a
	rule aaaa-> bbba at position 4
.aabbbbbabbaa.a
	rule babb-> abba at position 6
.aabbbbabbaaa.a
	rule babb-> abba at position 5
.aabbbabbaaaa.a
	rule babb-> abba at position 4
.aabbabbaaaaa.a
	rule babb-> abba at position 3
.aababbaaaaaa.a
	rule babb-> abba at position 2
.aaabbaaaaaaa.a
	rule aaaa-> bbba at position 6
.aaabbabbbaaa.a
	rule babb-> abba at position 4
.aaababbabaaa.a
	rule babb-> abba at position 3
.aaaabbaabaaa.a
	rule aaaa-> bbba at position 9
.aaaabbaabbbba.