FPT hardness for Clique and Set Cover with super exponential time in k

We give FPT-hardness for setcover and clique with super exponential time in the parameter k. Under the ð and pgc we prove that setcover admits no log k ratio, for c > 0 for any algorithm with running t(k) = exp ( k(log k) f ) ) · poly(n) for constant f > 0. Under the eth alone, we prove that setcover admits no √ log k ratio, in time exp ( k(log f k) ) · poly(n) for constant f > 0. Under the eth we prove clique admits no (c, t(k)), approximation, for any constant c in time exp(exp(kd)) with d a constant that depends on c.