Name | CarSequencing/ CarSequencing-dingbas_c18.xml |
MD5SUM | f25e9b6e669dc8bf92e23091ea1c77d3 |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 1.48586 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 60 |
Number of constraints | 63 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 6 |
Distribution of domain sizes | [{"size":2,"count":50},{"size":6,"count":10}] |
Minimum variable degree | 2 |
Maximum variable degree | 8 |
Distribution of variable degrees | [{"degree":2,"count":10},{"degree":3,"count":5},{"degree":4,"count":7},{"degree":5,"count":10},{"degree":6,"count":14},{"degree":7,"count":11},{"degree":8,"count":3}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 10 |
Distribution of constraint arities | [{"arity":2,"count":10},{"arity":3,"count":16},{"arity":4,"count":3},{"arity":5,"count":14},{"arity":6,"count":11},{"arity":7,"count":2},{"arity":8,"count":1},{"arity":10,"count":6}] |
Number of extensional constraints | 10 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":10},{"type":"sum","count":52},{"type":"cardinality","count":1}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297646 | SAT | 1.48586 | 0.932526 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291233 | SAT | 3.66993 | 1.87928 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309002 | SAT | 3.71123 | 1.84109 |
scop order+glucose-syrup (2018-07-07) (complete) | 4296911 | SAT | 4.16006 | 1.88314 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297147 | SAT | 4.18983 | 1.9946 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307095 | SAT | 5.53076 | 2.78156 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307331 | SAT | 5.54096 | 2.74588 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list>cls[0] cls[1] cls[2] cls[3] cls[4] cls[5] cls[6] cls[7] cls[8] cls[9] opt[0][0] opt[0][1] opt[0][2] opt[0][3] opt[0][4] opt[1][0] opt[1][1] opt[1][2] opt[1][3] opt[1][4] opt[2][0] opt[2][1] opt[2][2] opt[2][3] opt[2][4] opt[3][0] opt[3][1] opt[3][2] opt[3][3] opt[3][4] opt[4][0] opt[4][1] opt[4][2] opt[4][3] opt[4][4] opt[5][0] opt[5][1] opt[5][2] opt[5][3] opt[5][4] opt[6][0] opt[6][1] opt[6][2] opt[6][3] opt[6][4] opt[7][0] opt[7][1] opt[7][2] opt[7][3] opt[7][4] opt[8][0] opt[8][1] opt[8][2] opt[8][3] opt[8][4] opt[9][0] opt[9][1] opt[9][2] opt[9][3] opt[9][4] </list> <values>0 1 5 2 4 3 3 4 2 5 1 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 0 0 1 0 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 </values> </instantiation>