Given a set of trains, we want to select a set of stations such that every train meets at least one of these stations and the number of selected stations is minimum. This problem is NP-hard. However, we demonstrate that the real-world data from the German and European train schedules can be reduced through a rigorous application of certain dominance and equivalence relations such that it is easily solved by hand or by a brute-force algorithm. Moreover, we report results of a computational study on this real-world data and discuss our result checkers.