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

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

.abb.bbbb
	rule abb-> bbcab at position 0
.bbcab.bbbb
	rule abb-> bbcab at position 3
.bbcbbcab.bbb
	rule cb-> ba at position 2
.bbbabcab.bbb
	rule abb-> bbcab at position 6
.bbbabcbbcab.bb
	rule cb-> ba at position 5
.bbbabbabcab.bb
	rule abb-> bbcab at position 9
.bbbabbabcbbcab.b
	rule cb-> ba at position 8
.bbbabbabbabcab.b
	rule abb-> bbcab at position 6
.bbbabbbbcababcab.b
	rule abb-> bbcab at position 14
.bbbabbbbcababcbbcab.
	rule cb-> ba at position 13
.bbbabbbbcababbabcab.
	rule abb-> bbcab at position 11
.bbbabbbbcabbbcababcab.
	rule abb-> bbcab at position 9
.bbbabbbbcbbcabbcababcab.
	rule cb-> ba at position 8
.bbbabbbbbabcabbcababcab.
	rule abb-> bbcab at position 12
.bbbabbbbbabcbbcabcababcab.
	rule cb-> ba at position 11
.bbbabbbbbabbabcabcababcab.
	rule abb-> bbcab at position 9
.bbbabbbbbbbcababcabcababcab.