Morphocompletion for #5559 ⟨a, b, c | ab=c, baac=c⟩

Solved by morph:3/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.	baac ⇒ c
3.	caac ⇒ ac
4.	baaac ⇒ ac
5.	caaac ⇒ aac
6.	baaaac ⇒ aac
7.	caaaac ⇒ aaac
8.	baaaaac ⇒ aaac
9.	caaaaac ⇒ aaaac
10.	baaaaaac ⇒ aaaac
11.	caaaaaac ⇒ aaaaac
12.	baaaaaaac ⇒ aaaaac
13.	caaaaaaac ⇒ aaaaaac
14.	baaaaaaaac ⇒ aaaaaac
15.	caaaaaaaac ⇒ aaaaaaac
16.	baaaaaaaaac ⇒ aaaaaaac
17.	caaaaaaaaac ⇒ aaaaaaaac
18.	baaaaaaaaaac ⇒ aaaaaaaac
19.	caaaaaaaaaac ⇒ aaaaaaaaac
20.	baaaaaaaaaaac ⇒ aaaaaaaaac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	100	`lf:100,rf:72,rp:16,a:1`
[2/1]	ac	38	`lf:19,ls:19,rf:18,rp:2,rs:18,re:2,lsrp:2,lsrs:18,a:1`
[2/2]	ba	20	`lf:10,lp:10,a:1`
[2/3]	ca	18	`lf:9,lp:9,a:2`
[3/0]	aaa	81	`lf:81,rf:56,rp:14,a:3`
[3/1]	aac	38	`lf:19,ls:19,rf:16,rp:2,rs:16,re:2,lsrp:2,lsrs:16,a:1`
[3/2]	baa	20	`lf:10,lp:10,a:1`
[3/3]	caa	18	`lf:9,lp:9,a:2`

Considering [length 3 / frequency 1] aac=d.

Step 2

Auxiliary generators:
1. d = aac
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, baac=c⟩.