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

Result page for benchmark
Opd/Opd-sum-small/
Opd-11-011-005.xml

Jump to solvers results

General information on the benchmark

NameOpd/Opd-sum-small/
Opd-11-011-005.xml
MD5SUM7a6a01f2d694ae1725dbabce720210ef
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark2
Best CPU time to get the best result obtained on this benchmark1.31481
Satisfiable
(Un)Satisfiability was proved
Number of variables122
Number of constraints67
Number of domains2
Minimum domain size2
Maximum domain size10
Distribution of domain sizes[{"size":2,"count":121},{"size":10,"count":1}]
Minimum variable degree12
Maximum variable degree56
Distribution of variable degrees[{"degree":12,"count":121},{"degree":56,"count":1}]
Minimum constraint arity11
Maximum constraint arity121
Distribution of constraint arities[{"arity":11,"count":11},{"arity":23,"count":55},{"arity":121,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"lex","count":1},{"type":"sum","count":66}]
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)4395520OPT2 1.31481 1.3201
choco-solver 2019-06-14 (complete)4394140OPT2 1.71171 0.734057
choco-solver 2019-09-16 (complete)4400400OPT2 1.75826 1.18908
choco-solver 2019-09-20 (complete)4404000OPT2 1.835 1.01025
choco-solver 2019-09-24 parallel (complete)4407300OPT2 2.49541 0.821284
choco-solver 2019-09-16 parallel (complete)4400100OPT2 2.59725 0.840674
choco-solver 2019-09-20 parallel (complete)4404900OPT2 2.76186 0.987447
choco-solver 2019-06-14 parallel (complete)4394440OPT2 2.76858 0.862795
AbsCon 2019-07-23 (complete)4391140OPT2 3.90003 2.34552
choco-solver 2019-09-24 (complete)4406400OPT2 3.96388 1.82495
Concrete 3.12.2 (complete)4396420OPT2 172.14 160.564
Concrete 3.10 (complete)4392040OPT2 335.862 313.278
cosoco 2.0 parallel (complete)4409860SAT (TO)3 2011.7 252.021
cosoco 2.O parallel (complete)4398600SAT (TO)3 2011.79 252.022
cosoco 2.0 (complete)4397700SAT (TO)3 2400.01 2400.2
cosoco 2.0 (complete)4408960SAT (TO)3 2400.04 2400.11
cosoco 2 (complete)4390240SAT (TO)3 2400.04 2399.9
Concrete 3.12.2 (complete)4401300SAT (TO)3 2400.07 2355.24
Concrete 3.12.3 (complete)4403100SAT (TO)3 2400.09 2354.53

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: 2
Solution found:
<instantiation> <list> z x[][]  </list> <values> 2  0 0 0 0 0 0 1 1 1 1 1 0 0 0 1 1 1 0 0 0 1 1 0 0 1 0 1 1 0 1 1 0 0 0 1 0 1 0 1 1 0 1 0 0
0 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 1 0 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 0 1 0 1 1 1 0 0 0 1 0 1 0 0 1 1 1 0 0
1 0 0 0 1 1 0   </values> </instantiation>