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

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

.abab.babbabbab
	rule abab-> cbca at position 0
.cbca.babbabbab
	rule c-> ba at position 2
.cbbaa.babbabbab
	rule abab-> cbca at position 4
.cbbacbca.babbab
	rule c-> ba at position 4
.cbbababca.babbab
	rule abab-> cbca at position 3
.cbbcbcaca.babbab
	rule c-> ba at position 5
.cbbcbbaaca.babbab
	rule c-> ba at position 8
.cbbcbbaabaa.babbab
	rule abab-> cbca at position 10
.cbbcbbaabacbca.bab
	rule c-> ba at position 10
.cbbcbbaabababca.bab
	rule abab-> cbca at position 7
.cbbcbbacbcaabca.bab
	rule c-> ba at position 7
.cbbcbbababcaabca.bab
	rule abab-> cbca at position 6
.cbbcbbcbcacaabca.bab
	rule c-> ba at position 8
.cbbcbbcbbaacaabca.bab
	rule c-> ba at position 11
.cbbcbbcbbaabaaabca.bab
	rule a->  at position 12
.cbbcbbcbbaabaabca.bab
	rule a->  at position 12
.cbbcbbcbbaababca.bab
	rule abab-> cbca at position 10
.cbbcbbcbbacbcaca.bab
	rule c-> ba at position 10
.cbbcbbcbbababcaca.bab
	rule c-> ba at position 13
.cbbcbbcbbababbaaca.bab
	rule a->  at position 14
.cbbcbbcbbababbaca.bab
	rule c-> ba at position 15
.cbbcbbcbbababbabaa.bab
	rule abab-> cbca at position 17
.cbbcbbcbbababbabacbca.
	rule c-> ba at position 17
.cbbcbbcbbababbabababca.
	rule abab-> cbca at position 16
.cbbcbbcbbababbabcbcaca.
	rule c-> ba at position 16
.cbbcbbcbbababbabbabcaca.
	rule c-> ba at position 19
.cbbcbbcbbababbabbabbaaca.
	rule a->  at position 20
.cbbcbbcbbababbabbabbaca.
	rule c-> ba at position 21
.cbbcbbcbbababbabbabbabaa.