Because of this 0-1 law, it is possible to test whether any particular first-order sentence is modeled by the Rado graph in a finite amount of time, by choosing a large enough value of and counting the number of -vertex graphs that model the sentence. However, here, "large enough" is at least exponential in the size of the sentence. For instance the extension axiom implies the existence of a -vertex clique, but a clique of that size exists with high probability only in random graphs of size exponential in .