2018 XCSP3 competition: sequential solvers tracks: 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 benchmark2523
Best CPU time to get the best result obtained on this benchmark2520.1
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)4308591SAT (TO)2523 2520.1 2461.41
OscaR - Hybrid 2018-07-02 (complete)4291659SAT (TO)2583 2400.09 2343.42
Mistral-2.0 2018-06-15 (complete)4289371SAT (TO)2652 2400.02 2400.11
Mistral-2.0 2018-08-01 (complete)4303773SAT (TO)2652 2519.95 2520.01
Choco-solver 4.0.7 seq (493a269) (complete)4292417SAT (TO)2772 2400.08 2385.12
Choco-solver 4.0.7b seq (e747e1e) (complete)4306711SAT (TO)2772 2520.05 2504.41
cosoco 1.12 (complete)4293694SAT (TO)2797 2519.93 2520.01
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311741SAT (TO)3702 2520.1 2499.22
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308005SAT (TO)3951 2520.09 2498.82
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290461SAT (TO)4668 2400.07 2387.72
Sat4j-CSP 2018-07-11 (complete)4289974? 934.424 266.264
PicatSAT 2018-06-15 (complete)4293695? (TO) 2519.85 2520.01
PicatSAT 2018-08-14 (complete)4309527? (TO) 2520.06 2520.02
PicatSAT 2018-08-02 (complete)4303187? (TO) 2520.1 2519.91
Concrete 3.9.2 (complete)4304377? (TO) 2522.13 2472.82
Concrete 3.8 2018-06-13 (complete)4293692? (TO) 2522.15 2470.33
Concrete 3.9.2-SuperNG (complete)4304378? (TO) 2522.19 2486.33
Concrete 3.8-SuperNG 2018-06-13 (complete)4293693? (TO) 2522.2 2470.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: 2523
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> 0 26 8 29 3 27 22 1 43 9
19 33 34 2 11 10 25 17 19 23 38 29 28 35 10 41 0 30 14 18 20 37 3 22 2 23 31 47 7 26 29 2 45 17 23 16 36 39 28 38 4 39 13 33 4 40 32 36 27
34 18 34 3 2 6 32 13 0 36 21 7 15 12 25 40 30 37 16 41 19 10 18 11 15 5 22 20 8 35 8 16 21 1 33 5 11 7 21 1 9 44 14 3 12 9 42 15 24 46 28 31
20 6 6 15 17 5 12 13 14 27 24 25 26 4 </values> </instantiation>