Morphocompletion for #5587 ⟨a, b, c | ab=c, bcac=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) = deg(c) = 0, b < c; deg(a) = 1

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	bcac ⇒ c
3.	ccac ⇒ ac
4.	bcaac ⇒ ac
5.	ccaac ⇒ aac
6.	bcaaac ⇒ aac
7.	ccaaac ⇒ aaac
8.	bcaaaac ⇒ aaac
9.	ccaaaac ⇒ aaaac
10.	bcaaaaac ⇒ aaaac
11.	ccaaaaac ⇒ aaaaac
12.	bcaaaaaac ⇒ aaaaac
13.	ccaaaaaac ⇒ aaaaaac
14.	bcaaaaaaac ⇒ aaaaaac
15.	ccaaaaaaac ⇒ aaaaaaac
16.	bcaaaaaaaac ⇒ aaaaaaac
17.	ccaaaaaaaac ⇒ aaaaaaaac
18.	bcaaaaaaaaac ⇒ aaaaaaaac
19.	ccaaaaaaaaac ⇒ aaaaaaaaac
20.	bcaaaaaaaaaac ⇒ 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]	bc	20	`lf:10,lp:10,a:1`
[2/3]	ca	19	`lf:19,a:1`
[2/4]	cc	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]	bca	20	`lf:10,lp:10,a:1`
[3/3]	cca	18	`lf:9,lp:9,a:2`
[3/4]	caa	17	`lf:17,a:3`
[3/5]	cac	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(c) = deg(d) = 0, b < c < d; deg(a) = 1

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