Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag8.ucl--soft-66-100-0.wbo |
MD5SUM | fbaddd9625623c5e0a4f0ddddf2cf090 |
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 | 2 |
Best CPU time to get the best result obtained on this benchmark | 1.46078 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3249 |
Total number of constraints | 8983 |
Number of soft constraints | 3029 |
Number of constraints which are clauses | 8599 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 384 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 154751 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 154750 |
Biggest number in a constraint | 33 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 126 |
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) | 3448285 | OPTIMUM | 1.46078 | 1.46193 |
wbo 1.6 (complete) | 3446669 | OPTIMUM | 2.00369 | 2.005 |
Sat4j Resolution 2011-06-08 (complete) | 3492209 | OPTIMUM | 6.34704 | 5.20921 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447406 | MSAT (TO) | 1800.21 | 1800.16 |
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: 2x3245 x3246 x3247 -x3248 -x3249