Morphocompletion for #1498 ⟨a, b | abaabbaaab=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 7, frequency 4:

Considering [length 5 / frequency 0] baabb=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	aacaaacaca ⇒ acaaaacaac
2.	acaaaacaacaa ⇒ aaaacaacaaac
3.	aaaacaacaaacac ⇒ 1
4.	aaacacaaaacaac ⇒ 1
5.	acaaacacaaac ⇒ aaacaacaaacc
6.	acaaaacaacaaac ⇒ 1
7.	aaacacaaaacaaca ⇒ a
8.	aaaacaacaaacacc ⇒ c
9.	acaaacaacaaacaca ⇒ ac
10.	acaaacaacaaacacaa ⇒ aca
11.	aaacaacaaaccacaaac ⇒ acaaacaaacaacaaacc
12.	cacaaacaacaaacacaa ⇒ caca
13.	acaacaaacaaacaacaaacc ⇒ cacaaac
14.	b ⇒ acaacaaac
	...

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] aa, [2/1] ac, [2/2] ca, [2/3] cc
Length 3:	[3/0] aca, [3/1] aac, [3/2] caa, [3/3] aaa, [3/4] cac, [3/5] acc, [3/6] cca
Length 4:	[4/0] acaa, [4/1] aaca, [4/2] aaac, [4/3] caaa, [4/4] caac, [4/5] caca, [4/6] acac
Length 5:	[5/0] acaaa, [5/1] aacaa, [5/2] aaaca, [5/3] caaac, [5/4] acaac, [5/5] caaca, [5/6] cacaa

Considering [length 3 / frequency 0] aca=d.

Reduction order:
- Right-to-left recursive path with deg(d) = 0; deg(a) = 1; deg(c) = 2; deg(b) = 3
Auxiliary generators:
1. baabb=c
2. aca=d

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