To prove that my problem of buffer positioning is NP-Complete, I try to transform my instance to an instance of the SAT problem. Since my problem gives a solution to the instance, then it also solve the SAT instance. Thus SAT problem is no harder than my problem.

Is my demonstration consistent ?