New worst-case upper bounds for SAT

Transformation rules constitute a substantial part of the splitting method for handling the SAT problem. This article presents a new transformation rule and two algorithms using such a rule. It is proven that the algorithms have worst-case upper bounds.