Name | /PARTIAL-SMALLINT-LIN/PB06/web/uclid_pb_benchmarks/ normalized-ooo.rf7.ucl--soft-66-100-0.wbo |
MD5SUM | 8b3bb15bf42f2b763120a3c01531d890 |
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 | 2.04769 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 3736 |
Total number of constraints | 10457 |
Number of soft constraints | 3516 |
Number of constraints which are clauses | 10089 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 368 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 11 |
Top cost | 177995 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 177994 |
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 |
---|---|---|---|---|
toysat 2016-05-02 (complete) | 4110102 | OPTIMUM | 2.04769 | 2.04996 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4110100 | OPTIMUM | 2.68359 | 1.30166 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4110101 | OPTIMUM | 8.02378 | 9.76745 |
NaPS 1.02 (complete) | 4110103 | OPTIMUM | 33.2969 | 33.3021 |
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: 1x3731 x3732 x3733 x3734 x3735 x3736