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

Result page for benchmark
Rcpsp/
Rcpsp-j120-01-02_c18.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j120-01-02_c18.xml
MD5SUM9e298a48575be159e0b6ad4a2fcf836a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark109
Best CPU time to get the best result obtained on this benchmark153.124
Satisfiable
(Un)Satisfiability was proved
Number of variables122
Number of constraints187
Number of domains2
Minimum domain size1
Maximum domain size642
Distribution of domain sizes[{"size":1,"count":1},{"size":642,"count":121}]
Minimum variable degree3
Maximum variable degree6
Distribution of variable degrees[{"degree":3,"count":45},{"degree":4,"count":34},{"degree":5,"count":42},{"degree":6,"count":1}]
Minimum constraint arity2
Maximum constraint arity40
Distribution of constraint arities[{"arity":2,"count":183},{"arity":22,"count":1},{"arity":27,"count":1},{"arity":31,"count":1},{"arity":40,"count":1}]
Number of extensional constraints0
Number of intensional constraints183
Distribution of constraint types[{"type":"intension","count":183},{"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 - Conflict Ordering with restarts 2018-08-17 (complete)4312198OPT109 153.124 149.129
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309988SAT (TO)109 252.06 246.726
Mistral-2.0 2018-08-01 (complete)4312670SAT (TO)111 251.973 252.011
OscaR - Hybrid 2018-08-14 (complete)4310338SAT (TO)111 252.079 243.337
Concrete 3.9.2 (complete)4302362SAT (TO)111 252.129 239.936
Concrete 3.9.2-SuperNG (complete)4302712SAT (TO)113 252.051 238.436
Choco-solver 4.0.7b seq (e747e1e) (complete)4301912SAT (TO)114 252.067 244.715
cosoco 1.12 (complete)4301914? (NS) 0.076564 0.0775219
Sat4j-CSP 2018-07-11 (complete)4301913? (TO) 259.797 86.5489

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: 109
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[91] s[92] s[93] s[94] s[95] s[96] s[97] s[98] s[99] s[100] s[101] s[102] s[103] s[104] s[105] s[106] s[107] s[108] s[109] s[110] s[111]
s[112] s[113] s[114] s[115] s[116] s[117] s[118] s[119] s[120] s[0] s[121] </list> <values> 0 0 0 1 19 6 2 21 6 27 14 7 16 14 30 35 10 14 16
42 7 21 40 5 50 38 53 2 25 17 21 65 33 30 44 36 30 32 63 71 16 24 33 56 95 52 30 74 47 53 26 42 40 23 74 62 82 43 56 49 5 69 73 58 87 30 27
17 56 53 42 71 63 85 53 57 43 44 67 69 25 44 43 57 80 63 67 74 78 78 64 78 69 65 73 100 96 74 87 86 102 89 80 86 77 60 82 80 84 93 91 88 90
85 92 91 101 106 104 101 0 109 </values> </instantiation>