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

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

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-dsjc-125-1_c18.xml
MD5SUMe8035d4b0abecbc1a78dd1ff35d13fe4
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark233
Best CPU time to get the best result obtained on this benchmark252.035
Satisfiable
(Un)Satisfiability was proved
Number of variables125
Number of constraints736
Number of domains1
Minimum domain size125
Maximum domain size125
Distribution of domain sizes[{"size":125,"count":125}]
Minimum variable degree6
Maximum variable degree24
Distribution of variable degrees[{"degree":6,"count":1},{"degree":7,"count":3},{"degree":8,"count":5},{"degree":9,"count":12},{"degree":10,"count":12},{"degree":11,"count":16},{"degree":12,"count":12},{"degree":13,"count":16},{"degree":14,"count":15},{"degree":15,"count":7},{"degree":16,"count":8},{"degree":17,"count":9},{"degree":18,"count":1},{"degree":19,"count":4},{"degree":20,"count":3},{"degree":24,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":736}]
Number of extensional constraints0
Number of intensional constraints736
Distribution of constraint types[{"type":"intension","count":736}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Choco-solver 4.0.7b seq (e747e1e) (complete)4301552SAT (TO)233 252.035 248.613
OscaR - Hybrid 2018-08-14 (complete)4310461SAT (TO)236 252.123 241.665
cosoco 1.12 (complete)4301554SAT (TO)241 252.007 252.01
Sat4j-CSP 2018-07-11 (complete)4301553SAT (TO)247 252.26 237.625
Mistral-2.0 2018-08-01 (complete)4312550SAT (TO)268 252.009 252.01
Concrete 3.9.2 (complete)4302485SAT (TO)522 252.143 234.158
Concrete 3.9.2-SuperNG (complete)4302835SAT (TO)641 252.109 239.635
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312321SAT1003 251.854 247.366
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310111SAT (TO)1485 252.031 247.316

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: 233
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>3 3 0 0 5 5 1 1 1 0 2 0 4
0 3 3 0 1 3 3 0 4 1 5 1 0 4 2 0 0 1 4 1 1 1 0 0 2 2 4 5 4 2 2 4 2 1 1 3 2 2 5 1 3 0 3 3 2 1 1 4 2 3 1 4 4 3 0 2 3 0 1 3 3 3 3 3 0 1 2 4 1 1
2 2 2 4 1 0 0 3 1 2 1 0 0 1 2 5 3 0 1 3 0 5 0 0 0 0 4 0 1 2 0 5 1 4 1 3 0 0 3 0 2 0 </values> </instantiation>