Morphocompletion for #2783 ⟨a, b, c | abc=b, baca=1⟩

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

Rewriting system is not complete: roundsLimit

#	Rule
1.	abc ⇒ b
2.	bacb ⇒ bc
3.	abac ⇒ 1
4.	baca ⇒ 1
5.	bcacb ⇒ bcc
6.	bcaca ⇒ bac
7.	bccacb ⇒ bccc
8.	bccaca ⇒ bcac
9.	bcccacb ⇒ bcccc
10.	bcccaca ⇒ bccac
11.	bccccacb ⇒ bccccc
12.	bccccaca ⇒ bcccac
13.	bcccccacb ⇒ bcccccc
14.	bcccccaca ⇒ bccccac
15.	bccccccacb ⇒ bccccccc
16.	bccccccaca ⇒ bcccccac
17.	bcccccccacb ⇒ bcccccccc
18.	bcccccccaca ⇒ bccccccac
19.	bccccccccacb ⇒ bccccccccc
20.	bccccccccaca ⇒ bcccccccac
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	cc	56	`lf:56,rf:57,rs:8,a:4`
[2/1]	ca	34	`lf:25,ls:9,rf:7,a:1`
[2/2]	bc	34	`lf:17,lp:16,ls:1,rf:16,rp:16,rs:1,re:1,lprp:15`
[2/3]	ac	20	`lf:19,ls:1,rf:8,rs:8,a:1`
[2/4]	cb	18	`lf:9,ls:9,a:2`
[2/5]	ba	5	`lf:3,lp:2,rf:1,rp:1,a:1`
[2/6]	ab	4	`lf:2,lp:2`
[3/0]	ccc	42	`lf:42,rf:43,rs:7,a:5`
[3/1]	bcc	28	`lf:14,lp:14,rf:14,rp:14,rs:1,re:1,lprp:13,a:4`
[3/2]	aca	18	`lf:9,ls:9,a:1`
[3/3]	acb	18	`lf:9,ls:9,a:2`
[3/4]	cac	16	`lf:16,rf:7,rs:7,a:3`
[3/5]	cca	14	`lf:14,rf:6,a:5`
[3/6]	bac	6	`lf:3,lp:2,ls:1,rf:1,rp:1,rs:1,re:1,a:1`

Considering [length 2 / frequency 1] ca=d.

Step 2

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

Rewriting system is complete. See ⟨a, b, c | abc=b, baca=1⟩.