  In this paper, we analyze the argument made by Kumar in the technical report
"Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in
CNF and Its Implications on P versus NP problem." The paper claims to present a
polynomial-time algorithm that decides CNF-SAT. We show that the paper's
analysis is flawed and that the fundamental underpinning of its algorithm
requires an exponential number of steps on infinitely many inputs.
