Morphocompletion for #1714 ⟨a, b, c | aab=bc, cba=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) = 1; deg(c) = 2

Rewriting system is not complete: roundsLimit

#	Rule
1.	babba ⇒ aabbb
2.	aabba ⇒ b
3.	aabaabbb ⇒ bbba
4.	cbb ⇒ abba
5.	cba ⇒ 1
6.	caabbb ⇒ bba
7.	bc ⇒ aab
8.	acb ⇒ 1
9.	acaab ⇒ c
10.	acaabb ⇒ cb
11.	bac ⇒ acb
12.	baacaa ⇒ ac
13.	bbaac ⇒ caabb
14.	cc ⇒ acaaaab
15.	cac ⇒ acaa
16.	cacb ⇒ c
17.	cacaab ⇒ cc
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	ac	15	`lf:9,lp:3,ls:3,rf:4,rp:4,rs:1,re:1,lsrp:11,a:9`
[2/1]	ba	14	`lf:8,lp:3,ls:3,rf:3,rs:3,a:1`
[2/2]	bb	14	`lf:9,lp:1,ls:4,rf:7,rp:2,rs:2,lsrp:2,lprs:1,a:2`
[2/3]	aa	13	`lf:10,lp:2,ls:1,rf:7,rp:2,rs:1`
[2/4]	ca	12	`lf:8,lp:4,rf:3,rp:1,a:9`
[2/5]	ab	10	`lf:8,ls:2,rf:5,rp:1,rs:2`
[2/6]	cb	8	`lf:4,lp:2,ls:2,rf:2,rp:1,rs:2,re:1,a:1`
[3/0]	aab	11	`lf:7,lp:2,ls:2,rf:4,rp:2,rs:2,re:1`
[3/1]	caa	7	`lf:5,lp:1,ls:1,rf:3,rp:1,rs:1,a:9`
[3/2]	aca	6	`lf:4,lp:2,rf:2,rp:2,a:12`
[3/3]	bba	6	`lf:3,lp:1,ls:2,rf:3,rp:1,rs:3,re:1,a:2`
[3/4]	abb	6	`lf:5,ls:1,rf:3,rp:1,rs:1,a:2`
[3/5]	cac	4	`lf:2,lp:2,a:11`
[3/6]	baa	4	`lf:3,lp:1,a:9`

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

Step 2

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

Rewriting system is complete. See ⟨a, b, c | aab=bc, cba=1⟩.