2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Scheduling/Scheduling-os-taillard/
Taillard-os-10-10-6.xml

Jump to solvers results

General information on the benchmark

NameScheduling/Scheduling-os-taillard/
Taillard-os-10-10-6.xml
MD5SUM0823366b416f0d4f591b1c2bb0d09de5
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark616
Best CPU time to get the best result obtained on this benchmark1752.82
Satisfiable
(Un)Satisfiability was proved
Number of variables410
Number of constraints330
Number of domains12
Minimum domain size8
Maximum domain size723
Distribution of domain sizes[{"size":8,"count":10},{"size":9,"count":30},{"size":10,"count":160},{"size":723,"count":210}]
Minimum variable degree2
Maximum variable degree11
Distribution of variable degrees[{"degree":2,"count":110},{"degree":3,"count":200},{"degree":11,"count":100}]
Minimum constraint arity1
Maximum constraint arity12
Distribution of constraint arities[{"arity":1,"count":10},{"arity":2,"count":100},{"arity":3,"count":100},{"arity":10,"count":20},{"arity":12,"count":100}]
Number of extensional constraints100
Number of intensional constraints110
Distribution of constraint types[{"type":"extension","count":100},{"type":"intension","count":110},{"type":"allDifferent","count":10},{"type":"noOverlap","count":10},{"type":"element","count":100}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395712OPT616 1752.82 1752.65
choco-solver 2019-09-24 (complete)4406592SAT (TO)643 2400.06 2382.42
choco-solver 2019-06-14 parallel (complete)4394632SAT (TO)656 11337.9 2520.03
Concrete 3.10 (complete)4392232SAT (TO)664 2400.12 2339.74
choco-solver 2019-09-20 (complete)4404192SAT (TO)668 2400.41 604.699
choco-solver 2019-09-16 (complete)4400592SAT (TO)668 2400.41 604.969
Concrete 3.12.2 (complete)4401492SAT (TO)671 2400.12 2338.23
Concrete 3.12.3 (complete)4403292SAT (TO)682 2400.08 2347.33
choco-solver 2019-09-20 parallel (complete)4405092SAT (TO)685 1996.02 252.09
choco-solver 2019-06-14 (complete)4394332SAT (TO)687 2400.37 865.589
choco-solver 2019-09-16 parallel (complete)4400292SAT (TO)695 1996.39 252.096
Concrete 3.12.2 (complete)4396612SAT (TO)700 2400.1 2341.14
choco-solver 2019-09-24 parallel (complete)4407492SAT (TO)708 1999.92 252.105
cosoco 2.O parallel (complete)4398792? (TO) 2011.96 252.023
cosoco 2.0 parallel (complete)4410052? (TO) 2012.13 252.026
cosoco 2.0 (complete)4397892? (TO) 2400.02 2400.2
AbsCon 2019-07-23 (complete)4391332? (TO) 2400.04 2388.61
cosoco 2.0 (complete)4409152? (TO) 2400.06 2400.2
cosoco 2 (complete)4390432? (TO) 2400.07 2400.01

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

objective function: 616
Solution found:
<instantiation> <list> s[][] d[][] e[] sd[][] w[][]  </list> <values> 0 59 167 255 274 288 358 439 503 531 0 20 84 127 181 191 257 280 333
503 0 66 144 192 280 348 379 415 439 519 92 127 194 236 239 289 396 430 471 595 0 48 90 182 213 303 388 454 520 611 1 72 138 191 290 360 394
451 532 552 0 1 62 88 276 279 332 389 462 546 49 138 272 338 358 378 416 472 528 545 1 74 167 189 281 303 338 438 503 533 1 63 156 241 268
271 366 437 519 594  20 97 84 19 14 70 81 64 18 72 20 64 43 16 10 54 11 52 78 98 59 77 45 88 68 30 36 21 77 88 34 64 19 3 41 77 26 37 56 19
48 42 77 31 61 66 63 62 90 3 71 65 40 99 38 34 36 77 13 60 1 61 22 89 2 45 56 71 84 70 38 97 53 20 2 38 48 49 5 71 70 92 21 92 22 35 99 65
30 83 54 93 83 27 3 95 71 82 74 22  603 601 607 614 614 612 616 616 616 616  59 358 288 439 167 503 531 274 0 255 280 84 127 181 333 257 191
503 20 0 0 439 144 192 415 379 66 348 280 519 239 127 396 289 595 92 430 194 471 236 388 520 48 0 454 182 303 213 90 611 451 191 360 552 1
138 394 290 532 72 332 62 462 88 0 546 276 1 389 279 528 338 358 49 272 416 472 378 545 138 533 303 189 503 74 1 281 438 167 338 156 1 594
366 519 271 268 63 241 437  8 0 4 9 7 2 1 3 5 6 9 8 1 2 3 6 5 0 4 7 0 6 2 3 8 7 5 4 1 9 5 1 7 9 0 3 2 6 8 4 3 2 8 5 7 6 0 4 1 9 4 9 5 1 7 2
6 0 8 3 4 7 1 3 6 9 0 8 2 5 3 9 4 1 2 7 5 6 0 8 5 4 8 2 6 1 9 7 3 0 1 7 0 8 6 5 3 9 4 2   </values> </instantiation>