2019 XCSP3 competition: fast COP track (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 benchmark115.382
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)4395615OPT103 115.382 115.399
choco-solver 2019-09-16 (complete)4400495OPT103 649.592 163.658
choco-solver 2019-06-14 (complete)4394235OPT103 658.774 185.795
choco-solver 2019-09-20 (complete)4404095OPT103 666.972 167.904
choco-solver 2019-09-24 parallel (complete)4407395OPT103 796.116 100.507
choco-solver 2019-06-14 parallel (complete)4394535OPT103 1065.41 144.858
choco-solver 2019-09-20 parallel (complete)4404995OPT103 1141.25 143.856
choco-solver 2019-09-16 parallel (complete)4400195OPT103 1302.83 164.113
Concrete 3.12.2 (complete)4401395OPT103 1737.2 1706.87
Concrete 3.10 (complete)4392135OPT103 1982.84 1946.3
Concrete 3.12.3 (complete)4403195SAT (TO)103 2400.04 2362.15
Concrete 3.12.2 (complete)4396515SAT (TO)103 2400.13 2369.43
choco-solver 2019-09-24 (complete)4406495SAT (TO)107 2400.05 2392.61
AbsCon 2019-07-23 (complete)4391235? (exit code) 3.31802 2.17871
cosoco 2.0 (complete)4409055? (NS) 0.030258 0.0305321
cosoco 2 (complete)4390335? (NS) 0.030322 0.030615
cosoco 2.0 (complete)4397795? (NS) 0.030935 0.0312979
cosoco 2.0 parallel (complete)4409955? (NS) 0.031071 0.0316029
cosoco 2.O parallel (complete)4398695? (NS) 0.032106 0.0322231

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>