Is there a way to demonstrate that the problem of double-sat is NP-complete?

Yes, the problem of double-sat can be demonstrated to be NP-complete by reducing it to a known NP-complete problem, such as 3-SAT. This reduction shows that solving double-sat is at least as hard as solving 3-SAT, which is a known NP-complete problem.