Morphocompletion for #358 ⟨a, b, c | aba=b, acb=1⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = deg(c) = 1, a < c

Rewriting system is not complete: roundsLimit

#	Rule
1.	bba ⇒ abb
2.	cbb ⇒ ba
3.	bcb ⇒ ab
4.	aba ⇒ b
5.	acb ⇒ 1
6.	cabb ⇒ baa
7.	cba ⇒ 1
8.	bcab ⇒ aab
9.	acab ⇒ cb
10.	caabb ⇒ baaa
11.	bcaab ⇒ aaab
12.	acaab ⇒ cab
13.	caaabb ⇒ baaaa
14.	bcaaab ⇒ aaaab
15.	acaaab ⇒ caab
16.	caaaabb ⇒ baaaaa
17.	bcaaaab ⇒ aaaaab
18.	acaaaab ⇒ caaab
19.	acaaaaab ⇒ caaaab
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ab	24	`lf:14,lp:1,ls:9,rf:10,rp:2,rs:9,re:1,lsrs:8`
[2/1]	aa	22	`lf:22,rf:26,rp:4,rs:4,a:5`
[2/2]	ca	17	`lf:13,lp:4,rf:4,rp:4,a:4`
[2/3]	ac	12	`lf:6,lp:6,a:1`
[2/4]	bb	12	`lf:6,lp:1,ls:5,rf:1,rs:1,lprs:10,a:2`
[2/5]	bc	10	`lf:5,lp:5,a:3`
[2/6]	cb	8	`lf:4,lp:2,ls:2,rf:1,rp:1,rs:1,re:1,a:1`
[3/0]	aab	17	`lf:10,ls:7,rf:7,rp:1,rs:7,re:1,lsrs:6,a:5`
[3/1]	caa	13	`lf:10,lp:3,rf:3,rp:3,a:14`
[3/2]	aaa	12	`lf:12,rf:15,rp:3,rs:3,a:15`
[3/3]	aca	10	`lf:5,lp:5,a:4`
[3/4]	bca	8	`lf:4,lp:4,a:5`
[3/5]	abb	8	`lf:4,ls:4,rf:1,rp:1,rs:1,re:1,a:2`
[3/6]	cab	6	`lf:3,lp:1,ls:2,rf:1,rp:1,rs:1,re:1,a:4`

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

Step 2

Auxiliary generators:
1. d = ab
Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(d) = deg(a) = deg(c) = 1, d < a < c

Rewriting system is complete. See ⟨a, b, c | aba=b, acb=1⟩.