Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j90/ normalized-j9012_2-unsat--soft-66-100-0.wbo |
MD5SUM | cbe4c3d53eb1efe1b988611d439eb8ee |
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 | 54 |
Best CPU time to get the best result obtained on this benchmark | 0.076988 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 12922 |
Total number of constraints | 40512 |
Number of soft constraints | 13779 |
Number of constraints which are clauses | 40232 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 280 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 69 |
Top cost | 694337 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 694336 |
Biggest number in a constraint | 102 |
Number of bits of the biggest number in a constraint | 7 |
Biggest sum of numbers in a constraint | 504 |
Number of bits of the biggest sum of numbers | 9 |
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) | 3448341 | OPTIMUM | 0.076988 | 0.0767169 |
wbo 1.6 (complete) | 3446736 | OPTIMUM | 0.12198 | 0.123815 |
Sat4j Resolution 2011-06-08 (complete) | 3492276 | OPTIMUM | 2.30965 | 1.1452 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447473 | OPTIMUM | 10.4724 | 10.4753 |
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: 54-x12915 -x12916 -x12917 -x12918 -x12919 -x12920 -x12921 x12922