Morphocompletion for #1984 ⟨a, b, c | abc=ba, ccb=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(c) = 0; deg(b) = deg(a) = 1, b < a

Rewriting system is not complete: roundsLimit

#	Rule
1.	ccb ⇒ 1
2.	abc ⇒ ba
3.	acbc ⇒ a
4.	ccab ⇒ acb
5.	bacb ⇒ ab
6.	ccaab ⇒ acab
7.	bacab ⇒ aab
8.	ccaaab ⇒ acaab
9.	bacaab ⇒ aaab
10.	ccaaaab ⇒ acaaab
11.	bacaaab ⇒ aaaab
12.	ccaaaaab ⇒ acaaaab
13.	bacaaaab ⇒ aaaaab
14.	ccaaaaaab ⇒ acaaaaab
15.	bacaaaaab ⇒ aaaaaab
16.	ccaaaaaaab ⇒ acaaaaaab
17.	bacaaaaaab ⇒ aaaaaaab
18.	ccaaaaaaaab ⇒ acaaaaaaab
19.	bacaaaaaaab ⇒ aaaaaaaab
20.	bacaaaaaaaab ⇒ aaaaaaaaab
	...

Collecting factors up to length 4 / frequency 7:

[2/0]	aa	56	`lf:56,rf:57,rp:8,a:4`
[2/1]	ab	34	`lf:17,lp:1,ls:16,rf:16,rp:1,rs:16,re:1,lsrs:15`
[2/2]	ba	18	`lf:9,lp:9,rf:1,rp:1,rs:1,re:1`
[2/3]	cc	18	`lf:9,lp:9,a:1`
[2/4]	ca	16	`lf:16,rf:7,a:3`
[2/5]	ac	11	`lf:10,lp:1,rf:8,rp:8,a:2`
[2/6]	cb	5	`lf:3,ls:2,rf:1,rs:1,a:1`
[3/0]	aaa	42	`lf:42,rf:43,rp:7,a:7`
[3/1]	aab	28	`lf:14,ls:14,rf:14,rp:1,rs:14,re:1,lsrs:13,a:4`
[3/2]	bac	18	`lf:9,lp:9,a:2`
[3/3]	cca	16	`lf:8,lp:8,a:3`
[3/4]	caa	14	`lf:14,rf:6,a:6`
[3/5]	aca	8	`lf:8,rf:7,rp:7,a:4`
[3/6]	cab	4	`lf:2,ls:2,rf:1,rs:1,a:3`

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

Step 2

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

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