Morphocompletion for #6100 ⟨a, b, c | ab=c, cac=ac⟩

Back:⟨a, b, c | ab=c, cac=ac⟩

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

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: roundsLimit

#Rule
1. ab ⇒ c
2. cac ⇒ ac
3. caac ⇒ aac
4. caaac ⇒ aaac
5. caaaac ⇒ aaaac
6. caaaaac ⇒ aaaaac
7. caaaaaac ⇒ aaaaaac
8. caaaaaaac ⇒ aaaaaaac
9. caaaaaaaac ⇒ aaaaaaaac
10. caaaaaaaaac ⇒ aaaaaaaaac
11. caaaaaaaaaac ⇒ aaaaaaaaaac
12. caaaaaaaaaaac ⇒ aaaaaaaaaaac
13. caaaaaaaaaaaac ⇒ aaaaaaaaaaaac
14. caaaaaaaaaaaaac ⇒ aaaaaaaaaaaaac
15. caaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaac
16. caaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaac
17. caaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaac
18. caaaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaaac
19. caaaaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaaaac
20. caaaaaaaaaaaaaaaaaaac ⇒ aaaaaaaaaaaaaaaaaaac
...

Collecting factors up to length 4 / frequency 7:

[2/0]aa171lf:171,rf:171,rp:18,a:2
[2/1]ac38lf:19,ls:19,rf:19,rp:1,rs:19,re:1,lsrp:1,lsrs:19,a:1
[2/2]ca38lf:19,lp:19,a:1
[3/0]aaa153lf:153,rf:153,rp:17,a:3
[3/1]aac36lf:18,ls:18,rf:18,rp:1,rs:18,re:1,lsrp:1,lsrs:18,a:2
[3/2]caa36lf:18,lp:18,a:2

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

Step 2

Rewriting system is complete. See ⟨a, b, c | ab=c, cac=ac⟩.