Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j907_8-unsat--soft-33-100-0.wbo |
MD5SUM | 4e95d2f358a1d03e64dd8ae41095cef7 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big 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 | 11.2223 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 10920 |
Total number of constraints | 34033 |
Number of soft constraints | 22812 |
Number of constraints which are clauses | 33797 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 236 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 50 |
Top cost | 1153249 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1153248 |
Biggest number in a constraint | 60 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 345 |
Number of bits of the biggest sum of numbers | 9 |
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 |
---|---|---|---|---|
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090345 | OPTIMUM | 2.19367 | 0.977287 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091731 | OPTIMUM | 4.6043 | 2.21726 |
toysat 2016-05-02 (complete) | 4093117 | OPTIMUM | 11.2223 | 11.2309 |
NaPS 1.02 (complete) | 4094503 | OPTIMUM | 107.401 | 107.424 |
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: 2--too large--