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

Result page for benchmark
Knapsack/Knapsack-m1-s50/
Knapsack-50-200-00.xml

Jump to solvers results

General information on the benchmark

NameKnapsack/Knapsack-m1-s50/
Knapsack-50-200-00.xml
MD5SUM1dc4c7bf61332e07eccc684c7f29cd57
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark960
Best CPU time to get the best result obtained on this benchmark29.2772
Satisfiable
(Un)Satisfiability was proved
Number of variables50
Number of constraints1
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":50}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":50}]
Minimum constraint arity50
Maximum constraint arity50
Distribution of constraint arities[{"arity":50,"count":1}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":1}]
Optimization problemYES
Type of objectivemax SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
cosoco 2.0 (complete)4408768OPT960 29.2772 29.2792
cosoco 2 (complete)4394741OPT960 29.3529 29.3582
cosoco 2.0 (complete)4397508OPT960 29.468 29.4716
(reference) PicatSAT 2019-09-12 (complete)4407703OPT960 215.72 215.753

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: 960
Solution found:
<instantiation type='solution' cost='960'> <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[40] x[41] x[42] x[43]
x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1
1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 </values> </instantiation>