Morphocompletion for #5575 ⟨a, b, c | ab=c, bbac=c⟩

Solved by morph:2/1. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	bbac ⇒ c
3.	cbac ⇒ ac
4.	bbaac ⇒ ac
5.	cbaac ⇒ aac
6.	bbaaac ⇒ aac
7.	cbaaac ⇒ aaac
8.	bbaaaac ⇒ aaac
9.	cbaaaac ⇒ aaaac
10.	bbaaaaac ⇒ aaaac
11.	cbaaaaac ⇒ aaaaac
12.	bbaaaaaac ⇒ aaaaac
13.	cbaaaaaac ⇒ aaaaaac
14.	bbaaaaaaac ⇒ aaaaaac
15.	cbaaaaaaac ⇒ aaaaaaac
16.	bbaaaaaaaac ⇒ aaaaaaac
17.	cbaaaaaaaac ⇒ aaaaaaaac
18.	bbaaaaaaaaac ⇒ aaaaaaaac
19.	cbaaaaaaaaac ⇒ aaaaaaaaac
20.	bbaaaaaaaaaac ⇒ aaaaaaaaac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	81	`lf:81,rf:72,rp:16,a:3`
[2/1]	ac	38	`lf:19,ls:19,rf:18,rp:2,rs:18,re:2,lsrp:2,lsrs:18,a:1`
[2/2]	bb	20	`lf:10,lp:10,a:1`
[2/3]	ba	19	`lf:19,a:1`
[2/4]	cb	18	`lf:9,lp:9,a:2`
[3/0]	aaa	64	`lf:64,rf:56,rp:14,a:5`
[3/1]	aac	34	`lf:17,ls:17,rf:16,rp:2,rs:16,re:2,lsrp:2,lsrs:16,a:3`
[3/2]	bba	20	`lf:10,lp:10,a:1`
[3/3]	cba	18	`lf:9,lp:9,a:2`
[3/4]	baa	17	`lf:17,a:3`
[3/5]	bac	4	`lf:2,ls:2,a:1`

Considering [length 2 / frequency 1] ac=d.

Step 2

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

Rewriting system is complete. See ⟨a, b, c | ab=c, bbac=c⟩.