Options:

Arrive Late Bonus: 310
Leave Early Bonus: 320
Day Off Bonus: 500
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= 37 #constraint= 21 #product= 45 sizeproduct= 12
Penalty 0 for term "day off" (0 + 0)
Penalty 9150 for term "instructor preference" (9150 + 0)
Penalty 0 for term "leave early" (0 + 0)
Penalty 0 for term "pupil preference" (0 + 0)
Penalty -9300 for term "arrive late" (-9300 + 0)
Penalty 0 for term "no break" (0 + 0)
Total Penalty -150 for term "no break" (-150 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmptj2wfd8k
c Solving...
o 22050
o 2850
o -150
c Answer: 3
v -x1 x2 x3 x4 x5 -x6 x7 x8 x9 x10 x11 x12 -x13 x14 -x15 -x16 -x17 x18 -x19
v -x20 -x21 -x22 -x23 x24 -x25 -x26 x27 -x28 -x29 x30 x31 -x32 -x33 x34 -x35
v -x36 x37
s OPTIMUM FOUND
c
c Models : 3
c Optimum : yes
c Optimization : -150
c Calls : 1
c Time : 0.001s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
c CPU Time : 0.000s
c Threads : 8 (Winner: 7)

Solver Run Detail

Schedule