Given a CNF formula F, the Maximum Satisfiability (MaxSAT) problem is the problem of determining the maximum number of clauses of F 
that can be satisfied.

This benchmark includes a random selection of industrial instances taken from the Ninth MaxSAT Evaluation (http://www.maxsat.udl.cat/14/).