Name | Subisomorphism/ Subisomorphism-g34-g36_c18.xml |
MD5SUM | bf1db001ac5fdaef8f815bb03b0feb23 |
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 | 0.571336 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 120 |
Number of constraints | 241 |
Number of domains | 1 |
Minimum domain size | 120 |
Maximum domain size | 120 |
Distribution of domain sizes | [{"size":120,"count":120}] |
Minimum variable degree | 5 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":5,"count":120}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 120 |
Distribution of constraint arities | [{"arity":2,"count":240},{"arity":120,"count":1}] |
Number of extensional constraints | 240 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":240},{"type":"allDifferent","count":1}] |
Optimization problem | NO |
Type of objective |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
cosoco 1.12 (complete) | 4299823 | UNSAT | 0.571336 | 0.571958 |
NACRE 1.0.4 (complete) | 4299826 | UNSAT | 0.852392 | 0.853185 |
miniBTD 2018.07.27_3 (complete) | 4301130 | UNSAT | 3.50068 | 3.50236 |
miniBTD_12 2018.07.27_12 (complete) | 4300954 | UNSAT | 4.42166 | 4.42287 |
minimacht 2018.07.27 (complete) | 4300778 | UNSAT | 4.53501 | 4.53566 |
MiniCPFever 2018-04-29 (complete) | 4299825 | UNSAT | 6.65931 | 4.85558 |
GG's minicp 2018-04-29 (complete) | 4299824 | UNSAT | 9.38943 | 7.22225 |
The dodo solver 2018-04-29 (complete) | 4299830 | UNSAT | 23.3984 | 21.8864 |
Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299828 | UNSAT | 89.39 | 87.5687 |
SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299829 | ? | 316.615 | 314.663 |
slowpoke 2018-04-29 (incomplete) | 4299827 | ? (TO) | 2520.07 | 2515.31 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: