Morphocompletion for #5378 ⟨a, b | ababbba=bbab⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: arenaTotalLimit

#	Rule
1.	ababbba ⇒ bbab
2.	ababbbbbab ⇒ bbabbabbba
3.	bbabbabbbaabbba ⇒ ababbbbbbbab
4.	ababababbbbbbbab ⇒ bbabbbabbbaabbba
5.	ababbbbbbbabbabbba ⇒ bbabbabbbaabbbbbab
6.	bbabbbabbbaabbbaabbba ⇒ ababababbbbbbbbbab
7.	ababababababbbbbbbbbab ⇒ bbabbbbabbbaabbbaabbba
8.	bbabbabbbababbabbbaabbba ⇒ ababbbbbaababbbbbbbab
	...

Collecting factors up to length 8, frequency 7:

Length 2:	[2/0] bb, [2/1] ab, [2/2] ba, [2/3] aa
Length 3:	[3/0] bbb, [3/1] bba, [3/2] bab, [3/3] abb, [3/4] aba, [3/5] aab, [3/6] baa
Length 4:	[4/0] bbba, [4/1] bbab, [4/2] abab, [4/3] bbbb, [4/4] abbb, [4/5] babb, [4/6] baba
Length 5:	[5/0] abbba, [5/1] bbbbb, [5/2] bbabb, [5/3] babbb, [5/4] bbbab, [5/5] ababb, [5/6] ababa
Length 6:	[6/0] babbba, [6/1] bbbbbb, [6/2] ababbb, [6/3] ababab, [6/4] bbabbb, [6/5] bbbbab, [6/6] aabbba
Length 7:	[7/0] bbabbba, [7/1] bbbbbab, [7/2] baabbba, [7/3] ababbbb, [7/4] abababa, [7/5] bbbbbbb, [7/6] bbabbab

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

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

Rewriting system is complete. See ⟨a, b | ababbba=bbab⟩.