Let $$ G = \big\langle \, a, b, c \colon a^3 = b^2 = c^2 = (ab)^2 = (bc)^2 = 1, ac = ca \big\rangle. \tag{0} $$ That is, $G$ is a group that has elements $a$, $b$, and $c$ (though these are not the only elements in $G$ of course) and the binary operation of $G$ is such that $$ a^{-1} = a^2, \ b^{-1} = b, \ c^{-1} = c, \tag{1} $$ and also $$ (ab)^{-1} = ab, \ (bc)^{-1} = bc, $$ that is, $$ b^{-1} a^{-1} = ab, \ c^{-1} b^{-1} = bc, $$ which together with (1) above yields $$ ba^2 = ab, \ cb = bc. \tag{2} $$
Thus $G$ has at least the following 13 distinct elements: $$ 1, a, b, c, ab, bc, ca, a^2 b, a^2c, a^2 bc, abc, ba, bac. $$
Is what I've stated above correct? If so, then what is the order of $G$?
If what I've stated is incorrect, then where have I erred?
SAGE provides a very powerful public domain environment for doing all calculations in finite group theory in particular, but also in many many many other branches of mathematics involving formal specifications.
For the case at hand, just type
https://sagecell.sagemath.org/
A window will open. Type in it :
Then press button "Evaluate". The result will be the list of all constituents of the generated group in terms of $A,B,C$ :
$$(1, A, A^{-1}, B, C, AB, AC, A^{-1}B, A^{-1}C, BC, ABC, A^{-1}BC)\tag{1}$$
The generated group has therefore $12$ elements.
Please note
how the group is defined as a quotient group of the free group on $3$ elements.
how the generating relations are described : $A^3$ alone means $A^3=1$ (neutral element), and in particular $(AC)/(CA)$ meaning $(AC)(CA)^{-1}=1$.
You can also ask :
G.cayley_table()
and you will get :
Remark : the neutral element is denoted a.
(please note that a line beginning by # is unevaluated).
The previous instruction gives you the 3 generators of $G$ as a subgroup of the permutation group $S_{12}$, each of them being written as a product of disjunct cycles :
No doubt that the first one corresponds to $A$ (whose order is $3$) and the second and third ones to $B$ and $C$.
There are many other things that you can ask. Refer to the abundant litterature on SAGE.
Edit : among them, here is this one :
giving the answer : "True" !