Name | /SOFT-SMALLINT-LIN/PB10/oliveras/j30/ normalized-j3041_4-unsat--soft-0-100-0.wbo |
MD5SUM | 52e7cbeb256e4943cc81a3e27d9870a4 |
Bench Category | SOFT-SMALLINT-LIN (only soft constraints, small integers, linear constraints) |
Best result obtained on this benchmark | MOPT |
Best cost obtained on this benchmark | 4 |
Best CPU time to get the best result obtained on this benchmark | 10.6184 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 4836 |
Total number of constraints | 16649 |
Number of soft constraints | 16649 |
Number of constraints which are clauses | 16341 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 308 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 26 |
Top cost | 842394 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 842393 |
Biggest number in a constraint | 15 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 166 |
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 |
---|---|---|---|---|
toysat 2016-05-02 (complete) | 4093058 | OPTIMUM | 10.6184 | 10.6213 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090286 | OPTIMUM | 27.7988 | 25.6 |
NaPS 1.02 (complete) | 4094444 | MSAT | 265.388 | 265.467 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091672 | MSAT (TO) | 1800.02 | 1763.36 |
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: 4-x4831 -x4832 -x4833 -x4834 -x4835 x4836