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

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

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j120-01-03_c18.xml
MD5SUM23ddd46bc08a13908205cdb197974328
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark126
Best CPU time to get the best result obtained on this benchmark251.994
Satisfiable
(Un)Satisfiability was proved
Number of variables122
Number of constraints187
Number of domains2
Minimum domain size1
Maximum domain size663
Distribution of domain sizes[{"size":1,"count":1},{"size":663,"count":121}]
Minimum variable degree3
Maximum variable degree6
Distribution of variable degrees[{"degree":3,"count":50},{"degree":4,"count":27},{"degree":5,"count":41},{"degree":6,"count":4}]
Minimum constraint arity2
Maximum constraint arity40
Distribution of constraint arities[{"arity":2,"count":183},{"arity":24,"count":1},{"arity":26,"count":1},{"arity":30,"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)4312199SAT126 251.994 247.372
Mistral-2.0 2018-08-01 (complete)4312676SAT (TO)126 251.961 252.011
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309989SAT (TO)127 252.073 247.328
OscaR - Hybrid 2018-08-14 (complete)4310339SAT (TO)128 252.032 242.228
Concrete 3.9.2 (complete)4302363SAT (TO)129 252.072 238.951
Concrete 3.9.2-SuperNG (complete)4302713SAT (TO)129 252.076 238.336
Choco-solver 4.0.7b seq (e747e1e) (complete)4301930SAT (TO)130 252.054 245.515
cosoco 1.12 (complete)4301932? (NS) 0.078351 0.0790619
Sat4j-CSP 2018-07-11 (complete)4301931? (TO) 259.834 87.4423

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: 126
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 10 3 10 3 19 15 7 6 28 46 27 8 20 17 49 25
30 46 11 51 40 8 30 7 7 17 47 57 55 24 69 48 30 66 72 85 40 32 17 71 35 61 43 31 59 35 78 66 60 64 41 77 80 38 20 52 18 50 44 98 64 62 26 66
40 35 58 38 49 61 89 50 87 69 49 67 100 69 61 77 58 69 81 54 37 106 46 59 67 17 78 78 91 91 73 87 28 104 39 91 80 115 68 54 90 82 88 99 103
97 117 100 105 116 105 124 115 121 0 126 </values> </instantiation>