Name | PizzaVoucher/ PizzaVoucher-18b_c18.xml |
MD5SUM | cfb25615b49033917f7fa13487cdd88c |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 54 |
Best CPU time to get the best result obtained on this benchmark | 20053.7 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 68 |
Number of constraints | 208 |
Number of domains | 19 |
Minimum domain size | 1 |
Maximum domain size | 33 |
Distribution of domain sizes | [{"size":1,"count":2},{"size":2,"count":39},{"size":3,"count":4},{"size":4,"count":3},{"size":5,"count":1},{"size":7,"count":1},{"size":33,"count":18}] |
Minimum variable degree | 2 |
Maximum variable degree | 50 |
Distribution of variable degrees | [{"degree":2,"count":50},{"degree":48,"count":9},{"degree":49,"count":4},{"degree":50,"count":5}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 19 |
Distribution of constraint arities | [{"arity":2,"count":176},{"arity":19,"count":32}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 176 |
Distribution of constraint types | [{"type":"intension","count":176},{"type":"count","count":32}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297482 | SAT (TO) | 54 | 20053.7 | 2520.1 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4308838 | ? (TO) | 19976.3 | 2520.28 | |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291069 | ? (TO) | 19986.9 | 2520.31 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 54<instantiation> <list>v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] v[15] v[16] v[17] np[0] np[1] np[2] np[3] np[4] np[5] np[6] np[7] np[8] np[9] np[10] np[11] np[12] np[13] np[14] np[15] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8] nf[9] nf[10] nf[11] nf[12] nf[13] nf[14] nf[15] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] pp[12] pp[13] pp[14] pp[15] pp[16] pp[17] </list> <values>16 -16 15 -15 15 -15 14 14 14 14 15 15 -14 14 -14 14 -14 8 0 0 0 0 0 0 0 0 0 0 0 0 0 3 2 1 0 0 0 0 0 0 0 1 0 0 0 0 0 6 4 1 0 5 0 9 0 7 0 0 0 0 0 0 11 0 10 0 12 0 </values> </instantiation>