Name | /SOFT-BIGINT-LIN/PB10/oliveras/j60/ normalized-j6030_9-unsat--soft-0-100-0.wbo |
MD5SUM | def010b3798742afc072cdcfd77b8db4 |
Bench Category | SOFT-BIGINT-LIN (only soft constraints, big 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.48362 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 11956 |
Total number of constraints | 39426 |
Number of soft constraints | 39426 |
Number of constraints which are clauses | 39038 |
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 | 60 |
Top cost | 1992515 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1992514 |
Biggest number in a constraint | 33 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 416 |
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) | 4090835 | OPTIMUM | 2.48362 | 1.1211 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4092221 | OPTIMUM | 5.01224 | 2.32024 |
toysat 2016-05-02 (complete) | 4093607 | OPTIMUM | 16.2465 | 16.2563 |
NaPS 1.02 (complete) | 4094993 | MSAT | 117.14 | 117.186 |
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: 1--too large--