The proposed method computes each Newton step with linear time-complexity for the total number of discretization
semantics, which ensures satisfiability-preservation, the proposed translation has quadratic algorithmic time-complexity