  The Separation Problem asks for the minimum number s(O,K) of hyperplanes
required to strictly separate any interior point O of a convex body K from all
faces of K. The Conjecture is s(O,K) is at most 2 to the power d in real
d-space , and we verify this for the class of simply linked neighbourly
4-polytopes.
