2019 XCSP3 competition: main track (CSP and COP, 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.0983
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)4395305OPT458 29.0983 29.1031
choco-solver 2019-09-16 (complete)4399285OPT458 98.5011 25.3478
choco-solver 2019-09-16 parallel (complete)4399885OPT458 183.967 24.0872
choco-solver 2019-09-24 parallel (complete)4407085OPT458 189.644 24.6318
choco-solver 2019-09-20 parallel (complete)4404685OPT458 687.309 87.5233
Concrete 3.12.2 (complete)4401085OPT458 1152.46 1118.02
choco-solver 2019-09-20 (complete)4403785OPT458 1710.4 432.132
choco-solver 2019-06-14 parallel (complete)4393925OPT458 5036.86 718.098
choco-solver 2019-06-14 (complete)4393325SAT (TO)460 2520.52 874.584
Concrete 3.10 (complete)4386977SAT (TO)463 2520.11 2464.64
choco-solver 2019-09-24 (complete)4406185SAT (TO)464 2520.1 2493.94
Concrete 3.12.3 (complete)4402885SAT (TO)465 2520.25 2466.45
Concrete 3.12.2 (complete)4396205SAT (TO)470 2520.06 2466.43
cosoco 2.0 parallel (complete)4409645SAT (TO)498 20125.8 2520.02
cosoco 2.O parallel (complete)4398385SAT (TO)511 20124.2 2520.03
AbsCon 2019-07-23 (complete)4390925SAT (TO)556 2520.06 2512.81
cosoco 2.0 (complete)4397105? (TO) 2519.41 2520.01
cosoco 2.0 (complete)4408365? (TO) 2519.52 2520.01
cosoco 2 (complete)4389825? (TO) 2519.94 2520.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: 458
Solution found:
<instantiation> <list> e[] w[][] s[][] sd[][] 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  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  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  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>