/PARTIAL-SMALLINT-LIN/PB06/web/

uclid_pb_benchmarks/normalized-blast-floppy1-2.ucl--soft-33-100-0.wbo

Name | /PARTIAL-SMALLINT-LIN/PB06/web/ uclid_pb_benchmarks/normalized-blast-floppy1-2.ucl--soft-33-100-0.wbo |

MD5SUM | 41c5d5bb21666da1060ef5877d8823b7 |

Bench Category | PARTIAL-SMALLINT-LIN (both soft and hard constraints, small integers, linear constraints) |

Best result obtained on this benchmark | MOPT |

Best cost obtained on this benchmark | 1 |

Best CPU time to get the best result obtained on this benchmark | 0.008998 |

Max-Satisfiable | |

Max-(Un)Satisfiability was proved | |

Best value of the cost | |

Optimality of the best cost was proved | |

Number of variables | 152 |

Total number of constraints | 127 |

Number of soft constraints | 88 |

Number of constraints which are clauses | 77 |

Number of constraints which are cardinality constraints (but not clauses) | 0 |

Number of constraints which are nor clauses,nor cardinality constraints | 50 |

Minimum length of a constraint | 1 |

Maximum length of a constraint | 19 |

Top cost | 4363 |

Min constraint cost | 1 |

Max constraint cost | 100 |

Sum of constraints costs | 4362 |

Biggest number in a constraint | 772 |

Number of bits of the biggest number in a constraint | 10 |

Biggest sum of numbers in a constraint | 2305 |

Number of bits of the biggest sum of numbers | 12 |

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 |
---|---|---|---|---|

clasp 2.0-RC2 (complete) | 3448217 | OPTIMUM | 0.008998 | 0.010198 |

wbo 1.6 (complete) | 3446563 | OPTIMUM | 0.011997 | 0.0130029 |

Sat4j Resolution 2011-06-08 (complete) | 3492079 | OPTIMUM | 0.570912 | 0.306459 |

SCIP spx SCIP 2.0.1.4. with SoPlex 1.5.0.4 (complete) | 3447300 | OPTIMUM | 0.857869 | 0.858352 |

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: 1Solution found:

x144 -x145 x146 -x147 x148 -x149 x150 -x151 -x152