/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 ⟶ 1 1 1 0 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 0 1 1 1 }

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

.baaa.aaaaaaaaa
	rule baaa-> aaaabbb at position 0
.aaaabbb.aaaaaaaaa
	rule baaa-> aaaabbb at position 6
.aaaabbaaaabbb.aaaaaa
	rule baaa-> aaaabbb at position 12
.aaaabbaaaabbaaaabbb.aaa
	rule baaa-> aaaabbb at position 11
.aaaabbaaaabaaaabbbabbb.aaa
	rule baaa-> aaaabbb at position 10
.aaaabbaaaaaaaabbbabbbabbb.aaa
	rule baaa-> aaaabbb at position 24
.aaaabbaaaaaaaabbbabbbabbaaaabbb.
	rule baaa-> aaaabbb at position 23
.aaaabbaaaaaaaabbbabbbabaaaabbbabbb.
	rule baaa-> aaaabbb at position 22
.aaaabbaaaaaaaabbbabbbaaaaabbbabbbabbb.
	rule baaa-> aaaabbb at position 20
.aaaabbaaaaaaaabbbabbaaaabbbaabbbabbbabbb.
	rule baaa-> aaaabbb at position 19
.aaaabbaaaaaaaabbbabaaaabbbabbbaabbbabbbabbb.
	rule baaa-> aaaabbb at position 18
.aaaabbaaaaaaaabbbaaaaabbbabbbabbbaabbbabbbabbb.
	rule baaa-> aaaabbb at position 16
.aaaabbaaaaaaaabbaaaabbbaabbbabbbabbbaabbbabbbabbb.
	rule baaa-> aaaabbb at position 15
.aaaabbaaaaaaaabaaaabbbabbbaabbbabbbabbbaabbbabbbabbb.
	rule baaa-> aaaabbb at position 14
.aaaabbaaaaaaaaaaaabbbabbbabbbaabbbabbbabbbaabbbabbbabbb.