P
Initializing...
Lemma 7.1 a), p. 32 — every feasible schedule S of R(I) has #(SAT(S)) ≥ 4n + 4m − VAL(S) · Prove2Me