Name | /PARTIAL-BIGINT-LIN/wcsp/warehouse/ normalized-capmo1_wcsp.wbo |
MD5SUM | 01729ffda5d5346f55f0d16a731d6c31 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | MSAT |
Best cost obtained on this benchmark | 1125496 |
Best CPU time to get the best result obtained on this benchmark | 1800.26 |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 10200 |
Total number of constraints | 20300 |
Number of soft constraints | 20100 |
Number of constraints which are clauses | 20100 |
Number of constraints which are cardinality constraints (but not clauses) | 200 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 100 |
Top cost | 16472577 |
Min constraint cost | 1 |
Max constraint cost | 16472577 |
Sum of constraints costs | 164860388479 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 101 |
Number of bits of the biggest sum of numbers | 7 |
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) | 2701215 | MSAT (TO) | 1800.11 | 1800.02 |
SAT4J PB Resolution 2.2.1 (complete) | 2701214 | MSAT (TO) | 1800.26 | 1798.54 |
PB/CT 0.1 (complete) | 2701213 | Wrong UNSAT | 0.886864 | 0.886086 |
SAT4J PB CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701211 | Wrong UNSAT | 1.47678 | 0.686878 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701210 | Wrong UNSAT | 2.01869 | 1.05498 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701212 | Wrong UNSAT | 2.50562 | 2.02664 |
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: 1338236--too large--