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

Result page for benchmark
Rcpsp/
Rcpsp-j90-01-04_c18.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j90-01-04_c18.xml
MD5SUM0eb6d6735b5266ca4e96e7e1d1b2460a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark86
Best CPU time to get the best result obtained on this benchmark6.48244
Satisfiable
(Un)Satisfiability was proved
Number of variables92
Number of constraints142
Number of domains2
Minimum domain size1
Maximum domain size493
Distribution of domain sizes[{"size":1,"count":1},{"size":493,"count":91}]
Minimum variable degree3
Maximum variable degree6
Distribution of variable degrees[{"degree":3,"count":36},{"degree":4,"count":23},{"degree":5,"count":31},{"degree":6,"count":2}]
Minimum constraint arity2
Maximum constraint arity32
Distribution of constraint arities[{"arity":2,"count":138},{"arity":18,"count":2},{"arity":22,"count":1},{"arity":32,"count":1}]
Number of extensional constraints0
Number of intensional constraints138
Distribution of constraint types[{"type":"intension","count":138},{"type":"cumulative","count":4}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
OscaR - Hybrid 2018-08-14 (complete)4310352OPT86 6.48244 2.95852
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312212OPT86 7.80968 3.33824
Mistral-2.0 2018-08-01 (complete)4312679OPT86 16.6813 16.6836
Concrete 3.9.2 (complete)4302376OPT86 52.1585 42.2513
Concrete 3.9.2-SuperNG (complete)4302726OPT86 95.9426 84.8575
Choco-solver 4.0.7b seq (e747e1e) (complete)4301939SAT (TO)86 252.036 246.02
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310002SAT (TO)86 252.087 244.728
cosoco 1.12 (complete)4301941? (NS) 0.05903 0.0602
Sat4j-CSP 2018-07-11 (complete)4301940? (TO) 260.014 89.4484

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: 86
Solution found:
<instantiation> <list> s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[20] s[21]
s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] s[30] s[31] s[32] s[33] s[34] s[35] s[36] s[37] s[38] s[39] s[40] s[41] s[42] s[43] s[44]
s[45] s[46] s[47] s[48] s[49] s[50] s[51] s[52] s[53] s[54] s[55] s[56] s[57] s[58] s[59] s[60] s[61] s[62] s[63] s[64] s[65] s[66] s[67]
s[68] s[69] s[70] s[71] s[72] s[73] s[74] s[75] s[76] s[77] s[78] s[79] s[80] s[81] s[82] s[83] s[84] s[85] s[86] s[87] s[88] s[89] s[90]
s[0] s[91] </list> <values> 26 0 0 6 44 5 36 17 13 11 21 22 21 7 13 18 24 43 6 30 31 41 14 21 33 50 20 22 33 31 47 57 40 48 60 25 76 43 50
38 70 22 62 56 46 37 46 24 53 37 45 27 12 50 57 48 48 61 51 45 53 64 61 64 25 63 66 58 43 63 58 54 41 37 28 58 66 52 55 62 70 69 58 64 70 74
74 79 78 82 0 86 </values> </instantiation>