Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-dsjc125-1-4_wcsp.wbo |
MD5SUM | b95440184c2619269a303a66296dd7fe |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MSAT TO |
Best cost obtained on this benchmark | 41 |
Best CPU time to get the best result obtained on this benchmark | 1800.06 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 500 |
Total number of constraints | 3069 |
Number of soft constraints | 2944 |
Number of constraints which are clauses | 2944 |
Number of constraints which are cardinality constraints (but not clauses) | 125 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 4 |
Top cost | 737 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 2944 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 5 |
Number of bits of the biggest sum of numbers | 3 |
Number of products (including duplicates) | 0 |
Sum of products size (including duplicates) | 0 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | CPU time | Wall clock time |
---|---|---|---|---|
clasp 2.0-RC2 (complete) | 3448721 | MSAT (TO) | 1800.06 | 1800.01 |
Sat4j Resolution 2011-06-08 (complete) | 3492833 | MSAT (TO) | 1800.12 | 1797.73 |
wbo 1.6 (complete) | 3447247 | ? (TO) | 1800.06 | 1800.03 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447984 | ? (TO) | 1800.06 | 1800.02 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
cost of falsified constraints: 41-x497 -x498 x499 -x500