Options:

Arrive Late Bonus: -10
Leave Early Bonus: 100
Day Off Bonus: -10
No Break Penalty: {0: 660, 60: 0, 240: 0, 300: 200, 330: 400, 360: 800, 420: 1600, 480: 3200, 540: 6400, 600: 12800, 660: 25600}
Pupil Preference Penalties: 100,201,403,807
Instructor Preference Penalties: 305,620,1290,2600
Complex Constraints: 30min M 11:30-13:30,30min T 11:30-13:30,30min W 11:30-13:30,30min R 11:30-13:30,30min F 11:30-13:30,30min S 11:30-13:30,30min U 11:30-13:30

Scheduler Output:

Solving with a time limit of 60 seconds of not improving the solution or a total time limit of 600 seconds
* #variable= 219 #constraint= 54 #product= 139 sizeproduct= 14
Penalty -12000 for term "leave early" (-12000 + 0)
Penalty 2700 for term "arrive late" (2700 + 0)
Penalty 18300 for term "instructor preference" (18300 + 0)
Penalty 24000 for term "pupil preference" (24000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "day off" (0 + 0)
Total Penalty 33000 for term "day off" (33000 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmp05m1l0wo
c Solving...
o 121650
o 118650
o 112650
o 99750
o 96000
o 93750
o 93600
o 83700
o 81450
o 80400
o 78150
o 74250
o 71250
o 68250
o 67500
o 65250
o 62550
o 62100
o 55200
o 55050
o 54900
o 50550
o 50250
o 49200
o 48000
o 45000
o 42000
o 39000
o 36000
o 33300
o 33000
c Answer: 31
v -x1 x2 x3 x4 -x5 x6 x7 x8 x9 -x10 -x11 -x12 -x13 -x14 -x15 -x16 -x17 -x18
v -x19 -x20 x21 x22 x23 x24 -x25 x26 x27 -x28 x29 x30 x31 x32 x33 x34 x35
v -x36 -x37 -x38 -x39 -x40 x41 -x42 -x43 -x44 -x45 -x46 -x47 -x48 -x49 -x50
v x51 -x52 -x53 -x54 -x55 -x56 -x57 x58 -x59 -x60 -x61 -x62 -x63 -x64 -x65
v -x66 -x67 -x68 -x69 -x70 -x71 -x72 -x73 -x74 x75 -x76 -x77 x78 -x79 -x80
v -x81 -x82 -x83 -x84 -x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 -x94 -x95
v -x96 -x97 -x98 -x99 -x100 -x101 -x102 -x103 -x104 -x105 x106 -x107 -x108
v -x109 -x110 -x111 -x112 -x113 -x114 -x115 -x116 -x117 -x118 -x119 -x120
v x121 -x122 -x123 -x124 -x125 -x126 -x127 -x128 -x129 -x130 -x131 -x132
v -x133 -x134 -x135 x136 -x137 -x138 -x139 -x140 -x141 -x142 -x143 -x144
v -x145 -x146 -x147 -x148 -x149 -x150 -x151 -x152 -x153 -x154 -x155 -x156
v -x157 -x158 -x159 -x160 x161 -x162 -x163 x164 x165 -x166 -x167 -x168 -x169
v -x170 -x171 -x172 -x173 -x174 -x175 -x176 -x177 -x178 x179 -x180 -x181
v -x182 -x183 -x184 -x185 -x186 -x187 -x188 -x189 -x190 -x191 x192 -x193
v -x194 -x195 -x196 -x197 -x198 x199 -x200 -x201 -x202 -x203 -x204 -x205
v -x206 -x207 -x208 -x209 -x210 -x211 -x212 -x213 -x214 -x215 -x216 -x217
v x218 -x219
s OPTIMUM FOUND
c
c Models : 31
c Optimum : yes
c Optimization : 33000
c Calls : 1
c Time : 1.073s (Solving: 1.07s 1st Model: 0.00s Unsat: 0.98s)
c CPU Time : 1.010s
c Threads : 8 (Winner: 4)

Solver Run Detail

Schedule