Counting Split Semiorders

A poset P=(X,) is a split semiorder if a unit interval and a distinguished point in that interval can be assigned to each xX so that xy precisely when x's distinguished point precedes y's interval, and y's distinguished point follows x's interval. For each |X|10, we count the split semiorders and identify all posets that are minimal forbidden posets for split semiorders.