Efficient translation of sequent calculus proofs into natural deduction proofs

To access the proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning, co-located with Federated Logic Conference 2018 (FLoC 2018), see URN: urn:nbn:de:0074-2162-4 or visit http://ceur-ws.org/Vol-2162/.We present a simple and efficient translation of the classical multi-succedent sequent calculus LK to natural deduction. This translation aims to produce few excluded middle inferences, and to keep the quantifier complexity of the instances of excluded middle low. We evaluate the translation on proofs imported from resolution-based first-order theorem provers, and show that it achieves these goals in an efficient manner.Vienna Science and Technology Fund (WWTF)Austrian Science Fund (FWF)Austrian Science Fund (FWF