Morphocompletion for #3259 ⟨a, b | ababbabbbba=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

#	Rule
1.	abbbbaa ⇒ bbaabab
2.	bbbbaaba ⇒ ababbabb
3.	abbabbbba ⇒ bbbaababb
4.	aababbabbbb ⇒ 1
5.	ababbabbbababbabbbb ⇒ bbabbbba
	...

Collecting factors up to length 7, frequency 4:

Considering [length 6 / frequency 0] babbbb=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. babbbb=c

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] ca, [2/1] bb, [2/2] ab, [2/3] aa, [2/4] bc, [2/5] ba, [2/6] ac
Length 3:	[3/0] caa, [3/1] bbb, [3/2] bca, [3/3] aab, [3/4] bab, [3/5] abc, [3/6] aac
Length 4:	[4/0] caac, [4/1] bcaa, [4/2] abca, [4/3] babb, [4/4] cabb, [4/5] babc, [4/6] caab
Length 5:	[5/0] cabca, [5/1] bcaac, [5/2] abcaa, [5/3] caaca, [5/4] abbbb, [5/5] cabbb, [5/6] bcabb

Considering [length 4 / frequency 1] bcaa=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. babbbb=c
2. bcaa=d

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