The minimum number of incomplete blocks required to cover, exactly lambda times, all t-element subsets from a set V of cardinality v (v > t) is denoted by y(lambda, t; v). The value of g(2, 2; v) is known for v = 3, 4,..., 11. It was previously known that 14 less than or equal to g(2, 2; 12) less than or equal to 16. We prove that g(2, 2; 12) greater than or equal to 15
