Feasible interpolation can be seen as a weak form of automatability. In fact, for many proof systems, such as Extended Frege, feasible interpolation is equivalent to weak automatability. Specifically, many proof systems "P" are able to prove their own soundness which is a tautology formula_36 stating that `if formula_37 is a "P"-proof of a formula formula_38 then formula_38 holds'. Here, formula_40 are encoded by free variables. Moreover, it is possible to generate "P"-proofs of formula_36 in polynomial-time given the length of formula_37 and formula_43. Therefore, an efficient interpolant resulting from short "P"-proofs of soundness of "P" would decide whether a given formula formula_43 admits a short "P"-proof formula_37. Such an interpolant can be used to define a proof system "R" witnessing that "P" is weakly automatable. On the other hand, weak automatability of a proof system "P" implies that "P" admits feasible interpolation. However, if a proof system "P" does not prove efficiently its own soundness, then it might not be weakly automatable even if it admits feasible interpolation.