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

Rewriting system is not complete: roundsLimit

#	Rule
1.	ab ⇒ c
2.	bac ⇒ c
3.	cac ⇒ ac
4.	baac ⇒ ac
5.	caac ⇒ aac
6.	baaac ⇒ aac
7.	caaac ⇒ aaac
8.	baaaac ⇒ aaac
9.	caaaac ⇒ aaaac
10.	baaaaac ⇒ aaaac
11.	caaaaac ⇒ aaaaac
12.	baaaaaac ⇒ aaaaac
13.	caaaaaac ⇒ aaaaaac
14.	baaaaaaac ⇒ aaaaaac
15.	caaaaaaac ⇒ aaaaaaac
16.	baaaaaaaac ⇒ aaaaaaac
17.	caaaaaaaac ⇒ aaaaaaaac
18.	baaaaaaaaac ⇒ aaaaaaaac
19.	caaaaaaaaac ⇒ aaaaaaaaac
20.	baaaaaaaaaac ⇒ 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]	ba	20	`lf:10,lp:10,a:1`
[2/3]	ca	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]	baa	18	`lf:9,lp:9,a:3`
[3/3]	caa	16	`lf:8,lp:8,a:4`

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(d) = 0, b < d; deg(c) = deg(a) = 1, c < a

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