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

Result page for benchmark
SumColoring/
SumColoring-myciel7_c18.xml

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-myciel7_c18.xml
MD5SUMe6a47a1c7f616b6a479cb76d144f475c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark208
Best CPU time to get the best result obtained on this benchmark2520.07
Satisfiable
(Un)Satisfiability was proved
Number of variables191
Number of constraints2360
Number of domains1
Minimum domain size191
Maximum domain size191
Distribution of domain sizes[{"size":191,"count":191}]
Minimum variable degree8
Maximum variable degree96
Distribution of variable degrees[{"degree":8,"count":5},{"degree":9,"count":5},{"degree":10,"count":6},{"degree":11,"count":5},{"degree":12,"count":10},{"degree":13,"count":10},{"degree":14,"count":6},{"degree":15,"count":12},{"degree":16,"count":6},{"degree":17,"count":6},{"degree":18,"count":5},{"degree":19,"count":10},{"degree":20,"count":5},{"degree":21,"count":10},{"degree":22,"count":5},{"degree":23,"count":6},{"degree":24,"count":1},{"degree":25,"count":7},{"degree":26,"count":8},{"degree":27,"count":7},{"degree":29,"count":6},{"degree":33,"count":5},{"degree":34,"count":5},{"degree":35,"count":5},{"degree":37,"count":5},{"degree":41,"count":5},{"degree":42,"count":1},{"degree":43,"count":1},{"degree":45,"count":1},{"degree":46,"count":1},{"degree":47,"count":1},{"degree":48,"count":1},{"degree":49,"count":9},{"degree":65,"count":5},{"degree":81,"count":1},{"degree":89,"count":1},{"degree":93,"count":1},{"degree":95,"count":1},{"degree":96,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":2360}]
Number of extensional constraints0
Number of intensional constraints2360
Distribution of constraint types[{"type":"intension","count":2360}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
MiniCPFever 2018-04-29 (complete)4298636SAT (TO)208 2520.07 2488.32
The dodo solver 2018-04-29 (complete)4298640SAT (TO)220 2520.08 2452.62
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete)4298639SAT224 309.534 301.191
GG's minicp 2018-04-29 (complete)4298635SAT (TO)226 2520.07 2460.72
cosoco 1.12 (complete)4298634SAT (TO)251 2520.06 2520.01
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete)4298638SAT (TO)255 2520.03 2472.62
slowpoke 2018-04-29 (incomplete)4298637SAT (TO)255 2520.12 2449.52

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: 208
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] c[125] c[126] c[127] c[128] c[129] c[130]
c[131] c[132] c[133] c[134] c[135] c[136] c[137] c[138] c[139] c[140] c[141] c[142] c[143] c[144] c[145] c[146] c[147] c[148] c[149] c[150]
c[151] c[152] c[153] c[154] c[155] c[156] c[157] c[158] c[159] c[160] c[161] c[162] c[163] c[164] c[165] c[166] c[167] c[168] c[169] c[170]
c[171] c[172] c[173] c[174] c[175] c[176] c[177] c[178] c[179] c[180] c[181] c[182] c[183] c[184] c[185] c[186] c[187] c[188] c[189] c[190]
</list> <values> 3 2 3 2 4 1 1 1 1 1 2 3 2 3 2 5 1 1 1 1 1 2 6 3 2 3 2 4 1 1 1 1 1 2 3 2 3 2 4 1 1 1 1 1 2 4 5 3 2 3 2 4 1 1 1 1 1 2 3 2 3 2
5 1 1 1 1 1 2 7 3 2 3 2 4 1 1 1 1 1 2 3 2 3 2 4 1 1 1 1 1 2 4 5 6 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 1 </values>
</instantiation>