2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
SumColoring/
SumColoring-dsjc-125-9_c18.xml

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-dsjc-125-9_c18.xml
MD5SUMfde90c264558af66570e1c8b29991738
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark2639
Best CPU time to get the best result obtained on this benchmark252.332
Satisfiable
(Un)Satisfiability was proved
Number of variables125
Number of constraints6961
Number of domains1
Minimum domain size125
Maximum domain size125
Distribution of domain sizes[{"size":125,"count":125}]
Minimum variable degree104
Maximum variable degree121
Distribution of variable degrees[{"degree":104,"count":2},{"degree":105,"count":1},{"degree":106,"count":1},{"degree":107,"count":3},{"degree":108,"count":8},{"degree":109,"count":10},{"degree":110,"count":9},{"degree":111,"count":16},{"degree":112,"count":13},{"degree":113,"count":18},{"degree":114,"count":11},{"degree":115,"count":8},{"degree":116,"count":12},{"degree":117,"count":7},{"degree":118,"count":4},{"degree":119,"count":1},{"degree":121,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":6961}]
Number of extensional constraints0
Number of intensional constraints6961
Distribution of constraint types[{"type":"intension","count":6961}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Hybrid 2018-08-14 (complete)4310463SAT (TO)2639 252.332 240.408
Mistral-2.0 2018-08-01 (complete)4312559SAT (TO)2720 251.98 252.01
Choco-solver 4.0.7b seq (e747e1e) (complete)4301579SAT (TO)2787 252.047 246.813
cosoco 1.12 (complete)4301581SAT (TO)2797 251.995 252.01
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310113SAT (TO)3925 252.107 247.027
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312323SAT (TO)4563 252.112 246.626
Concrete 3.9.2 (complete)4302487? (TO) 254.199 243.226
Concrete 3.9.2-SuperNG (complete)4302837? (TO) 254.2 243.326
Sat4j-CSP 2018-07-11 (complete)4301580? (TO) 255.477 86.2467

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: 2639
Solution found:
<instantiation> <list> c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[20]
c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[30] c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[40] c[41] c[42] c[43]
c[44] c[45] c[46] c[47] c[48] c[49] c[50] c[51] c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[60] c[61] c[62] c[63] c[64] c[65] c[66]
c[67] c[68] c[69] c[70] c[71] c[72] c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[80] c[81] c[82] c[83] c[84] c[85] c[86] c[87] c[88] c[89]
c[90] c[91] c[92] c[93] c[94] c[95] c[96] c[97] c[98] c[99] c[100] c[101] c[102] c[103] c[104] c[105] c[106] c[107] c[108] c[109] c[110]
c[111] c[112] c[113] c[114] c[115] c[116] c[117] c[118] c[119] c[120] c[121] c[122] c[123] c[124] </list> <values> 17 18 12 14 8 14 3 5 22 9
45 2 41 42 18 24 36 0 2 20 31 6 4 30 22 32 17 32 4 15 44 43 23 3 28 42 29 19 20 0 6 2 13 8 8 11 26 7 47 27 15 36 5 34 22 11 21 33 21 30 14
41 23 31 24 10 5 17 29 37 20 35 16 29 11 34 31 25 39 1 7 43 0 35 19 3 27 26 7 15 36 37 13 6 46 33 1 37 34 10 38 4 23 16 9 28 26 39 44 25 18
32 12 1 1 30 35 16 19 40 21 40 12 9 15 </values> </instantiation>