2019 XCSP3 competition: fast COP track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Rcpsp/Rcpsp-m1-j60/
Rcpsp-j60-21-05.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/Rcpsp-m1-j60/
Rcpsp-j60-21-05.xml
MD5SUM42feabc1334beaea3bf22cfd312dd4ae
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark89
Best CPU time to get the best result obtained on this benchmark306.205
Satisfiable
(Un)Satisfiability was proved
Number of variables62
Number of constraints116
Number of domains2
Minimum domain size1
Maximum domain size327
Distribution of domain sizes[{"size":1,"count":1},{"size":327,"count":61}]
Minimum variable degree3
Maximum variable degree8
Distribution of variable degrees[{"degree":3,"count":4},{"degree":4,"count":11},{"degree":5,"count":14},{"degree":6,"count":16},{"degree":7,"count":12},{"degree":8,"count":5}]
Minimum constraint arity2
Maximum constraint arity32
Distribution of constraint arities[{"arity":2,"count":112},{"arity":28,"count":1},{"arity":29,"count":1},{"arity":32,"count":2}]
Number of extensional constraints0
Number of intensional constraints112
Distribution of constraint types[{"type":"intension","count":112},{"type":"cumulative","count":4}]
Optimization problemYES
Type of objectivemin VAR

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395612OPT89 306.205 306.215
choco-solver 2019-09-20 (complete)4404092OPT89 408.978 103.11
choco-solver 2019-09-16 (complete)4400492OPT89 584.003 147.083
choco-solver 2019-06-14 parallel (complete)4394532OPT89 732.409 92.8001
choco-solver 2019-06-14 (complete)4394232OPT89 883.66 271.723
choco-solver 2019-09-24 parallel (complete)4407392OPT89 1150.7 144.975
choco-solver 2019-09-20 parallel (complete)4404992OPT89 1231.64 155.305
choco-solver 2019-09-16 parallel (complete)4400192SAT (TO)89 2004.15 252.101
Concrete 3.12.3 (complete)4403192SAT (TO)89 2400.05 2361.14
Concrete 3.12.2 (complete)4401392SAT (TO)89 2400.07 2359.64
choco-solver 2019-09-24 (complete)4406492SAT (TO)89 2400.09 2392.22
Concrete 3.10 (complete)4392132SAT (TO)89 2400.1 2358.63
Concrete 3.12.2 (complete)4396512SAT (TO)90 2400.09 2370.03
AbsCon 2019-07-23 (complete)4391232? (exit code) 3.52137 2.29188
cosoco 2 (complete)4390332? (NS) 0.046568 0.046967
cosoco 2.0 (complete)4409052? (NS) 0.046947 0.0472041
cosoco 2.0 (complete)4397792? (NS) 0.04891 0.049177
cosoco 2.0 parallel (complete)4409952? (NS) 0.049129 0.04979
cosoco 2.O parallel (complete)4398692? (NS) 0.050292 0.050724

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: 89
Solution found:
<instantiation> <list> s[]  </list> <values> 0 0 0 0 2 14 10 10 4 13 32 20 13 8 42 79 31 12 23 21 10 52 40 27 20 30 21 38 34 21 30 43 40 27
35 65 48 50 22 49 53 57 64 50 64 42 50 49 27 54 55 72 64 66 70 74 77 77 81 82 68 89   </values> </instantiation>