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

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

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j90-01-01_c18.xml
MD5SUMb03d0b9ec095e61c141836330b15b8e7
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark73
Best CPU time to get the best result obtained on this benchmark6.1101
Satisfiable
(Un)Satisfiability was proved
Number of variables92
Number of constraints142
Number of domains2
Minimum domain size1
Maximum domain size507
Distribution of domain sizes[{"size":1,"count":1},{"size":507,"count":91}]
Minimum variable degree3
Maximum variable degree6
Distribution of variable degrees[{"degree":3,"count":35},{"degree":4,"count":24},{"degree":5,"count":32},{"degree":6,"count":1}]
Minimum constraint arity2
Maximum constraint arity25
Distribution of constraint arities[{"arity":2,"count":138},{"arity":18,"count":1},{"arity":23,"count":1},{"arity":24,"count":1},{"arity":25,"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
Mistral-2.0 2018-08-01 (complete)4312667OPT73 5.42016 5.42202
OscaR - Hybrid 2018-08-14 (complete)4310349OPT73 6.1101 2.80424
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312209OPT73 7.5036 3.71048
Concrete 3.9.2-SuperNG (complete)4302723OPT73 13.5632 5.62259
Choco-solver 4.0.7b seq (e747e1e) (complete)4301903OPT73 14.5207 7.53594
Concrete 3.9.2 (complete)4302373OPT73 17.0657 8.33048
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309999SAT (TO)73 252.109 245.038
cosoco 1.12 (complete)4301905? (NS) 0.061715 0.062614
Sat4j-CSP 2018-07-11 (complete)4301904? (TO) 259.906 89.6509

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: 73
Solution found:
<instantiation type="optimum" cost="73"> <list> s[0] 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] </list> <values> 0 0 0 0 1 1 11 40 21 3 8 16 4 19 11 20 30 18 10 20 27 11 21 8 30 11 34 23 28 3 14 34 23
33 19 18 16 36 18 26 33 46 30 40 19 20 34 33 42 54 44 30 52 40 30 23 41 42 48 33 40 43 33 51 43 39 14 48 46 45 46 52 48 44 56 58 53 60 53 60
55 61 61 68 51 60 62 70 71 53 70 73 </values> </instantiation>