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-18.xml

Jump to solvers results

General information on the benchmark

NameKnapsack/Knapsack-m1-s50/
Knapsack-50-200-18.xml
MD5SUMfc58042bc4c17dd15fe4721e0dab7678
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark937
Best CPU time to get the best result obtained on this benchmark65.0448
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 (complete)4394746OPT937 65.0448 65.0486
cosoco 2.0 (complete)4408788OPT937 65.0903 65.0905
cosoco 2.0 (complete)4397528OPT937 65.4896 65.4956
(reference) PicatSAT 2019-09-12 (complete)4407708OPT937 175.161 175.165

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: 937
Solution found:
<instantiation type='solution' cost='937'> <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>1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 1
1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 </values> </instantiation>