/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 3-rule system
{ 0 ⟶ ,
  0 0 1 ⟶ 1 0 1 0 ,
  1 1 1 ⟶ 0 }

The system was reversed.

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

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

.baa.aaaabbaa
	rule baa-> abab at position 0
.abab.aaaabbaa
	rule baa-> abab at position 3
.abaabab.aabbaa
	rule baa-> abab at position 6
.abaabaabab.bbaa
	rule baa-> abab at position 4
.abaaababbab.bbaa
	rule bbb-> a at position 10
.abaaababbaa.aa
	rule baa-> abab at position 8
.abaaabababab.aa
	rule baa-> abab at position 11
.abaaabababaabab.
	rule baa-> abab at position 9
.abaaababaababbab.
	rule baa-> abab at position 7
.abaaabaababbabbab.
	rule baa-> abab at position 5
.abaaaababbabbabbab.
	rule a->  at position 7
.abaaaabbbabbabbab.
	rule bbb-> a at position 6
.abaaaaaabbabbab.
	rule a->  at position 13
.abaaaaaabbabbb.
	rule bbb-> a at position 11
.abaaaaaabbaa.