2019 XCSP3 competition: main track (CSP and COP, 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.28174
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)4395220OPT2 1.28174 1.28235
choco-solver 2019-09-16 (complete)4399200OPT2 1.78089 0.737949
choco-solver 2019-06-14 (complete)4393240OPT2 1.81433 0.745743
choco-solver 2019-09-20 (complete)4403700OPT2 1.8825 0.766594
choco-solver 2019-09-20 parallel (complete)4404600OPT2 2.40348 0.811412
choco-solver 2019-09-24 parallel (complete)4407000OPT2 2.46925 0.826428
choco-solver 2019-09-16 parallel (complete)4399800OPT2 2.55081 0.837244
choco-solver 2019-06-14 parallel (complete)4393840OPT2 2.56571 0.839506
choco-solver 2019-09-24 (complete)4406100OPT2 3.74741 1.81438
AbsCon 2019-07-23 (complete)4390840OPT2 3.80715 2.32012
Concrete 3.12.2 (complete)4401000OPT2 245.616 234.3
Concrete 3.12.3 (complete)4402800OPT2 352.804 340.189
cosoco 2.O parallel (complete)4398300OPT2 9039.58 1132.1
cosoco 2.0 parallel (complete)4409560OPT2 14832.4 1857.04
cosoco 2.0 (complete)4408280SAT (TO)3 2519.67 2520.01
cosoco 2.0 (complete)4397020SAT (TO)3 2520.03 2519.8
cosoco 2 (complete)4389740SAT (TO)3 2520.04 2520.01
Concrete 3.12.2 (complete)4396120SAT (TO)3 2520.06 2481.73
Concrete 3.10 (complete)4387059SAT (TO)3 2520.12 2459.93

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>