Morphocompletion for #2991 ⟨a, b | aaabbbabbba=1⟩

Solved by morph:3/0,4/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	bbbaaa ⇒ aaabbb
2.	aaaabbbabbb ⇒ 1
3.	bbbabbba ⇒ abbbabbb
4.	aaabbbaabbbabbb ⇒ bbba
5.	aaabbbaaabbbabbb ⇒ bbbaa
6.	abbbabbbbbba ⇒ bbbaabbbabbb
7.	abbbabbbbbbbbba ⇒ bbbbbbaabbbabbb
8.	abbbabbbbbbbbbbbba ⇒ bbbbbbbbbaabbbabbb
9.	abbbabbbbbbbbbbbbbbba ⇒ bbbbbbbbbbbbaabbbabbb
10.	abbbabbbbbbbbbbbbbbbbbba ⇒ bbbbbbbbbbbbbbbaabbbabbb
11.	abbbabbbbbbbbbbbbbbbbbbbbba ⇒ bbbbbbbbbbbbbbbbbbaabbbabbb
12.	abbbabbbbbbbbbbbbbbbbbbbbbbbba ⇒ bbbbbbbbbbbbbbbbbbbbbaabbbabbb
	...

Collecting factors up to length 7, frequency 4:

Considering [length 3 / frequency 0] bbb=c.

Checking up to 20 rules for overlaps.

Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(c) = deg(b) = 1, c < b
Auxiliary generators:
1. bbb=c

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] aa, [2/1] ac, [2/2] ca, [2/3] cc, [2/4] bc, [2/5] bb, [2/6] ab
Length 3:	[3/0] aaa, [3/1] aca, [3/2] cac, [3/3] aac, [3/4] cca, [3/5] ccc, [3/6] caa
Length 4:	[4/0] acac, [4/1] aaac, [4/2] aaca, [4/3] ccca, [4/4] aaaa, [4/5] cacc, [4/6] cccc
Length 5:	[5/0] aaaca, [5/1] acacc, [5/2] aacac, [5/3] aaaac, [5/4] cccca, [5/5] caccc, [5/6] acabc

Considering [length 4 / frequency 0] acac=d.

Reduction order:
- Right-to-left recursive path with deg(a) = deg(d) = 0, a < d; deg(c) = deg(b) = 1, c < b
Auxiliary generators:
1. bbb=c
2. acac=d

Rewriting system is complete. See ⟨a, b | aaabbbabbba=1⟩.