Name | Quasigroups/ QuasiGroup-4-14_c18.xml |
MD5SUM | 0e107aeb1163eb9d4573d4ca0ed1edf8 |
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 | 392 |
Number of constraints | 366 |
Number of domains | 2 |
Minimum domain size | 14 |
Maximum domain size | 196 |
Distribution of domain sizes | [{"size":14,"count":196},{"size":196,"count":182}] |
Minimum variable degree | 0 |
Maximum variable degree | 185 |
Distribution of variable degrees | [{"degree":0,"count":14},{"degree":2,"count":182},{"degree":184,"count":14},{"degree":185,"count":182}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 197 |
Distribution of constraint arities | [{"arity":3,"count":182},{"arity":14,"count":1},{"arity":196,"count":1},{"arity":197,"count":182}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 182 |
Distribution of constraint types | [{"type":"intension","count":182},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":182}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309080 | ? (TO) | 19853.1 | 2520.3 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291311 | ? (TO) | 19892.3 | 2520.44 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307409 | ? (TO) | 20044.4 | 2520.09 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307173 | ? (TO) | 20046.2 | 2520.1 |
scop order+glucose-syrup (2018-07-07) (complete) | 4296989 | ? (TO) | 20051.1 | 2520.1 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297225 | ? (TO) | 20051.2 | 2520.09 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297724 | ? (TO) | 20073.7 | 2520.11 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: