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

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

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j30-01-04_c18.xml
MD5SUMb6ecdc29b52a96e4336a8061885c8d68
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark62
Best CPU time to get the best result obtained on this benchmark2.03627
Satisfiable
(Un)Satisfiability was proved
Number of variables32
Number of constraints52
Number of domains2
Minimum domain size1
Maximum domain size184
Distribution of domain sizes[{"size":1,"count":1},{"size":184,"count":31}]
Minimum variable degree3
Maximum variable degree5
Distribution of variable degrees[{"degree":3,"count":14},{"degree":4,"count":5},{"degree":5,"count":13}]
Minimum constraint arity2
Maximum constraint arity13
Distribution of constraint arities[{"arity":2,"count":49},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":13,"count":1}]
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)4312665OPT62 0.093286 0.094052
Choco-solver 4.0.7b seq (e747e1e) (complete)4301897OPT62 2.03627 1.18178
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312204OPT62 2.21116 1.27651
OscaR - Hybrid 2018-08-14 (complete)4310344OPT62 2.25364 1.31864
Concrete 3.9.2 (complete)4302368OPT62 7.73727 3.85237
Concrete 3.9.2-SuperNG (complete)4302718OPT62 7.88266 3.81016
Sat4j-CSP 2018-07-11 (complete)4301898OPT62 205.407 192.665
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309994SAT62 251.763 247.377
cosoco 1.12 (complete)4301899? (NS) 0.022957 0.0240451

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: 62
Solution found:
<instantiation type="optimum" cost="62"> <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 25 0 10 3 9 17 24 24 40 34 18
3 9 33 44 34 12 43 34 24 31 24 36 33 17 40 52 52 44 62 </values> </instantiation>