Name | /SOFT-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j301_4-unsat--soft-0-100-0.wbo |
MD5SUM | e3506e875c35b23efc6ab2fc4e93bb0b |
Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 8 |
Best CPU time to get the best result obtained on this benchmark | 0.039993 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3844 |
Total number of constraints | 11854 |
Number of soft constraints | 11854 |
Number of constraints which are clauses | 11610 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 244 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 13 |
Top cost | 596117 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 596116 |
Biggest number in a constraint | 15 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 99 |
Number of bits of the biggest sum of numbers | 7 |
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) | 3448077 | OPTIMUM | 0.039993 | 0.0412199 |
wbo 1.6 (complete) | 3446873 | OPTIMUM | 0.043992 | 0.0464661 |
Sat4j Resolution 2011-06-08 (complete) | 3492436 | OPTIMUM | 1.68974 | 0.829102 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447610 | MSAT (TO) | 1800.26 | 1800.2 |
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: 8x3844