Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j90/ normalized-j9035_1-unsat--soft-33-100-0.wbo |
MD5SUM | ad298ec3d1b23c2d09641db93f834dc3 |
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 | 8 |
Best CPU time to get the best result obtained on this benchmark | 5.73013 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 17836 |
Total number of constraints | 61428 |
Number of soft constraints | 41185 |
Number of constraints which are clauses | 61040 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 388 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 25 |
Top cost | 2080586 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 2080585 |
Biggest number in a constraint | 28 |
Number of bits of the biggest number in a constraint | 5 |
Biggest sum of numbers in a constraint | 185 |
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 |
---|---|---|---|---|
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090340 | OPTIMUM | 2.51362 | 1.23207 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091726 | OPTIMUM | 4.83326 | 2.42391 |
toysat 2016-05-02 (complete) | 4093112 | OPTIMUM | 5.73013 | 5.73578 |
NaPS 1.02 (complete) | 4094498 | MSAT (MO) | 109.147 | 109.181 |
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: 8--too large--