Name | Rcpsp/ Rcpsp-j30-01-03_c18.xml |
MD5SUM | 8a13baf19e90b4c1b4d6531a9d16222f |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 47 |
Best CPU time to get the best result obtained on this benchmark | 1.33774 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 32 |
Number of constraints | 52 |
Number of domains | 2 |
Minimum domain size | 1 |
Maximum domain size | 141 |
Distribution of domain sizes | [{"size":1,"count":1},{"size":141,"count":31}] |
Minimum variable degree | 3 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":3,"count":11},{"degree":4,"count":11},{"degree":5,"count":10}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 8 |
Distribution of constraint arities | [{"arity":2,"count":48},{"arity":6,"count":1},{"arity":8,"count":3}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 48 |
Distribution of constraint types | [{"type":"intension","count":48},{"type":"cumulative","count":4}] |
Optimization problem | YES |
Type of objective | min VAR |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Mistral-2.0 2018-08-01 (complete) | 4312669 | OPT | 47 | 0.067213 | 0.068033 |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301909 | OPT | 47 | 1.33774 | 0.643712 |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312203 | OPT | 47 | 2.06315 | 1.22847 |
OscaR - Hybrid 2018-08-14 (complete) | 4310343 | OPT | 47 | 2.19443 | 1.25467 |
Concrete 3.9.2 (complete) | 4302367 | OPT | 47 | 7.98971 | 3.85634 |
Concrete 3.9.2-SuperNG (complete) | 4302717 | OPT | 47 | 8.36212 | 4.32248 |
Sat4j-CSP 2018-07-11 (complete) | 4301910 | OPT | 47 | 44.2693 | 35.6307 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309993 | SAT | 47 | 251.855 | 247.369 |
cosoco 1.12 (complete) | 4301911 | ? (NS) | 0.022889 | 0.0240169 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 47<instantiation type="optimum" cost="47"> <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] </list> <values> 0 0 0 0 10 1 1 5 5 17 13 5 16 10 6 28 21 10 13 1 20 36 13 23 38 42 27 28 45 45 36 47 </values> </instantiation>