bsat-circulation P=NP? A reduction of CNF boolean satisfiability to the circulation problem in an undirected graph