2018 XCSP3 competition: sequential solvers tracks: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

NameSumColoring/
SumColoring-dsjc-125-5_c18.xml
MD5SUM08115146c0ac9b7e4849c5cb62d96e41
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark1014
Best CPU time to get the best result obtained on this benchmark2520.1
Satisfiable
(Un)Satisfiability was proved
Number of variables125
Number of constraints3891
Number of domains1
Minimum domain size125
Maximum domain size125
Distribution of domain sizes[{"size":125,"count":125}]
Minimum variable degree52
Maximum variable degree76
Distribution of variable degrees[{"degree":52,"count":2},{"degree":54,"count":3},{"degree":55,"count":3},{"degree":56,"count":4},{"degree":57,"count":7},{"degree":58,"count":6},{"degree":59,"count":7},{"degree":60,"count":6},{"degree":61,"count":12},{"degree":62,"count":11},{"degree":63,"count":6},{"degree":64,"count":7},{"degree":65,"count":11},{"degree":66,"count":6},{"degree":67,"count":4},{"degree":68,"count":8},{"degree":69,"count":6},{"degree":70,"count":5},{"degree":71,"count":2},{"degree":72,"count":2},{"degree":73,"count":2},{"degree":74,"count":3},{"degree":75,"count":1},{"degree":76,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":3891}]
Number of extensional constraints0
Number of intensional constraints3891
Distribution of constraint types[{"type":"intension","count":3891}]
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)4308590SAT (TO)1014 2520.1 2452.82
OscaR - Hybrid 2018-07-02 (complete)4291658SAT (TO)1046 2400.06 2344.62
Mistral-2.0 2018-06-15 (complete)4289370SAT (TO)1060 2400.08 2399.9
Mistral-2.0 2018-08-01 (complete)4303772SAT (TO)1060 2519.99 2520.01
Choco-solver 4.0.7 seq (493a269) (complete)4292416SAT (TO)1078 2400.07 2389.32
Choco-solver 4.0.7b seq (e747e1e) (complete)4306710SAT (TO)1078 2520.07 2509.21
cosoco 1.12 (complete)4293690SAT (TO)1123 2520.06 2520.01
Sat4j-CSP 2018-07-11 (complete)4289973SAT (TO)1337 2400.37 2200.78
Concrete 3.8-SuperNG 2018-06-13 (complete)4293689SAT (TO)1469 2520.06 2492.53
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4308004SAT (TO)1508 2520.11 2499.52
Concrete 3.8 2018-06-13 (complete)4293688SAT (TO)1571 2520.08 2491.93
Concrete 3.9.2-SuperNG (complete)4304376SAT (TO)1658 2520.07 2490.83
Concrete 3.9.2 (complete)4304375SAT (TO)1697 2520.12 2492.75
OscaR - Conflict Ordering with restarts 2018-07-02 (complete)4290460SAT (TO)1708 2400.03 2381.03
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4311740SAT (TO)3042 2520.06 2500.03
PicatSAT 2018-06-15 (complete)4293691? (TO) 2519.86 2520.02
PicatSAT 2018-08-02 (complete)4303186? (TO) 2520.02 2520.02
PicatSAT 2018-08-14 (complete)4309526? (TO) 2520.07 2520.03

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: 1014
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> 9 6 7 14 10 17 16 2 2 19
7 13 3 5 12 13 18 10 2 14 1 4 15 17 12 7 4 20 0 16 3 5 18 3 13 14 8 6 17 17 6 1 0 2 12 4 6 16 13 12 3 15 10 14 16 7 8 12 8 8 11 2 2 0 9 8 4
2 5 9 3 7 0 9 9 5 0 11 15 10 4 5 6 8 5 8 0 6 2 0 14 7 4 13 10 5 3 0 11 15 12 12 16 11 3 14 1 11 14 6 1 1 10 13 7 5 6 3 1 11 1 5 18 4 9
</values> </instantiation>