Show that FD$-$SAT is in P$.$ That is$,$ show that there is a

polynomial$-$time algorithm for determining the satisfiability of a formula in fully$-$

developed CNF$.$ You may assume that the fully$-$developed CNF of a formula is

unique up to a rearrangement of the literals within each constituent. Your proof

may be informal.

$2$