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

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

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-dsjc-250-1_c18.xml
MD5SUM23e20eff05b11a5b5f7472de7de36ab3
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark853
Best CPU time to get the best result obtained on this benchmark252.09
Satisfiable
(Un)Satisfiability was proved
Number of variables250
Number of constraints3218
Number of domains1
Minimum domain size250
Maximum domain size250
Distribution of domain sizes[{"size":250,"count":250}]
Minimum variable degree14
Maximum variable degree39
Distribution of variable degrees[{"degree":14,"count":1},{"degree":15,"count":1},{"degree":16,"count":3},{"degree":17,"count":5},{"degree":18,"count":6},{"degree":19,"count":5},{"degree":20,"count":6},{"degree":21,"count":11},{"degree":22,"count":14},{"degree":23,"count":16},{"degree":24,"count":14},{"degree":25,"count":25},{"degree":26,"count":17},{"degree":27,"count":14},{"degree":28,"count":12},{"degree":29,"count":25},{"degree":30,"count":21},{"degree":31,"count":11},{"degree":32,"count":9},{"degree":33,"count":9},{"degree":34,"count":4},{"degree":35,"count":6},{"degree":36,"count":9},{"degree":37,"count":3},{"degree":38,"count":2},{"degree":39,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":3218}]
Number of extensional constraints0
Number of intensional constraints3218
Distribution of constraint types[{"type":"intension","count":3218}]
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)4310464SAT (TO)853 252.09 239.032
Choco-solver 4.0.7b seq (e747e1e) (complete)4301564SAT (TO)925 252.112 247.813
cosoco 1.12 (complete)4301566SAT (TO)928 251.998 252.01
Mistral-2.0 2018-08-01 (complete)4312554SAT (TO)1036 251.967 252.01
Concrete 3.9.2-SuperNG (complete)4302838SAT (TO)2951 252.089 235.151
Concrete 3.9.2 (complete)4302488SAT (TO)3308 252.147 236.952
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312324SAT (TO)13489 252.058 245.129
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310114SAT (TO)13499 252.056 245.029
Sat4j-CSP 2018-07-11 (complete)4301565? (TO) 259.877 88.0487

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: 853
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]
c[191] c[192] c[193] c[194] c[195] c[196] c[197] c[198] c[199] c[200] c[201] c[202] c[203] c[204] c[205] c[206] c[207] c[208] c[209] c[210]
c[211] c[212] c[213] c[214] c[215] c[216] c[217] c[218] c[219] c[220] c[221] c[222] c[223] c[224] c[225] c[226] c[227] c[228] c[229] c[230]
c[231] c[232] c[233] c[234] c[235] c[236] c[237] c[238] c[239] c[240] c[241] c[242] c[243] c[244] c[245] c[246] c[247] c[248] c[249] </list>
<values> 9 3 1 2 2 4 4 7 5 4 3 2 9 7 0 2 4 2 1 4 1 0 3 0 5 2 6 7 4 7 3 8 1 0 8 7 2 3 8 6 1 0 3 2 6 1 0 5 2 3 2 8 1 1 1 3 4 8 0 2 5 6 7 4 8 4
1 4 6 6 3 5 5 6 6 1 1 0 1 6 5 6 7 6 4 1 8 4 2 3 8 6 3 6 3 2 3 5 5 0 6 0 4 0 4 1 0 3 8 4 2 3 0 0 1 1 7 8 1 0 5 3 2 8 6 5 1 6 5 0 2 7 0 5 0 5
2 4 0 0 3 3 6 6 5 3 0 1 4 3 4 7 2 5 1 7 5 0 2 7 6 6 3 0 0 9 3 4 5 0 6 7 3 7 2 1 0 3 5 3 0 3 1 2 1 1 2 0 4 1 0 2 1 2 0 1 2 5 8 5 1 4 7 3 9 5
4 4 3 7 0 1 2 8 5 0 2 6 2 3 2 2 2 5 7 3 1 2 0 1 2 2 0 8 8 5 3 4 3 6 4 0 0 0 1 2 4 4 7 1 </values> </instantiation>