Morphocompletion for #5920 ⟨a, b, c | ab=a, cab=bc⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right shortlex with a < c < b

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ a
2.	bc ⇒ ca
3.	aca ⇒ ac
4.	acb ⇒ ac
5.	acca ⇒ acc
6.	accb ⇒ acc
7.	accca ⇒ accc
8.	acccb ⇒ accc
9.	acccca ⇒ acccc
10.	accccb ⇒ acccc
11.	accccca ⇒ accccc
12.	acccccb ⇒ accccc
13.	acccccca ⇒ acccccc
14.	accccccb ⇒ acccccc
15.	accccccca ⇒ accccccc
16.	acccccccb ⇒ accccccc
17.	acccccccca ⇒ acccccccc
18.	accccccccb ⇒ acccccccc
19.	accccccccca ⇒ accccccccc
20.	acccccccccb ⇒ accccccccc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	72	`lf:72,rf:72,rs:16,a:4`
[2/1]	ac	36	`lf:18,lp:18,rf:18,rp:18,rs:2,re:2,lprp:18,lprs:2,a:2`
[2/2]	cb	18	`lf:9,ls:9,a:3`
[2/3]	ca	18	`lf:9,ls:9,rf:1,rp:1,rs:1,re:1,a:1`
[3/0]	ccc	56	`lf:56,rf:56,rs:14,a:6`
[3/1]	acc	32	`lf:16,lp:16,rf:16,rp:16,rs:2,re:2,lprp:16,lprs:2,a:4`
[3/2]	ccb	16	`lf:8,ls:8,a:5`
[3/3]	cca	16	`lf:8,ls:8,a:4`

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

Step 2

Auxiliary generators:
1. d = ac
Reduction order:
- Left-to-right shortlex with a < d < c < b

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