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


The system was reversed.

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


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

.aab.abbbb
	rule aab-> baa at position 0
.baa.abbbb
	rule aab-> baa at position 2
.babaa.bbb
	rule abb-> bcc at position 4
.bababcc.b
	rule ccb-> bcc at position 5
.bababbcc.
	rule bbc->= bbb at position 4
.bababbbc.
	rule bab->= cab at position 2
.bacabbbc.
	rule bac-> aab at position 0
.aababbbc.
	rule bbc->= bbb at position 5
.aababbbb.