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


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


NO

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

The system was reversed.

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

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

.ab.bbbb
	rule ab-> bbc at position 0
.bbc.bbbb
	rule cb-> bac at position 2
.bbbac.bbb
	rule cb-> bac at position 4
.bbbabac.bb
	rule cb-> bac at position 6
.bbbababac.b
	rule ab-> bbc at position 5
.bbbabbbcac.b
	rule cb-> bac at position 9
.bbbabbbcabac.
	rule ab-> bbc at position 8
.bbbabbbcbbcac.
	rule cb-> bac at position 7
.bbbabbbbacbcac.
	rule cb-> bac at position 9
.bbbabbbbabaccac.
	rule ab-> bbc at position 8
.bbbabbbbbbcaccac.