Name | /PARTIAL-SMALLINT-LIN/wcsp/coloring/ normalized-myciel5g-5_wcsp.wbo |
MD5SUM | 02dbb62de02783c13bf2d3c63ea9332f |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 1 |
Best CPU time to get the best result obtained on this benchmark | 34.3248 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 235 |
Total number of constraints | 1227 |
Number of soft constraints | 1180 |
Number of constraints which are clauses | 1180 |
Number of constraints which are cardinality constraints (but not clauses) | 47 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 5 |
Top cost | 237 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 1180 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 6 |
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) | 3448720 | OPTIMUM | 34.3248 | 34.3534 |
Sat4j Resolution 2011-06-08 (complete) | 3492832 | OPTIMUM | 464.375 | 462.703 |
wbo 1.6 (complete) | 3447246 | OPTIMUM | 869.827 | 869.817 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447983 | MSAT (TO) | 1800.06 | 1800.01 |
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: 1-x224 -x225 -x226 -x227 -x228 -x229 x230 -x231 -x232 -x233 -x234 x235