The following table summarizes the solutions for the problems found here.  Each problem id links to a page where you can download individual files associated with that problem.  Follow this link to download all compressed folders each containing a set partitioning problem presented in several forms.  The folder also contains the cplex log file associated with the .lp form of the problem.  Column n is the number of original variables whose value is between 1 and max_coef, while m is the number of rows and also the number of appended variables to guarantee feasibility (their objective coefficient is 2*max_coef).  Therefore, the total number of variables in the set partitioning problem is n + m. 

As noted, the Penalty is 100 for all problems, however, if you want to change this penalty or create your own problems to solve and send the results to me, here is a link to my set partitioning problem generator.  Although you can run it by clicking on the link, you should probably save it to your computer (it should not crash, or destroy anything).  After saving it, simply double-click, answer the questions, and the files will be stored in the directory where you saved the generator.