On page 101, A Mathematical Introduction to Logic, Herbert B. Enderton(2ed),
What subsets of the real line $\mathbb R$ are definable in $(\mathbb R; <)$? What subsets of the plane $\mathbb R × \mathbb R$ are definable in $(\mathbb R; <)$? Remarks: The nice thing about $(\mathbb R; <)$ is that its automorphisms are exactly the order-preserving maps from R onto itself. But stop after the binary relations. There are $2^{13}$ definable ternary relations, so you do not want to catalog all of them.
Here's how far I understand. Any strictly increasing function forms an automorphism, so no singleton is definable in this structure. Thus we can't distinguish a set and a translation of it. So no subset is definable.
The definable relation of $(\mathbb R, <)$ I can think of are $<$, $>$ ,$=$, $\leq$, $\geq$ and the trivial one which is the whole set $\mathbb R × \mathbb R$. I can't figure out a way to exhaust it and to make sure of it.
The most obscure problem to me is in the last line of the remark. How can we get that exact number $2^{13}$?