2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
Knapsack/
Knapsack-30-100-00_c18.xml

Jump to solvers results

General information on the benchmark

NameKnapsack/
Knapsack-30-100-00_c18.xml
MD5SUM9b4affb9795dbfb6552181ea4234f2b3
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark709
Best CPU time to get the best result obtained on this benchmark0.751082
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
Mistral-2.0 2018-08-01 (complete)4312717OPT709 0.096856 0.0977179
cosoco 1.12 (complete)4302055OPT709 0.751082 0.752856
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312106OPT709 2.22088 1.44437
OscaR - Hybrid 2018-08-14 (complete)4310246OPT709 2.23054 1.26756
Choco-solver 4.0.7b seq (e747e1e) (complete)4302053OPT709 5.56867 2.02124
Concrete 3.9.2-SuperNG (complete)4302620OPT709 14.8474 7.63063
Concrete 3.9.2 (complete)4302270OPT709 16.2065 9.21995
Sat4j-CSP 2018-07-11 (complete)4302054OPT709 110.733 107.842
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4309896SAT709 251.493 247.363

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: 709
Solution found:
<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>