2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

Result page for benchmark
Knapsack/
Knapsack-70-300-00_c18.xml

Jump to solvers results

General information on the benchmark

NameKnapsack/
Knapsack-70-300-00_c18.xml
MD5SUMd44f39e6a51fbfbb7edc85febdf9cbd2
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark1425
Best CPU time to get the best result obtained on this benchmark2712.32
Satisfiable
(Un)Satisfiability was proved
Number of variables70
Number of constraints1
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":70}]
Minimum variable degree2
Maximum variable degree2
Distribution of variable degrees[{"degree":2,"count":70}]
Minimum constraint arity70
Maximum constraint arity70
Distribution of constraint arities[{"arity":70,"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
OscaR - Parallel with EPS 2018-08-14 (complete)4308732OPT1425 1520.19 214.24
OscaR - Parallel with EPS 2018-07-02 (complete)4290963OPT1425 1817.28 232.757
Choco-solver 4.0.7b par (e747e1e) (complete)4297376OPT1425 2712.32 360.324

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: 1425
Solution found:
<instantiation> <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] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43]
x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66]
x[67] x[68] x[69] </list> <values> 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 0 1 0 1 0 0 1 0 1 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0
1 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 </values> </instantiation>