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


The system was reversed.

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


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

.ba.a
	rule ba-> abcab at position 0
.abcab.a
	rule a->  at position 3
.abcb.a
	rule ba-> abcab at position 3
.abcabcab.
	rule a->  at position 3
.abcbcab.
	rule b-> a at position 3
.abcacab.
	rule a->  at position 3
.abccab.
	rule cc->  at position 2
.abab.
	rule b-> a at position 3
.abaa.