Name | Quasigroups/ QuasiGroup-4-20_c18.xml |
MD5SUM | ced38eac701d5b6d60722ead643d09b8 |
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 | 800 |
Number of constraints | 762 |
Number of domains | 2 |
Minimum domain size | 20 |
Maximum domain size | 400 |
Distribution of domain sizes | [{"size":20,"count":400},{"size":400,"count":380}] |
Minimum variable degree | 0 |
Maximum variable degree | 383 |
Distribution of variable degrees | [{"degree":0,"count":20},{"degree":2,"count":380},{"degree":382,"count":20},{"degree":383,"count":380}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 401 |
Distribution of constraint arities | [{"arity":3,"count":380},{"arity":20,"count":1},{"arity":400,"count":1},{"arity":401,"count":380}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 380 |
Distribution of constraint types | [{"type":"intension","count":380},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":380}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291313 | ? (TO) | 19598.2 | 2520.34 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309082 | ? (TO) | 19646 | 2520.4 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307411 | ? (TO) | 19923.1 | 2520.12 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307175 | ? (TO) | 19929.4 | 2520.16 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297227 | ? (TO) | 19934.8 | 2520.15 |
scop order+glucose-syrup (2018-07-07) (complete) | 4296991 | ? (TO) | 19937.5 | 2520.15 |
Choco-solver 4.0.7b par (e747e1e) (complete) | 4297726 | ? (TO) | 20091.4 | 2520.12 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: