Name | /PARTIAL-SMALLINT-LIN/PB10/oliveras/j60/ normalized-j602_7-unsat--soft-33-100-0.wbo |
MD5SUM | ca01bfc21a1e057687efc2b7fef91d1f |
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 | 6 |
Best CPU time to get the best result obtained on this benchmark | 0.051991 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 6466 |
Total number of constraints | 19939 |
Number of soft constraints | 13432 |
Number of constraints which are clauses | 19731 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 208 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 19 |
Top cost | 686652 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 686651 |
Biggest number in a constraint | 22 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 112 |
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) | 3448377 | OPTIMUM | 0.051991 | 0.053404 |
wbo 1.6 (complete) | 3446773 | OPTIMUM | 0.05599 | 0.0570231 |
Sat4j Resolution 2011-06-08 (complete) | 3492313 | OPTIMUM | 2.05869 | 0.95577 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447510 | MSAT (TO) | 1800.26 | 1800.25 |
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: 6-x6462 -x6463 -x6464 -x6465 x6466