/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

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


The system was reversed.

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


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

.cb.bbb
	rule cb-> aaacc at position 0
.aaacc.bbb
	rule cb-> aaacc at position 4
.aaacaaacc.bb
	rule aaa-> ba at position 4
.aaacbacc.bb
	rule cb-> aaacc at position 7
.aaacbacaaacc.b
	rule aaa-> ba at position 7
.aaacbacbacc.b
	rule cb-> aaacc at position 6
.aaacbaaaaccacc.b
	rule aaa-> ba at position 5
.aaacbbaaccacc.b
	rule cb-> aaacc at position 12
.aaacbbaaccacaaacc.
	rule aaa-> ba at position 12
.aaacbbaaccacbacc.
	rule cb-> aaacc at position 11
.aaacbbaaccaaaaccacc.
	rule aaa-> ba at position 10
.aaacbbaaccbaaccacc.
	rule cb-> aaacc at position 9
.aaacbbaacaaaccaaccacc.
	rule aaa-> ba at position 9
.aaacbbaacbaccaaccacc.
	rule cb-> aaacc at position 8
.aaacbbaaaaaccaccaaccacc.
	rule aaa-> ba at position 6
.aaacbbbaaaccaccaaccacc.
	rule aaa-> ba at position 7
.aaacbbbbaccaccaaccacc.