Morphocompletion for #2287 ⟨a, b | aabbbba=baa⟩

Solved by morph:5/2,4/0,2/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 3:

Considering [length 5 / frequency 2] bbbba=c.

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] cc, [2/1] ca, [2/2] ba, [2/3] ac, [2/4] bc
Length 3:	[3/0] ccc, [3/1] cca, [3/2] bab, [3/3] acc, [3/4] bcb
Length 4:	[4/0] cccc, [4/1] bcba, [4/2] accc, [4/3] baba, [4/4] baca
Length 5:	[5/0] acccc, [5/1] bcbac, [5/2] babac, [5/3] bacca, [5/4] caccc

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

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

Collecting factors up to length 6, frequency 5:

Length 2:	[2/0] da, [2/1] ad, [2/2] aa, [2/3] cd, [2/4] dd
Length 3:	[3/0] ada, [3/1] dad, [3/2] dda, [3/3] aad, [3/4] cdd
Length 4:	[4/0] adad, [4/1] dada, [4/2] aada, [4/3] cddd, [4/4] ddda
Length 5:	[5/0] dadad, [5/1] adada, [5/2] aadad, [5/3] cdddd, [5/4] bcbad

Considering [length 2 / frequency 0] da=e.

Auxiliary generators:
1. c = bbbba
2. d = cccc
3. e = da
Reduction order:
- Right-to-left recursive path with deg(a) = 0; deg(e) = 1; deg(d) = deg(c) = deg(b) = 2, d < c < b

Rewriting system is complete. See ⟨a, b | aabbbba=baa⟩.