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

Result page for benchmark
Scheduling/Scheduling-os-taillard/
Taillard-os-07-07-8.xml

Jump to solvers results

General information on the benchmark

NameScheduling/Scheduling-os-taillard/
Taillard-os-07-07-8.xml
MD5SUM3801e67c429176a130b0cb7922d17a7f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark458
Best CPU time to get the best result obtained on this benchmark29.4515
Satisfiable
(Un)Satisfiability was proved
Number of variables203
Number of constraints168
Number of domains9
Minimum domain size6
Maximum domain size560
Distribution of domain sizes[{"size":6,"count":7},{"size":7,"count":91},{"size":560,"count":105}]
Minimum variable degree2
Maximum variable degree8
Distribution of variable degrees[{"degree":2,"count":56},{"degree":3,"count":98},{"degree":8,"count":49}]
Minimum constraint arity1
Maximum constraint arity9
Distribution of constraint arities[{"arity":1,"count":7},{"arity":2,"count":49},{"arity":3,"count":49},{"arity":7,"count":14},{"arity":9,"count":49}]
Number of extensional constraints49
Number of intensional constraints56
Distribution of constraint types[{"type":"extension","count":49},{"type":"intension","count":56},{"type":"allDifferent","count":7},{"type":"noOverlap","count":7},{"type":"element","count":49}]
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)4395605OPT458 29.4515 29.4577
choco-solver 2019-09-24 parallel (complete)4407385OPT458 898.189 114.056
choco-solver 2019-09-20 (complete)4404085OPT458 1181.35 298.396
choco-solver 2019-09-16 (complete)4400485OPT458 1248.93 315.364
choco-solver 2019-06-14 (complete)4394225OPT458 1597.54 819.108
choco-solver 2019-09-20 parallel (complete)4404985SAT (TO)459 1992.76 252.094
choco-solver 2019-09-16 parallel (complete)4400185SAT (TO)460 1992.85 252.115
Concrete 3.10 (complete)4392125SAT (TO)463 2400.12 2345.33
Concrete 3.12.3 (complete)4403185SAT (TO)464 2400.1 2352.83
choco-solver 2019-09-24 (complete)4406485SAT (TO)464 2400.12 2373.42
Concrete 3.12.2 (complete)4401385SAT (TO)466 2400.11 2343.43
Concrete 3.12.2 (complete)4396505SAT (TO)473 2400.06 2346.04
cosoco 2.O parallel (complete)4398685SAT (TO)509 2012.5 252.026
cosoco 2.0 parallel (complete)4409945SAT (TO)523 2012.49 252.023
AbsCon 2019-07-23 (complete)4391225SAT (TO)556 2400.11 2392.02
cosoco 2.0 (complete)4397785? (TO) 2400.01 2399.9
cosoco 2.0 (complete)4409045? (TO) 2400.04 2400.01
cosoco 2 (complete)4390325? (TO) 2400.07 2400.11
choco-solver 2019-06-14 parallel (complete)4394525Wrong Opt.460 622.42 105.423

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: 458
Solution found:
<instantiation> <list> e[] w[][] sd[][] s[][] d[][]  </list> <values> 458 385 458 458 457 454 458  3 4 6 2 5 0 1 0 3 6 2 4 1 5 0 1 3 6 2 4 5
4 0 1 5 2 6 3 6 4 5 0 1 3 2 5 6 2 3 0 1 4 1 2 3 5 6 4 0  333 391 219 0 88 260 176 0 266 184 45 223 338 111 16 62 346 244 370 385 320 69 159
251 363 0 209 343 178 229 371 288 72 85 4 244 338 117 182 391 2 84 365 0 31 118 303 192 210  0 88 176 219 260 333 391 0 45 111 184 223 266
338 16 62 244 320 346 370 385 0 69 159 209 251 343 363 4 72 85 178 229 288 371 2 84 117 182 244 338 391 0 31 118 192 210 303 365  43 71 31
32 72 32 67 13 66 60 35 41 72 47 46 94 44 6 23 15 73 69 90 50 42 92 20 95 68 13 93 51 37 75 86 82 27 65 62 89 47 63 31 86 64 17 92 62 93  
</values> </instantiation>