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


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

.aaaa.aaaaaaaaa
	rule aaaa-> bbaba at position 0
.bbaba.aaaaaaaaa
	rule aaaa-> bbaba at position 4
.bbabbbaba.aaaaaa
	rule bbb-> aaa at position 3
.bbaaaaaba.aaaaaa
	rule aaaa-> bbaba at position 8
.bbaaaaabbbaba.aaa
	rule bbb-> aaa at position 7
.bbaaaaaaaaaba.aaa
	rule aaaa-> bbaba at position 12
.bbaaaaaaaaabbbaba.
	rule bbb-> aaa at position 11
.bbaaaaaaaaaaaaaba.