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

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

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j30-01-01_c18.xml
MD5SUMa355aea041a776e2482d6f32cb7a537a
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark43
Best CPU time to get the best result obtained on this benchmark1.29328
Satisfiable
(Un)Satisfiability was proved
Number of variables32
Number of constraints52
Number of domains2
Minimum domain size1
Maximum domain size158
Distribution of domain sizes[{"size":1,"count":1},{"size":158,"count":31}]
Minimum variable degree3
Maximum variable degree6
Distribution of variable degrees[{"degree":3,"count":10},{"degree":4,"count":14},{"degree":5,"count":7},{"degree":6,"count":1}]
Minimum constraint arity2
Maximum constraint arity10
Distribution of constraint arities[{"arity":2,"count":49},{"arity":8,"count":1},{"arity":10,"count":2}]
Number of extensional constraints0
Number of intensional constraints48
Distribution of constraint types[{"type":"intension","count":48},{"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)4312664OPT43 0.080152 0.081155
Choco-solver 4.0.7b seq (e747e1e) (complete)4301894OPT43 1.29328 0.619415
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312201OPT43 2.136 1.25573
OscaR - Hybrid 2018-08-14 (complete)4310341OPT43 2.29131 1.31037
Concrete 3.9.2 (complete)4302365OPT43 7.68855 3.90271
Concrete 3.9.2-SuperNG (complete)4302715OPT43 8.07512 3.88592
Sat4j-CSP 2018-07-11 (complete)4301895OPT43 50.3681 41.6625
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309991SAT43 251.79 247.365
cosoco 1.12 (complete)4301896? (NS) 0.022808 0.024526

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: 43
Solution found:
<instantiation type="optimum" cost="43"> <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 8 0 0 10 31 8 4 6 6 16 13 4 15
16 13 23 10 13 25 29 29 36 38 32 25 15 32 18 41 35 43 </values> </instantiation>