Name | /PARTIAL-BIGINT-LIN/wcsp/ mprime/normalized-mprime03bc_wcsp.wbo |
MD5SUM | be1cffc43a6e520c7c18a7927302cbb0 |
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 | 353 |
Best CPU time to get the best result obtained on this benchmark | 0.031994 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 139 |
Total number of constraints | 747 |
Number of soft constraints | 698 |
Number of constraints which are clauses | 698 |
Number of constraints which are cardinality constraints (but not clauses) | 49 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 10 |
Top cost | 4932 |
Min constraint cost | 1 |
Max constraint cost | 4932 |
Sum of constraints costs | 3209913 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 11 |
Number of bits of the biggest sum of numbers | 4 |
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 |
---|---|---|---|---|
PB/CT 0.1 fixed (complete) | 2700897 | OPTIMUM | 0.031994 | 0.0327189 |
SAT4J PB Resolution 2.2.1 (complete) | 2700896 | OPTIMUM | 0.359945 | 0.264813 |
PB/CT 0.1 (complete) | 2700895 | Wrong UNSAT | 0.012998 | 0.0133 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2700892 | Wrong UNSAT | 0.278956 | 0.252343 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2700893 | Wrong UNSAT | 0.283956 | 0.251267 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2700894 | Wrong UNSAT | 0.359945 | 1.24567 |
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: 353-x1 -x2 x3 -x4 -x5 -x6 -x7 x8 -x9 -x10 -x11 x12 -x13 -x14 -x15 -x16 x17 -x18 x19 -x20 x21 -x22 -x23 x24 x25 -x26 -x27 -x28 -x29 -x30 -x31 -x32 -x33 x34 -x35 x36 -x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 -x45 -x46 x47 -x48 -x49 x50 -x51 -x52 x53 x54 -x55 -x56 -x57 x58 -x59 -x60 x61 -x62 -x63 x64 -x65 -x66 -x67 -x68 -x69 x70 -x71 x72 -x73 -x74 -x75 x76 x77 -x78 x79 -x80 x81 -x82 x83 -x84 -x85 -x86 x87 -x88 x89 -x90 x91 -x92 -x93 -x94 x95 x96 -x97 -x98 x99 -x100 -x101 x102 -x103 -x104 x105 -x106 x107 -x108 x109 x110 -x111 x112 -x113 -x114 x115 x116 -x117 -x118 x119 x120 -x121 x122 -x123 x124 -x125 -x126 x127 -x128 x129 x130 -x131 x132 -x133 x134 -x135 -x136 x137 x138 -x139