Morphocompletion for #2199 ⟨a, b, c | aabc=1, acba=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.	cb ⇒ bc
2.	baa ⇒ aab
3.	bca ⇒ abc
4.	caa ⇒ aac
5.	aabc ⇒ 1
6.	baac ⇒ 1
7.	cabc ⇒ bcca
8.	aabbc ⇒ b
9.	bbcca ⇒ abbcc
10.	cabbc ⇒ bccab
11.	aababc ⇒ ba
12.	aabbbc ⇒ bb
13.	cababc ⇒ bccaba
14.	aababbc ⇒ bab
15.	aabbabc ⇒ bba
16.	aabbbbc ⇒ bbb
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	bc	23	`lf:12,lp:1,ls:10,rf:6,rp:4,rs:2,re:1,lsrp:3,lprs:10`
[2/1]	aa	19	`lf:10,lp:7,ls:2,rf:2,rp:2,lsrp:20`
[2/2]	ab	14	`lf:14,rf:6,rp:2,rs:3`
[2/3]	ca	12	`lf:6,lp:4,ls:2,rf:3,rs:1,lprs:1,a:7`
[2/4]	bb	11	`lf:10,lp:1,rf:5,rp:3,rs:2,re:1,a:6`
[2/5]	ba	8	`lf:6,lp:2,rf:4,rp:2,rs:3,re:1,a:12`
[2/6]	ac	2	`lf:1,ls:1,rf:1,rs:1,a:16`
[3/0]	aab	14	`lf:7,lp:7,rf:1,rp:1,rs:1,re:1`
[3/1]	bbc	12	`lf:6,lp:1,ls:5,rf:1,a:6`
[3/2]	abc	10	`lf:5,ls:5,rf:1,rp:1,rs:1,re:1`
[3/3]	cab	6	`lf:3,lp:3,rf:2,rs:1,lprs:1,a:9`
[3/4]	abb	6	`lf:6,rf:1,rp:1,a:6`
[3/5]	bab	4	`lf:4,rf:1,rp:1,rs:1,re:1,a:12`
[3/6]	bbb	3	`lf:3,rf:1,rp:1,rs:1,re:1,a:11`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aabc=1, acba=1⟩.