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

The system was reversed.

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

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

.baaa.aaaaaa
	rule baaa-> aaabbba at position 0
.aaabbba.aaaaaa
	rule baaa-> aaabbba at position 5
.aaabbaaabbba.aaaa
	rule baaa-> aaabbba at position 10
.aaabbaaabbaaabbba.aa
	rule baaa-> aaabbba at position 9
.aaabbaaabaaabbbabbba.aa
	rule baaa-> aaabbba at position 8
.aaabbaaaaaabbbabbbabbba.aa
	rule baaa-> aaabbba at position 21
.aaabbaaaaaabbbabbbabbaaabbba.
	rule baaa-> aaabbba at position 20
.aaabbaaaaaabbbabbbabaaabbbabbba.
	rule baaa-> aaabbba at position 19
.aaabbaaaaaabbbabbbaaaabbbabbbabbba.
	rule baaa-> aaabbba at position 17
.aaabbaaaaaabbbabbaaabbbaabbbabbbabbba.
	rule baaa-> aaabbba at position 16
.aaabbaaaaaabbbabaaabbbabbbaabbbabbbabbba.
	rule baaa-> aaabbba at position 15
.aaabbaaaaaabbbaaaabbbabbbabbbaabbbabbbabbba.
	rule baaa-> aaabbba at position 13
.aaabbaaaaaabbaaabbbaabbbabbbabbbaabbbabbbabbba.
	rule baaa-> aaabbba at position 12
.aaabbaaaaaabaaabbbabbbaabbbabbbabbbaabbbabbbabbba.
	rule baaa-> aaabbba at position 11
.aaabbaaaaaaaaabbbabbbabbbaabbbabbbabbbaabbbabbbabbba.