We study certain generic systems of real polynomial equations associated with triangulations of convex polytopes and investigate their number of real solutions. Our main focus is set on pairs of plane algebraic curves which form a so-called Wronski system. The computational tasks arising in the analysis of such Wronski pairs lead us to the frontiers of current computer algebra algorithms and their implementations, both via Gröbner bases and numerical algebraic geometry.