2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
GraphColoring/GraphColoring-m1-mono/
GraphColoring-2-fullins-5.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-2-fullins-5.xml
MD5SUM7175cc64c8263572fa1d1d1459976d33
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark6
Best CPU time to get the best result obtained on this benchmark58.2779
Satisfiable
(Un)Satisfiability was proved
Number of variables852
Number of constraints12201
Number of domains1
Minimum domain size852
Maximum domain size852
Distribution of domain sizes[{"size":852,"count":852}]
Minimum variable degree9
Maximum variable degree216
Distribution of variable degrees[{"degree":9,"count":4},{"degree":10,"count":10},{"degree":11,"count":10},{"degree":12,"count":24},{"degree":13,"count":14},{"degree":14,"count":28},{"degree":15,"count":20},{"degree":16,"count":40},{"degree":17,"count":26},{"degree":18,"count":52},{"degree":19,"count":24},{"degree":20,"count":52},{"degree":21,"count":10},{"degree":22,"count":20},{"degree":23,"count":24},{"degree":24,"count":48},{"degree":25,"count":18},{"degree":26,"count":36},{"degree":27,"count":20},{"degree":28,"count":40},{"degree":29,"count":16},{"degree":30,"count":32},{"degree":31,"count":32},{"degree":32,"count":64},{"degree":33,"count":4},{"degree":34,"count":8},{"degree":35,"count":4},{"degree":36,"count":8},{"degree":41,"count":4},{"degree":42,"count":8},{"degree":43,"count":8},{"degree":44,"count":16},{"degree":45,"count":8},{"degree":46,"count":16},{"degree":47,"count":16},{"degree":48,"count":32},{"degree":58,"count":4},{"degree":61,"count":4},{"degree":62,"count":8},{"degree":63,"count":8},{"degree":64,"count":16},{"degree":111,"count":4},{"degree":112,"count":8},{"degree":216,"count":4}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":12201}]
Number of extensional constraints0
Number of intensional constraints12201
Distribution of constraint types[{"type":"intension","count":12201}]
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)4395244OPT6 58.2779 58.274
AbsCon 2019-07-23 (complete)4390864OPT6 93.4886 88.3155
choco-solver 2019-09-20 (complete)4403724OPT6 172.721 44.5244
choco-solver 2019-06-14 (complete)4393264OPT6 189.662 48.6298
choco-solver 2019-09-16 (complete)4399224OPT6 193.17 49.6135
cosoco 2.0 (complete)4397044OPT6 308.565 308.595
cosoco 2.0 (complete)4408304OPT6 320.376 320.416
cosoco 2 (complete)4389764OPT6 327.064 327.102
choco-solver 2019-06-14 parallel (complete)4393864OPT6 353.01 47.0797
choco-solver 2019-09-16 parallel (complete)4399824OPT6 367.293 48.8054
choco-solver 2019-09-20 parallel (complete)4404624OPT6 382.635 50.8577
choco-solver 2019-09-24 parallel (complete)4407024OPT6 392.902 51.9814
choco-solver 2019-09-24 (complete)4406124OPT6 507.923 501.315
Concrete 3.10 (complete)4387009OPT6 2007.68 1954.79
Concrete 3.12.3 (complete)4402824OPT6 2382.72 2325.01
cosoco 2.O parallel (complete)4398324OPT6 4098.51 515.62
cosoco 2.0 parallel (complete)4409584OPT6 4152.28 522.473
Concrete 3.12.2 (complete)4401024SAT (TO)6 2520.1 2457.04
Concrete 3.12.2 (complete)4396144SAT (TO)701 2520.09 2486.75

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