Name | /PARTIAL-BIGINT-LIN/wcsp/graphs/ normalized-graph13_wcsp.wbo |
MD5SUM | 0e82f4b503d348a993f5f25b1601fee8 |
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 | 17588 |
Total number of constraints | 2800426 |
Number of soft constraints | 2799968 |
Number of constraints which are clauses | 2799968 |
Number of constraints which are cardinality constraints (but not clauses) | 458 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 44 |
Top cost | 1167526 |
Min constraint cost | 1 |
Max constraint cost | 1000 |
Sum of constraints costs | 719469320 |
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 Resolution 2011-06-08 (complete) | 3493037 | ? (TO) | 1800.2 | 1795.48 |
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: