On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems