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

Result page for benchmark
GraphColoring/GraphColoring-m1-mono/
GraphColoring-myciel5.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-myciel5.xml
MD5SUMa954d880863fe6e02d270e9cafb0ae96
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark5
Best CPU time to get the best result obtained on this benchmark19.3894
Satisfiable
(Un)Satisfiability was proved
Number of variables47
Number of constraints236
Number of domains1
Minimum domain size47
Maximum domain size47
Distribution of domain sizes[{"size":47,"count":47}]
Minimum variable degree6
Maximum variable degree24
Distribution of variable degrees[{"degree":6,"count":5},{"degree":7,"count":5},{"degree":8,"count":6},{"degree":9,"count":5},{"degree":10,"count":5},{"degree":11,"count":5},{"degree":12,"count":1},{"degree":13,"count":7},{"degree":17,"count":5},{"degree":21,"count":1},{"degree":23,"count":1},{"degree":24,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":236}]
Number of extensional constraints0
Number of intensional constraints236
Distribution of constraint types[{"type":"intension","count":236}]
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)4395522OPT5 19.3894 19.3888
AbsCon 2019-07-23 (complete)4391142OPT5 29.634 27.5111
choco-solver 2019-06-14 (complete)4394142OPT5 41.3068 10.7416
choco-solver 2019-09-20 (complete)4404002OPT5 45.238 11.7951
choco-solver 2019-09-16 (complete)4400402OPT5 48.0568 12.5433
choco-solver 2019-09-24 (complete)4406402OPT5 80.1446 77.3835
choco-solver 2019-06-14 parallel (complete)4394442OPT5 90.3271 12.0266
choco-solver 2019-09-24 parallel (complete)4407302OPT5 109.778 14.6797
choco-solver 2019-09-16 parallel (complete)4400102OPT5 113.169 15.0101
choco-solver 2019-09-20 parallel (complete)4404902OPT5 120.205 15.7969
Concrete 3.12.3 (complete)4403102OPT5 249.521 240.703
Concrete 3.12.2 (complete)4401302OPT5 265.481 255.252
Concrete 3.10 (complete)4392042OPT5 345.989 332.411
cosoco 2.0 (complete)4397702OPT5 630.952 630.94
cosoco 2 (complete)4390242OPT5 632.063 632.033
cosoco 2.0 (complete)4408962OPT5 637.08 637.121
Concrete 3.12.2 (complete)4396422OPT5 1075.18 1052.59
cosoco 2.0 parallel (complete)4409862SAT (TO)5 2012.45 252.021
cosoco 2.O parallel (complete)4398602SAT (TO)5 2012.5 252.023

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: 5
Solution found:
<instantiation> <list> x[]  </list> <values> 3 5 0 0 5 1 1 1 1 1 0 2 2 2 2 2 2 2 2 2 2 2 0 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 0  
</values> </instantiation>