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

The system was reversed.

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

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

.a.bbbbaab
	rule a-> bcc at position 0
.bcc.bbbbaab
	rule cbb-> baa at position 2
.bcbaa.bbaab
	rule a-> bcc at position 4
.bcbabcc.bbaab
	rule cbb-> baa at position 6
.bcbabcbaa.aab
	rule a-> bcc at position 7
.bcbabcbbcca.aab
	rule cbb-> baa at position 5
.bcbabbaacca.aab
	rule a-> bcc at position 6
.bcbabbbccacca.aab
	rule a-> bcc at position 9
.bcbabbbccbcccca.aab
	rule a-> bcc at position 14
.bcbabbbccbccccbcc.aab
	rule ca->  at position 16
.bcbabbbccbccccbc.ab
	rule ca->  at position 15
.bcbabbbccbccccb.b
	rule cbb-> baa at position 13
.bcbabbbccbcccbaa.
	rule a-> bcc at position 14
.bcbabbbccbcccbbcca.
	rule cbb-> baa at position 12
.bcbabbbccbccbaacca.
	rule a-> bcc at position 13
.bcbabbbccbccbbccacca.
	rule cbb-> baa at position 11
.bcbabbbccbcbaaccacca.
	rule a-> bcc at position 12
.bcbabbbccbcbbccaccacca.
	rule cbb-> baa at position 10
.bcbabbbccbbaaccaccacca.
	rule cbb-> baa at position 8
.bcbabbbcbaaaaccaccacca.
	rule a-> bcc at position 9
.bcbabbbcbbccaaaccaccacca.
	rule cbb-> baa at position 7
.bcbabbbbaaccaaaccaccacca.
	rule ca->  at position 11
.bcbabbbbaacaaccaccacca.
	rule ca->  at position 10
.bcbabbbbaaaccaccacca.
	rule a-> bcc at position 10
.bcbabbbbaabccccaccacca.