Morphocompletion for #3191 ⟨a, b, c | ba=ab, acca=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ba ⇒ ab
2.	caa ⇒ aac
3.	cca ⇒ acc
4.	ccb ⇒ bcc
5.	aacc ⇒ 1
6.	bcaa ⇒ aabc
7.	aabcc ⇒ b
8.	aabbcc ⇒ bb
9.	aacacc ⇒ ca
10.	aacbcc ⇒ cb
11.	aabbbcc ⇒ bbb
12.	aabcacc ⇒ bca
13.	aabcbcc ⇒ bcb
14.	aacabcc ⇒ cab
15.	aacbbcc ⇒ cbb
16.	aabbbbcc ⇒ bbbb
17.	aabbcacc ⇒ bbca
18.	aabbcbcc ⇒ bbcb
19.	aabcabcc ⇒ bcab
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	32	`lf:16,lp:2,ls:14,rf:2,rs:2,lprs:20,a:2`
[2/1]	aa	32	`lf:16,lp:14,ls:2,rf:2,rp:2,lsrp:11,a:2`
[2/2]	bc	17	`lf:16,lp:1,rf:7,rp:4,rs:1,lprs:1,a:2`
[2/3]	ab	11	`lf:11,rf:4,rp:1,rs:3,re:1`
[2/4]	ca	10	`lf:8,lp:1,ls:1,rf:5,rp:2,rs:3,re:1,a:3`
[2/5]	bb	9	`lf:9,rf:9,rp:5,rs:4,re:1,a:4`
[2/6]	ac	8	`lf:8,rf:2,rp:1,rs:1,a:3`
[3/0]	bcc	20	`lf:10,ls:10,rf:1,rp:1,rs:1,re:1,a:2`
[3/1]	aab	18	`lf:9,lp:9,rf:1,rp:1,a:2`
[3/2]	aac	10	`lf:5,lp:5,rf:1,rp:1,rs:1,re:1,a:27`
[3/3]	acc	8	`lf:4,ls:4,rf:1,rp:1,rs:1,re:1,a:3`
[3/4]	bbc	6	`lf:6,rf:2,rp:2,a:4`
[3/5]	abc	6	`lf:6,rf:1,rs:1,a:2`
[3/6]	bca	5	`lf:4,lp:1,rf:3,rp:2,rs:2,re:1,a:6`

Considering [length 2 / frequency 0] cc=d.

Step 2

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

Rewriting system is complete. See ⟨a, b, c | ba=ab, acca=1⟩.