Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j6030_9-unsat--soft-66-100-0.wbo |
MD5SUM | 1889fba1555b8697309aed0b2b80cc12 |
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 | 8 |
Best CPU time to get the best result obtained on this benchmark | 0.12198 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 11956 |
Total number of constraints | 39426 |
Number of soft constraints | 13393 |
Number of constraints which are clauses | 39038 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 388 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 60 |
Top cost | 678604 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 678603 |
Biggest number in a constraint | 33 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 416 |
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 |
---|---|---|---|---|
wbo 1.6 (complete) | 3446787 | OPTIMUM | 0.12198 | 0.122806 |
Sat4j Resolution 2011-06-08 (complete) | 3492327 | OPTIMUM | 2.53961 | 1.18536 |
clasp 2.0-RC2 (complete) | 3448391 | OPTIMUM | 5.84211 | 5.8425 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447524 | ? (TO) | 1800.05 | 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: 8--too large--