Name | /PARTIAL-BIGINT-LIN/wcsp/scens/ normalized-scen06-24reduc_wcsp.wbo |
MD5SUM | e44e20f2150f9b61d01ff52511cd8892 |
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 | 1275 |
Total number of constraints | 56482 |
Number of soft constraints | 56401 |
Number of constraints which are clauses | 56401 |
Number of constraints which are cardinality constraints (but not clauses) | 81 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 20 |
Top cost | 3389 |
Min constraint cost | 1 |
Max constraint cost | 2434 |
Sum of constraints costs | 18368517 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 21 |
Number of bits of the biggest sum of numbers | 5 |
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) | 2701343 | UNSAT | 2.93955 | 1.40892 |
SAT4J PB Resolution 2.2.0 2010-05-26 (complete) | 2701342 | UNSAT | 5.64414 | 3.95644 |
SAT4J PB RES // CP 2.2.0 2010-05-31 (complete) | 2701344 | UNSAT | 7.54185 | 4.99335 |
PB/CT 0.1 (complete) | 2701345 | ? (TO) | 1800.05 | 1800.01 |
PB/CT 0.1 fixed (complete) | 2701347 | ? (TO) | 1800.06 | 1800.02 |
SAT4J PB Resolution 2.2.1 (complete) | 2701346 | ? (TO) | 1800.11 | 1798.15 |
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: