2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Rcpsp/Rcpsp-m1-j30/
Rcpsp-j30-41-06.xml

Jump to solvers results

General information on the benchmark

NameRcpsp/Rcpsp-m1-j30/
Rcpsp-j30-41-06.xml
MD5SUM9c0419560fe3c6efa350d2101b8d9fdb
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark103
Best CPU time to get the best result obtained on this benchmark117.755
Satisfiable
(Un)Satisfiability was proved
Number of variables32
Number of constraints72
Number of domains2
Minimum domain size1
Maximum domain size155
Distribution of domain sizes[{"size":1,"count":1},{"size":155,"count":31}]
Minimum variable degree3
Maximum variable degree10
Distribution of variable degrees[{"degree":3,"count":1},{"degree":4,"count":1},{"degree":5,"count":1},{"degree":6,"count":3},{"degree":7,"count":16},{"degree":8,"count":5},{"degree":9,"count":4},{"degree":10,"count":1}]
Minimum constraint arity2
Maximum constraint arity26
Distribution of constraint arities[{"arity":2,"count":68},{"arity":21,"count":2},{"arity":23,"count":1},{"arity":26,"count":1}]
Number of extensional constraints0
Number of intensional constraints68
Distribution of constraint types[{"type":"intension","count":68},{"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)4395315OPT103 117.755 117.791
choco-solver 2019-09-16 (complete)4399295OPT103 397.236 100.14
choco-solver 2019-09-20 (complete)4403795OPT103 616.284 155.186
choco-solver 2019-06-14 (complete)4393335OPT103 670.777 182.782
choco-solver 2019-06-14 parallel (complete)4393935OPT103 960.763 136.316
choco-solver 2019-09-20 parallel (complete)4404695OPT103 1089.25 137.342
choco-solver 2019-09-24 parallel (complete)4407095OPT103 1187.56 149.578
choco-solver 2019-09-16 parallel (complete)4399895OPT103 1255.31 158.13
Concrete 3.12.3 (complete)4402895OPT103 1717.46 1687.33
Concrete 3.10 (complete)4387250SAT (TO)103 2520.09 2475.43
Concrete 3.12.2 (complete)4401095SAT (TO)103 2520.1 2479.24
Concrete 3.12.2 (complete)4396215SAT (TO)103 2520.14 2487.43
choco-solver 2019-09-24 (complete)4406195SAT (TO)107 2520.08 2513.12
AbsCon 2019-07-23 (complete)4390935? (exit code) 3.6513 2.4212
cosoco 2.0 (complete)4408375? (NS) 0.030157 0.0304461
cosoco 2 (complete)4389835? (NS) 0.030159 0.0304569
cosoco 2.0 (complete)4397115? (NS) 0.030629 0.030986
cosoco 2.0 parallel (complete)4409655? (NS) 0.031152 0.0316799
cosoco 2.O parallel (complete)4398395? (NS) 0.03175 0.0322689

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: 103
Solution found:
<instantiation> <list> s[]  </list> <values> 0 0 29 13 9 16 20 31 9 47 48 30 47 57 43 64 66 36 52 80 88 65 73 81 52 80 56 84 98 96 92 103  
</values> </instantiation>