Name | Knapsack/ Knapsack-30-100-00_c18.xml |
MD5SUM | 9b4affb9795dbfb6552181ea4234f2b3 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 709 |
Best CPU time to get the best result obtained on this benchmark | 0.751082 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 30 |
Number of constraints | 1 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":30}] |
Minimum variable degree | 2 |
Maximum variable degree | 2 |
Distribution of variable degrees | [{"degree":2,"count":30}] |
Minimum constraint arity | 30 |
Maximum constraint arity | 30 |
Distribution of constraint arities | [{"arity":30,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":1}] |
Optimization problem | YES |
Type of objective | max SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Mistral-2.0 2018-08-01 (complete) | 4312717 | OPT | 709 | 0.096856 | 0.0977179 |
cosoco 1.12 (complete) | 4302055 | OPT | 709 | 0.751082 | 0.752856 |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312106 | OPT | 709 | 2.22088 | 1.44437 |
OscaR - Hybrid 2018-08-14 (complete) | 4310246 | OPT | 709 | 2.23054 | 1.26756 |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4302053 | OPT | 709 | 5.56867 | 2.02124 |
Concrete 3.9.2-SuperNG (complete) | 4302620 | OPT | 709 | 14.8474 | 7.63063 |
Concrete 3.9.2 (complete) | 4302270 | OPT | 709 | 16.2065 | 9.21995 |
Sat4j-CSP 2018-07-11 (complete) | 4302054 | OPT | 709 | 110.733 | 107.842 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309896 | SAT | 709 | 251.493 | 247.363 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 709<instantiation type="optimum" cost="709"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] </list> <values> 0 0 1 0 0 1 0 1 0 1 1 1 0 0 1 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 </values> </instantiation>