In the Resolution equivalence ($\neg A \implies B, B \implies C \models \neg A \implies C$) must $A$ be negated?
The answer is yes. But the departure point is slightly different.
Here it is:

\begin{array}{|c|c|c|}
\hline
\neg A \vee B, \neg B \vee C \models \neg A \vee C &amp; 
A \implies B, B \implies C \models A \implies C \\ 
\hline
\end{array}

The former statement is just the fact that if you start with $A\vee B$
and turn it into an implication you find $\neg A\implies B$.