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:

Scheduler Output:

Solving with a time limit of 60 seconds of not improving the solution or a total time limit of 600 seconds
* #variable= 50 #constraint= 0 #product= 160 sizeproduct= 10
Penalty 0 for term "leave early" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty -750000 for term "day off" (-750000 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "pupil preference" (0 + 0)
Total Penalty -750000 for term "pupil preference" (-750000 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmp9tocfs43
c Solving...
o -750000
c Answer: 1
v -x1 -x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 -x10 -x11 -x12 -x13 -x14 -x15 -x16
v -x17 -x18 -x19 -x20 -x21 -x22 -x23 -x24 -x25 -x26 -x27 -x28 -x29 -x30 -x31
v -x32 -x33 -x34 -x35 -x36 -x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 -x45 -x46
v -x47 -x48 -x49 -x50
s SATISFIABLE
c
c INTERRUPTED : 1
c Models : 1+
c Optimum : unknown
c Optimization : -750000
c Calls : 1
c Time : 61.631s (Solving: 61.60s 1st Model: 0.00s Unsat: 0.00s)
c CPU Time : 60.320s
c Threads : 8 (Winner: 8)

Solver Run Detail

Schedule