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

Result page for benchmark
Opd/Opd-sum-small/
Opd-19-020-009.xml

Jump to solvers results

General information on the benchmark

NameOpd/Opd-sum-small/
Opd-19-020-009.xml
MD5SUM62ee24bcba75d1d33fbbd4bb45a854a0
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark4
Best CPU time to get the best result obtained on this benchmark1381.62
Satisfiable
(Un)Satisfiability was proved
Number of variables381
Number of constraints191
Number of domains2
Minimum domain size2
Maximum domain size17
Distribution of domain sizes[{"size":2,"count":380},{"size":17,"count":1}]
Minimum variable degree20
Maximum variable degree172
Distribution of variable degrees[{"degree":20,"count":380},{"degree":172,"count":1}]
Minimum constraint arity20
Maximum constraint arity380
Distribution of constraint arities[{"arity":20,"count":19},{"arity":41,"count":171},{"arity":380,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"lex","count":1},{"type":"sum","count":190}]
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)4395704OPT4 1381.62 1381.71
choco-solver 2019-09-16 parallel (complete)4400284SAT (TO)5 2005.59 252.103
choco-solver 2019-09-20 parallel (complete)4405084SAT (TO)5 2005.62 252.1
choco-solver 2019-09-24 parallel (complete)4407484SAT (TO)5 2005.73 252.116
Concrete 3.12.3 (complete)4403284SAT (TO)5 2400.04 2345.43
choco-solver 2019-09-24 (complete)4406584SAT (TO)5 2400.05 2392.32
AbsCon 2019-07-23 (complete)4391324SAT (TO)5 2400.09 2395.12
Concrete 3.12.2 (complete)4396604SAT (TO)5 2400.09 2355.04
Concrete 3.12.2 (complete)4401484SAT (TO)5 2400.11 2347.93
Concrete 3.10 (complete)4392224SAT (TO)5 2400.14 2338.05
choco-solver 2019-09-20 (complete)4404184SAT (TO)5 2400.36 603.191
choco-solver 2019-09-16 (complete)4400584SAT (TO)5 2400.37 603.374
choco-solver 2019-06-14 (complete)4394324SAT (TO)5 2400.64 604.798
choco-solver 2019-06-14 parallel (complete)4394624SAT (TO)5 20072.7 2520.1
cosoco 2.0 (complete)4397884? (MO) 1114.63 1116.68
cosoco 2 (complete)4390424? (MO) 1117.74 1119.82
cosoco 2.0 (complete)4409144? (MO) 1296.65 1298.73
cosoco 2.0 parallel (complete)4410044? (TO) 252.406 254.197
cosoco 2.O parallel (complete)4398784? (TO) 252.437 254.176

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