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

Result page for benchmark
Knapsack/Knapsack-m1-s30/
Knapsack-30-100-03.xml

Jump to solvers results

General information on the benchmark

NameKnapsack/Knapsack-m1-s30/
Knapsack-30-100-03.xml
MD5SUM0746125508c57681f40885835e89af46
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark781
Best CPU time to get the best result obtained on this benchmark1.71442
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints1
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":30}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":30}]
Minimum constraint arity30
Maximum constraint arity30
Distribution of constraint arities[{"arity":30,"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)4394749OPT781 1.71442 1.71476
cosoco 2.0 (complete)4397490OPT781 1.72441 1.72635
cosoco 2.0 (complete)4408750OPT781 1.72662 1.72709
(reference) PicatSAT 2019-09-12 (complete)4407711OPT781 48.4542 48.4598

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: 781
Solution found:
<instantiation type='solution' cost='781'> <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[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 1 1 1 0 1 1 1 0 0 0 0 0 0 1 0 1 0 0 1 0
0 0 1 1 1 0 0 1 1 </values> </instantiation>