Name | /PARTIAL-SMALLINT-LIN/wcsp/academics/ normalized-langford-3-9_wcsp.wbo |
MD5SUM | 5add7de3ccff8290bd0d3a32154c6477 |
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 | 0 |
Best CPU time to get the best result obtained on this benchmark | 0.381941 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 729 |
Total number of constraints | 22248 |
Number of soft constraints | 22221 |
Number of constraints which are clauses | 22221 |
Number of constraints which are cardinality constraints (but not clauses) | 27 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 27 |
Top cost | 1 |
Min constraint cost | 1 |
Max constraint cost | 1 |
Sum of constraints costs | 22221 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 28 |
Number of bits of the biggest sum of numbers | 5 |
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) | 3448636 | OPTIMUM | 0.381941 | 0.382819 |
Sat4j Resolution 2011-06-08 (complete) | 3492748 | OPTIMUM | 2.87756 | 1.80199 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447899 | OPTIMUM | 4.43033 | 4.43092 |
wbo 1.6 (complete) | 3447162 | MSAT | 1.56776 | 1.56921 |
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: 0-x718 -x719 -x720 -x721 -x722 -x723 -x724 -x725 x726 -x727 -x728 -x729