Name | Subisomorphism/ Subisomorphism-g10-g23_c18.xml |
MD5SUM | 5bb458afb57028f2eacd8dc69366d90c |
Bench Category | CSP (decision problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 386.598 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 41 |
Number of constraints | 121 |
Number of domains | 1 |
Minimum domain size | 73 |
Maximum domain size | 73 |
Distribution of domain sizes | [{"size":73,"count":41}] |
Minimum variable degree | 2 |
Maximum variable degree | 11 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":6},{"degree":5,"count":10},{"degree":6,"count":14},{"degree":7,"count":4},{"degree":8,"count":4},{"degree":10,"count":1},{"degree":11,"count":1}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 41 |
Distribution of constraint arities | [{"arity":1,"count":40},{"arity":2,"count":80},{"arity":41,"count":1}] |
Number of extensional constraints | 120 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":120},{"type":"allDifferent","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) | 4297770 | UNSAT | 386.598 | 49.0842 |
scop both+glucose-syrup (2018-07-31) (complete) | 4307455 | UNSAT | 20006.7 | 2516.17 |
OscaR - Parallel with EPS 2018-07-02 (complete) | 4291357 | ? (TO) | 19948.9 | 2520.48 |
OscaR - Parallel with EPS 2018-08-14 (complete) | 4309126 | ? (TO) | 19960.8 | 2520.47 |
scop order+glucose-syrup (2018-07-31) (complete) | 4307219 | ? (TO) | 20038.9 | 2520.06 |
scop order+glucose-syrup (2018-07-07) (complete) | 4297035 | ? (TO) | 20044.3 | 2520.08 |
scop both+glucose-syrup (2018-07-07) (complete) | 4297271 | ? (TO) | 20044.4 | 2520.08 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: