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

Result page for benchmark
Knapsack/Knapsack-m1-s40/
Knapsack-40-150-00.xml

Jump to solvers results

General information on the benchmark

NameKnapsack/Knapsack-m1-s40/
Knapsack-40-150-00.xml
MD5SUMc033178a1c92732c6616d8bd8ee8c714
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark932
Best CPU time to get the best result obtained on this benchmark26.093599
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints1
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":40}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":40}]
Minimum constraint arity40
Maximum constraint arity40
Distribution of constraint arities[{"arity":40,"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-mini 1.1 (2017-07-29) (complete)4259882OPT932 26.093599 26.1553
cosoco-mini 1.1 (2017-06-27) (complete)4253126OPT932 26.1097 26.1092
cosoco-mini 1.12 (complete)4267063OPT932 26.3703 26.371
Naxos 1.1.0 (complete)4253127OPT932 162.447 162.479

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