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


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

.aba.abcccb
	rule aba->= aaa at position 0
.aaa.abcccb
	rule aaa-> bcc at position 1
.abcc.bcccb
	rule cbc->= acb at position 3
.abcacb.ccb
	rule cbc->= acb at position 4
.abcaacb.cb
	rule cbc->= acb at position 5
.abcaaacb.b
	rule aaa-> bcc at position 3
.abcbcccb.b
	rule cbc->= acb at position 2
.abacbccb.b
	rule cbc->= acb at position 3
.abaacbcb.b
	rule cbc->= acb at position 4
.abaaacbb.b
	rule bbb-> cab at position 6
.abaaaccab.
	rule cca-> bac at position 5
.abaaabacb.
	rule aba->= aaa at position 4
.abaaaaacb.
	rule aaa-> bcc at position 4
.abaabcccb.