The CLIQUE problem takes as input an undirected graph G = (V, E) and an integer k > 2, and returns True if G contains a clique of size k.
The script takes as input a formula F in Conjunctive Normal Form and construct a graph that has a clique of size k if and only if the formula F is satisfiable