Morphocompletion for #5874 ⟨a, b | ababab=baaba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	abbaaba ⇒ baabaab
2.	ababab ⇒ baaba
3.	baabaabbab ⇒ abbabaaba
4.	baabaababbab ⇒ ababbabaaba
5.	abbabaabaabab ⇒ baabaabbbaaba
6.	ababaabbabaaba ⇒ baabaaabaabbab
7.	baabaabbbaabaab ⇒ abbabaababaaba
8.	baabaababaabbab ⇒ abbaaabbabaaba
9.	ababbaaabbabaaba ⇒ baababaabaaabbab
	...

Collecting factors up to length 7, frequency 3:

Considering [length 2 / frequency 0] ab=c.

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = ab
Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(a) = 1; deg(b) = 2

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] cc, [2/1] ac, [2/2] ca, [2/3] ba, [2/4] cb
Length 3:	[3/0] acc, [3/1] ccc, [3/2] baa, [3/3] aac, [3/4] bac
Length 4:	[4/0] bacc, [4/1] baac, [4/2] accc, [4/3] caac, [4/4] cbac
Length 5:	[5/0] cbacc, [5/1] baacc, [5/2] acbac, [5/3] caacc, [5/4] cccca

Considering [length 5 / frequency 1] baacc=d.

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = ab
2. d = baacc
Reduction order:
- Left-to-right recursive path with deg(c) = deg(d) = 0, c < d; deg(a) = 1; deg(b) = 2

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] ca, [2/1] cc, [2/2] ba, [2/3] ac, [2/4] ad
Length 3:	[3/0] baa, [3/1] acc, [3/2] ccc, [3/3] caa, [3/4] aac
Length 4:	[4/0] baac, [4/1] caac, [4/2] acad, [4/3] aacc, [4/4] cdca
Length 5:	[5/0] baaca, [5/1] aacad, [5/2] aacdc, [5/3] baacb, [5/4] cbacc

Considering [length 3 / frequency 0] baa=e.

Auxiliary generators:
1. c = ab
2. d = baacc
3. e = baa
Reduction order:
- Left-to-right recursive path with deg(c) = deg(e) = deg(d) = 0, c < e < d; deg(a) = 1; deg(b) = 2

Rewriting system is complete. See ⟨a, b | ababab=baaba⟩.