Name | /PARTIAL-BIGINT-LIN/PB10/oliveras/j60/ normalized-j6030_9-unsat--soft-33-100-0.wbo |
MD5SUM | b7f7bf9a96b4a18a2b3361c5e215972e |
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 | 1 |
Best CPU time to get the best result obtained on this benchmark | 3.60745 |
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 | 26435 |
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 | 1328063 |
Min constraint cost | 1 |
Max constraint cost | 100 |
Sum of constraints costs | 1328062 |
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 Resolution 2.2.1 (complete) | 2698140 | OPTIMUM | 3.60745 | 3.86682 |
PB/CT 0.1 fixed (complete) | 2698881 | MSAT (TO) | 1800.03 | 1800.02 |
PB/CT 0.1 (complete) | 2695099 | Signal | 5.18321 | 5.18641 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2690956 | Wrong UNSAT | 0.854869 | 0.460458 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2691697 | Wrong UNSAT | 0.856868 | 0.46271 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2694358 | Wrong UNSAT | 1.3368 | 0.620957 |
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--