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

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

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-wap06a.xml
MD5SUMa8532fde929f2c832645b1246a7d35a6
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark40
Best CPU time to get the best result obtained on this benchmark245.19501
Satisfiable
(Un)Satisfiability was proved
Number of variables947
Number of constraints43571
Number of domains1
Minimum domain size947
Maximum domain size947
Distribution of domain sizes[{"size":947,"count":947}]
Minimum variable degree10
Maximum variable degree231
Distribution of variable degrees[{"degree":10,"count":2},{"degree":13,"count":3},{"degree":15,"count":1},{"degree":16,"count":4},{"degree":17,"count":3},{"degree":20,"count":1},{"degree":24,"count":4},{"degree":26,"count":1},{"degree":29,"count":3},{"degree":31,"count":7},{"degree":32,"count":5},{"degree":33,"count":5},{"degree":34,"count":9},{"degree":35,"count":30},{"degree":36,"count":21},{"degree":37,"count":9},{"degree":38,"count":23},{"degree":39,"count":11},{"degree":40,"count":88},{"degree":41,"count":1},{"degree":42,"count":1},{"degree":43,"count":4},{"degree":44,"count":10},{"degree":45,"count":2},{"degree":46,"count":8},"...",{"degree":184,"count":2}, {"degree":185,"count":5}, {"degree":186,"count":2}, {"degree":187,"count":1}, {"degree":188,"count":1}, {"degree":189,"count":1}, {"degree":190,"count":1}, {"degree":191,"count":2}, {"degree":192,"count":2}, {"degree":193,"count":1}, {"degree":194,"count":2}, {"degree":195,"count":2}, {"degree":196,"count":1}, {"degree":199,"count":2}, {"degree":200,"count":1}, {"degree":202,"count":1}, {"degree":205,"count":1}, {"degree":207,"count":1}, {"degree":210,"count":1}, {"degree":211,"count":1}, {"degree":213,"count":1}, {"degree":218,"count":1}, {"degree":219,"count":1}, {"degree":224,"count":2}, {"degree":231,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":43571}]
Number of extensional constraints0
Number of intensional constraints43571
Distribution of constraint types[{"type":"intension","count":43571}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
AbsCon-basic 2017-06-11 (complete)4257538SAT (TO)40 245.19501 240.013
choco-solver 4.0.5 seq (2017-08-09) (complete)4270108SAT (TO)40 246.70399 240.026
choco-solver 4.0.5 seq (2017-07-26) (complete)4254059SAT (TO)40 247.00999 240.00999
choco-solver 4.0.5 seq (2017-08-18) (complete)4282858SAT (TO)40 247.353 240.02699
choco-solver 5a (2017-08-18) (complete)4284328SAT (TO)40 250.22301 240.03
choco-solver 5a (2017-07-26) (complete)4255053SAT (TO)40 251.10001 240.00999
Mistral-2.0 2017-07-28 (complete)4259029SAT (TO)40 251.804 252.011
cosoco 1.12 (complete)4268638SAT (TO)40 251.80901 252.01199
cosoco 1.1 (complete)4258532SAT (TO)40 251.957 252.011
choco-solver 4.0.5 par (2017-07-26) (complete)4254556SAT (TO)40 1920.73 244.83501
choco-solver 4.0.5 par (2017-08-18) (complete)4281388SAT (TO)40 1977.67 252.14
choco-solver 4.0.5 par (2017-08-09) (complete)4271578SAT (TO)41 1973.48 252.13499
Concrete 3.4 (complete)4259526SAT (TO)42 260.939 240.043
OscaR - ALNS 2017-07-26 (complete)4255550SAT (TO)44 252.242 240.043
OscaR - Hybrid 2017-07-26 (complete)4256544SAT (TO)45 258.94199 240.043
OscaR - Conflict Ordering 2017-07-26 (complete)4256047SAT (TO)331 254.106 240.05299
OscaR - Parallel with EPS 2017-07-26 (complete)4257041SAT (TO)919 1922.65 262.724
OscaR - Parallel with EPS 2017-08-22 (complete)4285798SAT (TO)921 1838.53 252.22
cosoco-sat 1.12 (complete)4266707? (MO) 64.792702 64.811798
sat4j-CSP 2017-07-05 (complete)4258035? (TO) 260.189 87.699799

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: 40
Solution found:
<instantiation id='sol8' type='solution' cost='40'>  <list> x[] </list>  <values> 9 4 22 26 17 15 14 25 5 23 0 1 13 12 14 0 13 6 2 12 1 6 35
21 15 4 27 20 10 21 14 10 2 4 17 6 22 19 3 18 1 2 12 18 19 4 22 8 21 12 22 30 34 35 37 38 4 39 14 16 37 7 10 12 0 18 7 20 22 23 24 9 29 14
30 24 31 30 32 31 3 2 13 1 9 3 1 3 8 1 4 24 30 35 1 21 24 30 32 24 23 17 8 24 26 40 32 16 0 11 1 6 19 22 23 27 28 32 33 34 35 0 11 21 6 23 3
0 31 5 25 0 0 1 8 6 9 10 7 13 11 3 21 24 14 25 33 9 33 34 7 19 15 18 23 27 28 29 34 5 3 21 26 29 32 12 11 35 25 32 22 29 31 8 0 11 1 27 39
28 22 4 16 3 5 0 0 3 0 20 30 31 5 5 7 9 21 11 10 0 28 24 20 21 29 29 7 2 3 6 0 7 9 18 11 22 15 22 25 11 25 27 27 28 31 6 23 26 4 22 38 2 12
1 1 26 0 3 6 38 36 8 17 5 11 30 15 11 34 15 24 25 27 28 3 4 7 1 15 28 6 12 16 29 12 10 39 2 28 34 2 39 3 20 9 5 25 29 2 11 26 5 32 9 3 5 32
27 0 2 5 17 7 8 11 22 19 23 5 2 5 23 19 6 17 40 20 24 39 22 4 6 25 17 26 18 38 6 8 0 12 20 1 19 13 1 2 22 36 11 9 9 8 20 0 0 6 20 1 33 15 21
12 9 20 27 13 5 29 27 2 23 10 33 38 4 8 5 14 7 2 23 32 6 31 13 14 4 2 28 18 1 7 12 14 8 29 21 0 35 18 36 4 38 27 40 8 20 21 5 0 31 29 14 21
1 23 4 17 23 22 26 38 28 4 8 16 17 23 22 15 20 19 6 6 26 20 24 12 3 27 19 33 8 15 29 21 34 8 2 14 5 5 2 27 7 15 19 3 40 30 25 29 0 13 4 36
10 4 12 16 0 28 26 15 34 24 2 36 29 31 9 2 34 19 13 36 10 22 15 22 12 10 17 22 19 23 36 22 2 6 1 0 1 36 3 2 17 2 14 12 19 16 15 16 25 16 5 8
33 0 3 15 17 37 24 5 6 12 7 9 7 25 40 20 32 7 24 16 37 38 35 25 14 28 18 22 39 10 19 7 17 12 4 5 6 3 23 33 10 18 24 7 11 21 40 7 30 40 2 19
32 28 9 19 21 9 35 12 17 32 19 12 18 8 27 25 36 31 12 13 20 18 1 23 32 10 29 30 26 9 38 32 31 0 16 35 30 8 18 31 39 37 30 36 26 31 18 18 21
3 15 33 19 10 28 4 11 20 40 38 9 19 11 39 15 37 26 2 13 12 4 9 27 13 29 19 24 0 26 5 5 25 39 15 16 22 6 1 22 21 10 36 3 18 4 1 11 3 5 19 17
21 30 39 40 5 40 0 37 29 33 31 20 13 34 25 29 4 22 8 40 15 6 0 36 26 2 30 10 9 0 32 15 16 38 8 13 10 4 38 27 33 16 14 24 21 35 25 19 34 7 31
39 12 2 27 17 6 9 3 13 38 10 8 5 18 34 17 13 24 26 13 9 16 28 0 7 9 40 18 9 19 39 28 0 14 36 7 7 32 29 22 40 10 39 14 29 31 23 40 13 1 10 4
5 3 9 28 35 31 13 7 37 32 18 26 9 12 37 10 21 35 36 37 1 6 5 8 30 0 23 8 35 19 3 37 1 38 27 3 33 34 25 39 34 27 10 37 28 23 16 20 1 30 8 1
32 16 24 34 21 35 35 26 35 6 32 40 38 7 2 15 5 1 12 34 17 0 8 28 26 33 2 21 28 16 37 31 8 33 14 11 3 36 1 32 20 30 14 3 6 11 17 25 23 14 22
12 36 31 11 6 22 4 35 16 27 28 25 33 25 29 7 18 31 13 15 17 30 26 2 21 20 24 33 11 17 24 38 30 37 20 20 34 34 11 4 11 27 15 14 23 18 39 24
13 5 13 16 17 28 10 37 31 20 30 8 30 4 33 30 34 9 22 34 35 36 20 0 15 19 31 4 16 2 5 18 10 21 12 33 9 37 12 14 23 </values> 
</instantiation>