  In this paper, the relative efficiency of two propositional systems is
studied: resolution and cut-free LK in DAG. We give an upper bound for
translation of resolution refutation to cut-free LK proofs. The best upper
bound known was 2.
