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

Result page for benchmark
GraphColoring/GraphColoring-m1-mono/
GraphColoring-zeroin-i-3.xml

Jump to solvers results

General information on the benchmark

NameGraphColoring/GraphColoring-m1-mono/
GraphColoring-zeroin-i-3.xml
MD5SUM21f5a9a53520a21a30dcca8a12a0310e
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark29
Best CPU time to get the best result obtained on this benchmark23.614
Satisfiable
(Un)Satisfiability was proved
Number of variables206
Number of constraints3540
Number of domains1
Minimum domain size206
Maximum domain size206
Distribution of domain sizes[{"size":206,"count":206}]
Minimum variable degree1
Maximum variable degree141
Distribution of variable degrees[{"degree":1,"count":49},{"degree":18,"count":4},{"degree":19,"count":6},{"degree":20,"count":3},{"degree":21,"count":1},{"degree":22,"count":1},{"degree":23,"count":2},{"degree":24,"count":2},{"degree":25,"count":1},{"degree":26,"count":1},{"degree":27,"count":5},{"degree":28,"count":16},{"degree":29,"count":18},{"degree":30,"count":13},{"degree":31,"count":12},{"degree":32,"count":10},{"degree":33,"count":5},{"degree":34,"count":2},{"degree":35,"count":3},{"degree":36,"count":2},{"degree":37,"count":4},{"degree":38,"count":3},{"degree":39,"count":1},{"degree":41,"count":6},{"degree":42,"count":2},{"degree":43,"count":2},{"degree":44,"count":1},{"degree":45,"count":1},{"degree":47,"count":1},{"degree":49,"count":1},{"degree":64,"count":1},{"degree":67,"count":1},{"degree":79,"count":1},{"degree":81,"count":1},{"degree":96,"count":2},{"degree":100,"count":3},{"degree":115,"count":1},{"degree":122,"count":1},{"degree":124,"count":1},{"degree":126,"count":1},{"degree":128,"count":1},{"degree":130,"count":1},{"degree":131,"count":1},{"degree":132,"count":1},{"degree":134,"count":1},{"degree":135,"count":1},{"degree":136,"count":5},{"degree":141,"count":4}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":3540}]
Number of extensional constraints0
Number of intensional constraints3540
Distribution of constraint types[{"type":"intension","count":3540}]
Optimization problemYES
Type of objectivemin MAXIMUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Concrete 3.4 (complete)4259527OPT29 23.614 11.358
cosoco-sat 1.12 (complete)4266708SAT (TO)29 240.01199 240.011
AbsCon-basic 2017-06-11 (complete)4257539SAT (TO)29 243.089 240.01199
choco-solver 4.0.5 seq (2017-08-18) (complete)4282859SAT (TO)29 243.444 240.019
choco-solver 4.0.5 seq (2017-08-09) (complete)4270109SAT (TO)29 243.536 240.022
choco-solver 4.0.5 seq (2017-07-26) (complete)4254060SAT (TO)29 243.75999 240.00999
choco-solver 5a (2017-08-18) (complete)4284329SAT (TO)29 246.28999 240.028
choco-solver 5a (2017-07-26) (complete)4255054SAT (TO)29 246.73 240.00999
OscaR - ALNS 2017-07-26 (complete)4255551SAT (TO)29 250.702 240.034
OscaR - Hybrid 2017-07-26 (complete)4256545SAT (TO)29 251.689 240.02699
cosoco 1.12 (complete)4268639SAT (TO)29 251.927 252.009
Mistral-2.0 2017-07-28 (complete)4259030SAT (TO)29 251.94299 252.00999
cosoco 1.1 (complete)4258533SAT (TO)29 252.03999 252.00999
choco-solver 4.0.5 par (2017-07-26) (complete)4254557SAT (TO)29 1920.13 241.936
OscaR - Parallel with EPS 2017-07-26 (complete)4257042SAT (TO)29 1921.46 244.425
OscaR - Parallel with EPS 2017-08-22 (complete)4285799SAT (TO)29 1983.09 252.172
choco-solver 4.0.5 par (2017-08-18) (complete)4281389SAT (TO)29 2002.53 252.101
choco-solver 4.0.5 par (2017-08-09) (complete)4271579SAT (TO)29 2003.9 252.10699
OscaR - Conflict Ordering 2017-07-26 (complete)4256048SAT (TO)30 245.69099 240.02699
sat4j-CSP 2017-07-05 (complete)4258036? (TO) 260.30399 89.373299

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