A question from some exam

Moshe Ufnik (guest) 01 Jul 2010 06:56

Hi,

Assuming I know nothing about the relation between $\mathcal{P}$ and $\mathcal{NP}$, what can I say about the following language?

(1)\begin{align} L = \left\{ \phi \in \text{CNF} \, \begin{array}{|l} \text{if }\mathcal{P} \neq \mathcal{NP} \text{ then } \phi \text{ can be satisfied} \\ \text{if }\mathcal{P} = \mathcal{NP} \text{ then } \phi \text{ cannot be satisfied} \end{array} \right\} \end{align}

Thanks,