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

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

Jump to solvers results

General information on the benchmark

NameRcpsp/
Rcpsp-j30-01-02_c18.xml
MD5SUM89f30685fe777f1ae52e0ef342afd904
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark47
Best CPU time to get the best result obtained on this benchmark1.19273
Satisfiable
(Un)Satisfiability was proved
Number of variables32
Number of constraints52
Number of domains2
Minimum domain size1
Maximum domain size160
Distribution of domain sizes[{"size":1,"count":1},{"size":160,"count":31}]
Minimum variable degree3
Maximum variable degree5
Distribution of variable degrees[{"degree":3,"count":12},{"degree":4,"count":9},{"degree":5,"count":11}]
Minimum constraint arity2
Maximum constraint arity9
Distribution of constraint arities[{"arity":2,"count":48},{"arity":6,"count":1},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":9,"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)4312668OPT47 0.080104 0.0812621
Choco-solver 4.0.7b seq (e747e1e) (complete)4301906OPT47 1.19273 0.599657
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312202OPT47 2.04156 1.22888
OscaR - Hybrid 2018-08-14 (complete)4310342OPT47 2.35623 1.32685
Concrete 3.9.2-SuperNG (complete)4302716OPT47 7.55478 3.68867
Concrete 3.9.2 (complete)4302366OPT47 7.62686 3.72018
Sat4j-CSP 2018-07-11 (complete)4301907OPT47 66.9205 55.7427
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309992SAT47 251.949 247.369
cosoco 1.12 (complete)4301908? (NS) 0.023145 0.0241209

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: 47
Solution found:
<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 11 7 18 10 2 13 7 14
23 27 14 13 24 14 25 31 7 33 31 25 24 33 35 33 39 35 47 </values> </instantiation>