Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.tag10.ucl--soft-33-100-0.wbo |
MD5SUM | d8e7fa9590f436b33ef13e9171ac617f |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 6.79097 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 9071 |
Total number of constraints | 25914 |
Number of soft constraints | 17208 |
Number of constraints which are clauses | 25190 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 724 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 857979 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 857978 |
Biggest number in a constraint | 39 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 132 |
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) | 3448218 | OPTIMUM | 6.79097 | 6.79242 |
wbo 1.6 (complete) | 3446565 | OPTIMUM | 9.1826 | 9.1846 |
Sat4j Resolution 2011-06-08 (complete) | 3492082 | OPTIMUM | 22.9755 | 21.5256 |
SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447302 | MSAT (TO) | 1800.39 | 1800.34 |
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: 1x9064 x9065 x9066 x9067 x9068 -x9069 -x9070 x9071