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

Result page for benchmark
MultiKnapsack/MultiKnapsack-m1-gp/
MultiKnapsack-2-48.xml

Jump to solvers results

General information on the benchmark

NameMultiKnapsack/MultiKnapsack-m1-gp/
MultiKnapsack-2-48.xml
MD5SUMfdc0acb1128a6a46ad14275048f2788c
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark18.310301
Satisfiable
(Un)Satisfiability was proved
Number of variables35
Number of constraints5
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":35}]
Minimum variable degree5
Maximum variable degree5
Distribution of variable degrees[{"degree":5,"count":35}]
Minimum constraint arity35
Maximum constraint arity35
Distribution of constraint arities[{"arity":35,"count":5}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":5}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Naxos 1.1.0 (complete)4251754SAT 15.8273 15.83
cosoco-mini 1.1 (2017-06-27) (complete)4251753SAT 17.8373 17.8395
cosoco-mini 1.1 (2017-07-29) (complete)4260176SAT 18.0368 18.109699
cosoco-mini 1.12 (complete)4267357SAT 18.310301 18.310101
miniBTD 2017-08-10 (complete)4264916? (TO) 2400.0601 2400.3
miniBTD 2017-06-30 (complete)4251752? (TO) 2400.11 2400.21

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:
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] </list> <values> 0 0 1 0 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1
1 1 0 1 0 1 1 1 1 1 1 1 0 1 1 </values> </instantiation>