2018 XCSP3 competition: mini-solvers track: solvers results per benchmarks

Result page for benchmark
GraphColoring/
GraphColoring-queen5-5_c18.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/
GraphColoring-queen5-5_c18.xml
MD5SUMe12c8a42b46a63e49e1504c0c9e3cd93
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark0.029325
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints160
Number of domains1
Minimum domain size25
Maximum domain size25
Distribution of domain sizes[{"size":25,"count":25}]
Minimum variable degree13
Maximum variable degree17
Distribution of variable degrees[{"degree":13,"count":16},{"degree":15,"count":8},{"degree":17,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":160}]
Number of extensional constraints0
Number of intensional constraints160
Distribution of constraint types[{"type":"intension","count":160}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4298434OPT4 0.029325 0.030919
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4298438OPT4 0.89638 0.452426
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4298439SAT4 304.08 300.387
slowpoke 2018-04-29 (incomplete)4298437SAT (TO)4 2520.02 2511.31
MiniCPFever 2018-04-29 (complete)4298436SAT (TO)4 2520.07 2512.31
GG's minicp 2018-04-29 (complete)4298435SAT (TO)4 2520.08 2500.12
The dodo solver 2018-04-29 (complete)4298440SAT (TO)4 2520.12 2511.03

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: 4
Solution found:
<instantiation type='solution' cost='4'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23]
x[24] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 2 0 3 1 4 3 1 4 2 0 3 4 2 0 3 1 1 4 2 1 4 2 0 3 </values> </instantiation>