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

Result page for benchmark
SumColoring/
SumColoring-dsjc-250-5_c18.xml

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-dsjc-250-5_c18.xml
MD5SUM6d15d8403aebe79e9693643b2fca1a5e
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark3949
Best CPU time to get the best result obtained on this benchmark252
Satisfiable
(Un)Satisfiability was proved
Number of variables250
Number of constraints15668
Number of domains1
Minimum domain size250
Maximum domain size250
Distribution of domain sizes[{"size":250,"count":250}]
Minimum variable degree102
Maximum variable degree148
Distribution of variable degrees[{"degree":102,"count":1},{"degree":110,"count":3},{"degree":111,"count":2},{"degree":112,"count":2},{"degree":113,"count":3},{"degree":114,"count":3},{"degree":115,"count":5},{"degree":116,"count":6},{"degree":117,"count":8},{"degree":118,"count":7},{"degree":119,"count":9},{"degree":120,"count":8},{"degree":121,"count":9},{"degree":122,"count":12},{"degree":123,"count":12},{"degree":124,"count":14},{"degree":125,"count":10},{"degree":126,"count":12},{"degree":127,"count":17},{"degree":128,"count":13},{"degree":129,"count":14},{"degree":130,"count":13},{"degree":131,"count":6},{"degree":132,"count":11},{"degree":133,"count":6},{"degree":134,"count":10},{"degree":135,"count":2},{"degree":136,"count":6},{"degree":137,"count":7},{"degree":138,"count":1},{"degree":139,"count":4},{"degree":140,"count":4},{"degree":141,"count":1},{"degree":142,"count":1},{"degree":143,"count":1},{"degree":144,"count":3},{"degree":145,"count":2},{"degree":146,"count":1},{"degree":148,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":15668}]
Number of extensional constraints0
Number of intensional constraints15668
Distribution of constraint types[{"type":"intension","count":15668}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 1.12 (complete)4301563SAT (TO)3949 252 252.011
Choco-solver 4.0.7b seq (e747e1e) (complete)4301561SAT (TO)3979 252.073 245.917
OscaR - Hybrid 2018-08-14 (complete)4310465SAT (TO)4004 252.13 238.836
Mistral-2.0 2018-08-01 (complete)4312553SAT (TO)4270 251.999 252.01
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312325SAT (TO)14757 252.085 245.335
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310115SAT (TO)17293 252.051 245.325
Sat4j-CSP 2018-07-11 (complete)4301562? (TO) 252.674 86.5989
Concrete 3.9.2 (complete)4302489? (TO) 254.096 240.829
Concrete 3.9.2-SuperNG (complete)4302839? (TO) 254.131 240.726

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: 3949
Solution found:
<instantiation type='solution' cost='3949'> <list>c[0] c[100] c[101] c[102] c[103] c[104] c[105] c[106] c[107] c[108] c[109] c[10] c[110]
c[111] c[112] c[113] c[114] c[115] c[116] c[117] c[118] c[119] c[11] c[120] c[121] c[122] c[123] c[124] c[125] c[126] c[127] c[128] c[129]
c[12] c[130] c[131] c[132] c[133] c[134] c[135] c[136] c[137] c[138] c[139] c[13] c[140] c[141] c[142] c[143] c[144] c[145] c[146] c[147]
c[148] c[149] c[14] c[150] c[151] c[152] c[153] c[154] c[155] c[156] c[157] c[158] c[159] c[15] c[160] c[161] c[162] c[163] c[164] c[165]
c[166] c[167] c[168] c[169] c[16] c[170] c[171] c[172] c[173] c[174] c[175] c[176] c[177] c[178] c[179] c[17] c[180] c[181] c[182] c[183]
c[184] c[185] c[186] c[187] c[188] c[189] c[18] c[190] c[191] c[192] c[193] c[194] c[195] c[196] c[197] c[198] c[199] c[19] c[1] c[200]
c[201] c[202] c[203] c[204] c[205] c[206] c[207] c[208] c[209] c[20] c[210] c[211] c[212] c[213] c[214] c[215] c[216] c[217] c[218] c[219]
c[21] c[220] c[221] c[222] c[223] c[224] c[225] c[226] c[227] c[228] c[229] c[22] c[230] c[231] c[232] c[233] c[234] c[235] c[236] c[237]
c[238] c[239] c[23] c[240] c[241] c[242] c[243] c[244] c[245] c[246] c[247] c[248] c[249] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[30]
c[31] c[32] c[33] c[34] c[35] c[36] c[37] c[38] c[39] c[3] c[40] c[41] c[42] c[43] c[44] c[45] c[46] c[47] c[48] c[49] c[4] c[50] c[51]
c[52] c[53] c[54] c[55] c[56] c[57] c[58] c[59] c[5] c[60] c[61] c[62] c[63] c[64] c[65] c[66] c[67] c[68] c[69] c[6] c[70] c[71] c[72]
c[73] c[74] c[75] c[76] c[77] c[78] c[79] c[7] c[80] c[81] c[82] c[83] c[84] c[85] c[86] c[87] c[88] c[89] c[8] c[90] c[91] c[92] c[93]
c[94] c[95] c[96] c[97] c[98] c[99] c[9] </list> <values>1 4 1 0 10 22 37 24 1 19 3 35 9 30 24 9 26 14 0 18 30 11 16 26 6 30 3 17 30 24 8 28
4 20 9 10 26 33 0 8 1 11 13 5 34 12 36 4 13 1 5 18 19 31 4 21 25 34 31 22 27 21 8 19 15 26 7 29 24 9 0 18 15 20 31 23 0 29 2 2 14 11 26 33 5
32 12 11 4 25 7 29 30 7 23 18 10 12 15 12 11 3 8 21 2 11 19 25 6 0 33 10 6 22 17 7 6 15 6 14 27 24 6 35 1 4 9 12 7 13 1 18 7 14 19 34 23 16
16 13 29 20 7 2 0 5 4 22 3 30 6 3 21 18 15 28 8 25 1 18 14 13 24 17 3 28 14 22 32 5 8 24 20 31 28 2 5 6 16 16 26 4 23 2 3 19 29 21 26 15 27
27 3 25 9 29 25 23 10 28 24 10 33 12 3 14 1 17 28 27 20 0 9 4 22 16 33 5 16 32 5 23 2 20 10 28 22 19 30 21 11 27 27 13 12 17 8 31 2 15 17 4
10 11 17 3 25 13 13 32 </values> </instantiation>