| Name | Quasigroups/ QuasiGroup-4-10_c18.xml |
| MD5SUM | 13340ae912518807f9e2f6bcededa797 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 200 |
| Number of constraints | 182 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 100 |
| Distribution of domain sizes | [{"size":10,"count":100},{"size":100,"count":90}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 93 |
| Distribution of variable degrees | [{"degree":0,"count":10},{"degree":2,"count":90},{"degree":92,"count":10},{"degree":93,"count":90}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 101 |
| Distribution of constraint arities | [{"arity":3,"count":90},{"arity":10,"count":1},{"arity":100,"count":1},{"arity":101,"count":90}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 90 |
| Distribution of constraint types | [{"type":"intension","count":90},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":90}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291309 | ? (TO) | 19907.8 | 2520.26 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309078 | ? (TO) | 19922 | 2520.34 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307407 | ? (TO) | 20072.5 | 2520.07 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307171 | ? (TO) | 20074.5 | 2520.07 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297722 | ? (TO) | 20078.1 | 2520.11 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297223 | ? (TO) | 20080.7 | 2520.07 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296987 | ? (TO) | 20081.4 | 2520.07 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: