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


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


NO

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

The system was reversed.

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

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

.cbaa.aaaaaa
	rule cbaa-> aaacca at position 0
.aaacca.aaaaaa
	rule a-> b at position 5
.aaaccb.aaaaaa
	rule cbaa-> aaacca at position 4
.aaacaaacca.aaaa
	rule a-> b at position 4
.aaacbaacca.aaaa
	rule a-> b at position 9
.aaacbaaccb.aaaa
	rule cbaa-> aaacca at position 8
.aaacbaacaaacca.aa
	rule a-> b at position 8
.aaacbaacbaacca.aa
	rule cbaa-> aaacca at position 7
.aaacbaaaaaccacca.aa
	rule a-> b at position 12
.aaacbaaaaaccbcca.aa
	rule a-> b at position 15
.aaacbaaaaaccbccb.aa
	rule cbaa-> aaacca at position 14
.aaacbaaaaaccbcaaacca.
	rule a-> b at position 14
.aaacbaaaaaccbcbaacca.
	rule cbaa-> aaacca at position 13
.aaacbaaaaaccbaaaccacca.
	rule cbaa-> aaacca at position 11
.aaacbaaaaacaaaccaaccacca.
	rule a-> b at position 11
.aaacbaaaaacbaaccaaccacca.
	rule cbaa-> aaacca at position 10
.aaacbaaaaaaaaccaccaaccacca.