2019 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
PseudoBoolean/PseudoBoolean-opt-mps/
Pb-mps-v2-20-10-p0040.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-opt-mps/
Pb-mps-v2-20-10-p0040.xml
MD5SUM1df45f623f00e03c25ba1b3396194e1d
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark62027
Best CPU time to get the best result obtained on this benchmark11.2144
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints23
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":40}]
Minimum variable degree3
Maximum variable degree4
Distribution of variable degrees[{"degree":3,"count":10},{"degree":4,"count":30}]
Minimum constraint arity4
Maximum constraint arity10
Distribution of constraint arities[{"arity":4,"count":20},{"arity":10,"count":3}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":23}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2 (complete)4394781OPT62027 11.2144 11.217
cosoco 2.0 (complete)4397444OPT62027 11.2685 11.2692
cosoco 2.0 (complete)4408704OPT62027 11.2752 11.2812
(reference) PicatSAT 2019-09-12 (complete)4407785OPT62027 137.878 137.873

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: 62027
Solution found:
<instantiation type='solution' cost='62027'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22]
x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[4] x[5] x[6] x[7] x[8]
x[9] </list> <values>0 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 0 </values> </instantiation>