I was asked to prove that the next language is in class P (polynomial): L={ $a$ | $a$ is a 3CNF and we can split the formula into two 3CNF formulas such that there exists an interpretation that satisfies them both}
I can't seem to understand why this problem can be solved in a polynomial time!