We study the computational complexity of the FO model checking problem on interval graphs. i. e. intersection graphs of intervals on the real line. https://www.markbroyard.com/great-pick-ego-sebitar-solution-500ml-supply-limited-choice/