Name | /PARTIAL-BIGINT-LIN/wcsp/celar/ normalized-celar6-sub4reduc_wcsp.wbo |
MD5SUM | 7520d228fece47913158c53d65540c90 |
Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
Best result obtained on this benchmark | |
Best cost obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | |
Max-Satisfiable | |
Max-(Un)Satisfiability was proved | |
Best value of the cost | |
Optimality of the best cost was proved | |
Number of variables | 816 |
Total number of constraints | 142008 |
Number of soft constraints | 141988 |
Number of constraints which are clauses | 141988 |
Number of constraints which are cardinality constraints (but not clauses) | 20 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 44 |
Top cost | 3230 |
Min constraint cost | 1 |
Max constraint cost | 2200 |
Sum of constraints costs | 35467150 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 45 |
Number of bits of the biggest sum of numbers | 6 |
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 CuttingPlanes 2.2.0 2010-05-26 (complete) | 2701307 | UNSAT | 6.47102 | 2.82937 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701306 | UNSAT | 23.3235 | 19.7643 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701308 | UNSAT | 29.5065 | 22.289 |
PB/CT 0.1 (complete) | 2701309 | ? (TO) | 1800.07 | 1800.02 |
SAT4J PB Resolution 2.2.1 (complete) | 2701310 | ? (TO) | 1800.09 | 1797.56 |
PB/CT 0.1 fixed (complete) | 2701311 | ? (TO) | 1800.1 | 1800.05 |
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: