Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j605_10-unsat--soft-66-100-0.wbo |
MD5SUM | 257e79f814ec2395c606dee738edc728 |
Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MSAT TO |
Best cost obtained on this benchmark | 69 |
Best CPU time to get the best result obtained on this benchmark | 1800.06 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 9638 |
Total number of constraints | 30220 |
Number of soft constraints | 10314 |
Number of constraints which are clauses | 29908 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 312 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 38 |
Top cost | 520266 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 520265 |
Biggest number in a constraint | 20 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 254 |
Number of bits of the biggest sum of numbers | 8 |
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) | 3448364 | MSAT (TO) | 1800.06 | 1800.02 |
Sat4j Resolution 2011-06-08 (complete) | 3492300 | MSAT (TO) | 1800.2 | 1797.26 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447497 | MSAT (TO) | 1800.21 | 1800.18 |
wbo 1.6 (complete) | 3446760 | ? (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: 69-x9637 x9638