Morphocompletion for #3473 ⟨a, b, c | ba=ac, cab=b⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Right-to-left recursive path with deg(c) = 0; deg(b) = 1; deg(a) = 2

Rewriting system is not complete: roundsLimit

#	Rule
1.	ac ⇒ ba
2.	cab ⇒ b
3.	caab ⇒ ab
4.	baab ⇒ ab
5.	caaab ⇒ aab
6.	baaab ⇒ aab
7.	caaaab ⇒ aaab
8.	baaaab ⇒ aaab
9.	caaaaab ⇒ aaaab
10.	baaaaab ⇒ aaaab
11.	caaaaaab ⇒ aaaaab
12.	baaaaaab ⇒ aaaaab
13.	caaaaaaab ⇒ aaaaaab
14.	baaaaaaab ⇒ aaaaaab
15.	caaaaaaaab ⇒ aaaaaaab
16.	baaaaaaaab ⇒ aaaaaaab
17.	caaaaaaaaab ⇒ aaaaaaaab
18.	baaaaaaaaab ⇒ aaaaaaaab
19.	caaaaaaaaaab ⇒ aaaaaaaaab
20.	baaaaaaaaaab ⇒ aaaaaaaaab
	...

Collecting factors up to length 4 / frequency 7:

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

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

Step 2

Auxiliary generators:
1. d = aab
Reduction order:
- Right-to-left recursive path with deg(c) = deg(d) = 0, c < d; deg(b) = 1; deg(a) = 2

Rewriting system is complete. See ⟨a, b, c | ba=ac, cab=b⟩.