| Name | /PARTIAL-BIGINT-LIN/wcsp/zenotravel/ normalized-zenotravel02c_wcsp.wbo |
| MD5SUM | 4b904f6ad53040fc0308c95ff970bc82 |
| Bench Category | PARTIAL-BIGINT-LIN (both soft and hard constraints, big integers, linear constraints) |
| Best result obtained on this benchmark | MOPT |
| Best cost obtained on this benchmark | 2401 |
| Best CPU time to get the best result obtained on this benchmark | 0.71389 |
| Max-Satisfiable | |
| Max-(Un)Satisfiability was proved | |
| Best value of the cost | |
| Optimality of the best cost was proved | |
| Number of variables | 423 |
| Total number of constraints | 8096 |
| Number of soft constraints | 7980 |
| Number of constraints which are clauses | 7980 |
| Number of constraints which are cardinality constraints (but not clauses) | 116 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 19 |
| Top cost | 100447 |
| Min constraint cost | 1 |
| Max constraint cost | 100447 |
| Sum of constraints costs | 787703441 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 20 |
| 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 |
|---|---|---|---|---|
| toysat 2016-05-02 (complete) | 4093295 | OPTIMUM | 0.71389 | 0.715966 |
| NaPS 1.02 (complete) | 4094681 | OPTIMUM | 0.865867 | 0.867045 |
| Sat4j PB 2.3.6 Resolution PB16 (complete) | 4090523 | OPTIMUM | 1.47278 | 0.681192 |
| Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4091909 | OPTIMUM | 2.72258 | 2.10857 |
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: 2401-x421 -x422 x423