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


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

.aaa.acbaac
	rule aaa->= aac at position 0
.aac.acbaac
	rule cac-> aab at position 2
.aaaab.baac
	rule abb-> cbc at position 3
.aaacbc.aac
	rule bca-> cbc at position 4
.aaaccbc.ac
	rule bca-> cbc at position 5
.aaacccbc.c
	rule ccc->= aac at position 3
.aaaaacbc.c
	rule aaa->= aac at position 1
.aaacacbc.c
	rule cac-> aab at position 3
.aaaaabbc.c
	rule abb-> cbc at position 4
.aaaacbcc.c
	rule ccc->= aac at position 6
.aaaacbaac.