Note that
$$
\begin{align}
(A-I)B
&=(A-I)(A^2+A-6I)\\
&=(A-2I)(A^2+2A-3I)\\[4pt]
&=0
\end{align}
$$
Thus, unless $A=I$, and therefore, $B=-4I$, $(A-I)B=0$ implies that $B$ is not invertible.
Clarification: Suppose that $B^{-1}$ exists, then
$$
\begin{align}
A-I
&=(A-I)BB^{-1}\\
&=0B^{-1}\\[6pt]
&=0
\end{align}
$$
Thus, if $B^{-1}$ exists, then $A=I$. This is the contapositive of "if $A\ne I$, then $B$ is not invertible".
A bit of explanation
I used the Euclid-Wallis Algorithm to try and write $(A^2+A-6I)x+(A^2+2A-3I)y=I$ to compute an inverse for $A^2+A-6I\bmod A^2+2A-3I$:
$$
\begin{array}{c|c}
&&1&-A+I\\\hline
1&0&1&A-I\\
0&1&-1&-A+2I\\
A^2+A-6I&A^2+2A-3I&-A-3I&0
\end{array}
$$
Unfortunately, this showed that $A+3I$ was the GCD of $A^2+A-6I$ and $A^2+2A-3I$. However, this did show that
$$
(A-I)(A^2+A-6I)-(A-2I)(A^2+2A-3I)=0
$$
which was used in the answer above.