Name | /PARTIAL-BIGINT-LIN/wcsp/graphs/ normalized-graph13reduc_wcsp.wbo |
MD5SUM | e8a3fc4e5070ef9b31eb0b16df3c02d4 |
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 | 13155 |
Total number of constraints | 970906 |
Number of soft constraints | 970450 |
Number of constraints which are clauses | 970450 |
Number of constraints which are cardinality constraints (but not clauses) | 456 |
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 | 10110 |
Min constraint cost | 1 |
Max constraint cost | 3670 |
Sum of constraints costs | 307075871 |
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 |
---|---|---|---|---|
NaPS 1.02 (complete) | 4094565 | ? (MO) | 1460.64 | 1460.87 |
toysat 2016-05-02 (complete) | 4093179 | ? (TO) | 1800.04 | 1800.33 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090407 | Wrong Cert. | 1800.09 | 1795.16 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091793 | Wrong Cert. | 1800.1 | 901.575 |
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: