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

Result page for benchmark
GraphColoring/GraphColoring-m1-mono/
GraphColoring-lei450-25d.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-lei450-25d.xml
MD5SUM1f90dacd0a92fbbf60104d292dc9abb3
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT TO
Best value of the objective obtained on this benchmark26
Best CPU time to get the best result obtained on this benchmark240.039
Satisfiable
(Un)Satisfiability was proved
Number of variables450
Number of constraints17425
Number of domains1
Minimum domain size450
Maximum domain size450
Distribution of domain sizes[{"size":450,"count":450}]
Minimum variable degree12
Maximum variable degree158
Distribution of variable degrees[{"degree":12,"count":2},{"degree":13,"count":1},{"degree":14,"count":1},{"degree":18,"count":1},{"degree":19,"count":2},{"degree":20,"count":1},{"degree":21,"count":1},{"degree":22,"count":1},{"degree":23,"count":1},{"degree":24,"count":3},{"degree":25,"count":2},{"degree":26,"count":1},{"degree":27,"count":1},{"degree":28,"count":1},{"degree":29,"count":3},{"degree":31,"count":1},{"degree":32,"count":1},{"degree":33,"count":2},{"degree":34,"count":2},{"degree":35,"count":4},{"degree":36,"count":1},{"degree":37,"count":2},{"degree":38,"count":2},{"degree":39,"count":3},{"degree":40,"count":3},"...",{"degree":120,"count":4}, {"degree":121,"count":2}, {"degree":122,"count":3}, {"degree":123,"count":1}, {"degree":124,"count":1}, {"degree":125,"count":1}, {"degree":126,"count":1}, {"degree":127,"count":1}, {"degree":128,"count":3}, {"degree":129,"count":1}, {"degree":130,"count":1}, {"degree":131,"count":2}, {"degree":132,"count":1}, {"degree":133,"count":2}, {"degree":134,"count":2}, {"degree":136,"count":1}, {"degree":138,"count":1}, {"degree":139,"count":1}, {"degree":140,"count":1}, {"degree":142,"count":2}, {"degree":143,"count":2}, {"degree":146,"count":1}, {"degree":149,"count":1}, {"degree":152,"count":2}, {"degree":158,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":17425}]
Number of extensional constraints0
Number of intensional constraints17425
Distribution of constraint types[{"type":"intension","count":17425}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco-sat 1.12 (complete)4266703SAT (TO)26 240.039 240.09801
AbsCon-basic 2017-06-11 (complete)4257534SAT (TO)26 243.86 240.013
choco-solver 4.0.5 seq (2017-08-09) (complete)4270104SAT (TO)26 244.73399 240.021
choco-solver 4.0.5 seq (2017-08-18) (complete)4282854SAT (TO)26 244.817 240.021
choco-solver 4.0.5 seq (2017-07-26) (complete)4254055SAT (TO)26 245.2 240.00999
choco-solver 5a (2017-07-26) (complete)4255049SAT (TO)26 250.03999 240.00999
choco-solver 5a (2017-08-18) (complete)4284324SAT (TO)26 250.47501 240.02299
Mistral-2.0 2017-07-28 (complete)4259025SAT (TO)26 251.875 252.00999
cosoco 1.12 (complete)4268634SAT (TO)26 251.944 252.00999
cosoco 1.1 (complete)4258528SAT (TO)26 251.991 252.00999
Concrete 3.4 (complete)4259522SAT (TO)26 259.01901 240.039
choco-solver 4.0.5 par (2017-07-26) (complete)4254552SAT (TO)26 1920.6 242.435
choco-solver 4.0.5 par (2017-08-18) (complete)4281384SAT (TO)26 1996.25 252.125
choco-solver 4.0.5 par (2017-08-09) (complete)4271574SAT (TO)26 1998 252.118
OscaR - ALNS 2017-07-26 (complete)4255546SAT (TO)27 248.27901 240.03799
OscaR - Hybrid 2017-07-26 (complete)4256540SAT (TO)27 249.754 240.026
OscaR - Conflict Ordering 2017-07-26 (complete)4256043SAT (TO)28 249.29401 240.041
OscaR - Parallel with EPS 2017-08-22 (complete)4285794SAT (TO)28 1923.28 252.158
OscaR - Parallel with EPS 2017-07-26 (complete)4257037SAT (TO)30 1921.11 252.242
sat4j-CSP 2017-07-05 (complete)4258031? (TO) 256.02701 93.370796

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: 26
Solution found:
<instantiation type='solution' cost='26'> <list>x[0] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[10] x[110]
x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[11] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129]
x[12] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[13] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147]
x[148] x[149] x[14] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[15] x[160] x[161] x[162] x[163] x[164] x[165]
x[166] x[167] x[168] x[169] x[16] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[17] x[180] x[181] x[182] x[183]
x[184] x[185] x[186] x[187] x[188] x[189] x[18] x[190] x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[19] x[1] x[200]
x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208] x[209] x[20] x[210] x[211] x[212] x[213] x[214] x[215] x[216] x[217] x[218] x[219]
x[21] x[220] x[221] x[222] x[223] x[224] x[225] x[226] x[227] x[228] x[229] x[22] x[230] x[231] x[232] x[233] x[234] x[235] x[236] x[237]
x[238] x[239] x[23] x[240] x[241] x[242] x[243] x[244] x[245] x[246] x[247] x[248] x[249] x[24] x[250] x[251] x[252] x[253] x[254] x[255]
x[256] x[257] x[258] x[259] x[25] x[260] x[261] x[262] x[263] x[264] x[265] x[266] x[267] x[268] x[269] x[26] x[270] x[271] x[272] x[273]
x[274] x[275] x[276] x[277] x[278] x[279] x[27] x[280] x[281] x[282] x[283] x[284] x[285] x[286] x[287] x[288] x[289] x[28] x[290] x[291]
x[292] x[293] x[294] x[295] x[296] x[297] x[298] x[299] x[29] x[2] x[300] x[301] x[302] x[303] x[304] x[305] x[306] x[307] x[308] x[309]
x[30] x[310] x[311] x[312] x[313] x[314] x[315] x[316] x[317] x[318] x[319] x[31] x[320] x[321] x[322] x[323] x[324] x[325] x[326] x[327]
x[328] x[329] x[32] x[330] x[331] x[332] x[333] x[334] x[335] x[336] x[337] x[338] x[339] x[33] x[340] x[341] x[342] x[343] x[344] x[345]
x[346] x[347] x[348] x[349] x[34] x[350] x[351] x[352] x[353] x[354] x[355] x[356] x[357] x[358] x[359] x[35] x[360] x[361] x[362] x[363]
x[364] x[365] x[366] x[367] x[368] x[369] x[36] x[370] x[371] x[372] x[373] x[374] x[375] x[376] x[377] x[378] x[379] x[37] x[380] x[381]
x[382] x[383] x[384] x[385] x[386] x[387] x[388] x[389] x[38] x[390] x[391] x[392] x[393] x[394] x[395] x[396] x[397] x[398] x[399] x[39]
x[3] x[400] x[401] x[402] x[403] x[404] x[405] x[406] x[407] x[408] x[409] x[40] x[410] x[411] x[412] x[413] x[414] x[415] x[416] x[417]
x[418] x[419] x[41] x[420] x[421] x[422] x[423] x[424] x[425] x[426] x[427] x[428] x[429] x[42] x[430] x[431] x[432] x[433] x[434] x[435]
x[436] x[437] x[438] x[439] x[43] x[440] x[441] x[442] x[443] x[444] x[445] x[446] x[447] x[448] x[449] x[44] x[45] x[46] x[47] x[48] x[49]
x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[6] x[70]
x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[7] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[8] x[90] x[91]
x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[9] </list> <values>18 9 16 20 9 24 11 13 3 12 13 23 24 24 4 19 25 17 8 26 1 7 6 16 0 10 9
0 8 3 1 21 20 18 13 10 26 23 17 22 10 25 12 14 3 26 8 12 13 20 9 23 2 23 1 5 11 3 24 14 15 12 3 3 9 15 22 21 12 11 24 5 6 22 6 25 15 22 17
12 10 22 11 5 4 23 4 18 14 14 13 14 4 17 23 10 17 0 16 15 16 26 8 16 3 5 2 26 1 9 12 14 21 1 8 0 15 1 12 3 23 17 20 6 22 10 0 17 25 2 13 0 3
3 21 0 6 6 0 21 7 1 15 1 26 1 7 3 25 19 10 16 18 2 5 25 0 22 18 16 5 14 11 9 26 0 18 7 13 25 8 25 3 23 20 17 18 0 8 14 18 2 4 9 13 10 8 17
13 25 7 2 6 23 13 17 1 0 5 20 19 17 26 18 1 6 21 19 19 6 11 23 10 16 9 8 17 0 2 24 9 25 11 0 2 4 0 18 7 15 3 14 6 4 4 16 10 0 10 3 7 11 9 2
13 17 9 2 24 26 17 26 16 21 7 6 4 5 25 15 14 6 7 5 7 8 4 21 1 7 10 1 16 2 24 6 22 8 18 15 1 13 4 15 20 1 5 9 6 12 22 1 19 14 6 7 10 0 14 5
14 16 24 10 15 7 20 19 24 2 1 20 9 3 7 4 16 12 11 26 9 26 17 18 1 6 8 0 13 23 2 21 5 20 16 17 1 20 5 24 4 1 2 4 24 22 21 1 24 5 12 11 3 9 20
25 12 0 23 23 21 21 26 0 4 11 4 15 19 8 2 3 21 8 8 1 21 24 8 13 1 19 1 7 0 23 13 19 7 1 0 3 10 14 4 19 13 1 4 19 26 6 7 19 24 1 16 11 11 18
2 15 3 2 0 9 5 13 18 23 21 5 0 18 4 13 4 20 1 1 9 19 13 10 22 10 26 0 0 15 22 5 25 12 9 2 12 2 26 22 </values> </instantiation>