MAX-CSP 2008 Competition: solvers page (tabular format, detailed results)

Some explanations

• #Benchs: Number of benchs for this solver
• MOPT.: solver found the best solution (the one which satisfies the greatest number of constraints)
• SAT.: solver found a solution which satisfies every constraint
• MSAT.: solver found a solution which satisfies some constraints
• MSAT (timeout): solver exceeded the time limit but was able to find a solution which satisfies some constraints
• MSAT (out of mem.): solver exceeded the memory limit but was able to find a solution which satisfies some constraints
• UNKNOWN: solver couldn't decide ("s UNKNOWN" was output)
• UNKNOWN (timeout): solver exceeded the time limit and gave no answer. These runs are considered to give result UNKNOWN
• UNKNOWN (out of mem.): solver exceeded the memory limit and gave no answer. These runs are considered to give result UNKNOWN.
• UNKNOWN (exit code): solver didn't output a solution line and terminated with an unexpected exit code. These runs are considered to give result UNKNOWN.
• UNKNOWN (conv. script): The conversion script failed to convert the instance. These runs are considered to give result UNKNOWN.
• UNKNOWN (problem): No solution line was correctly recognized. These runs are considered to give result UNKNOWN.
• Sig. Caught: solver was terminated by a signal (SIGSEGV for example) and didn't output a solution line
• NO CERT.: solver claimed it got a solution but either didn't provide a certificate (the "v " line) or either gave a truncated certificate (which doesn't end in a new line)
• WRONG OPT.: solver claimed that it found the best solution but there exists a better one
• WRONG CERT.: solver gave a solution but it appears that it is invalid
• Misc: This is a internal check. It counts the runs that don't fall into one of the previous category. Should be 0 if categories are exhaustive and mutually exclusive. Will be negative if categories are not mutually exclusive and positive if categories are not exhaustive.

Category "binary constraints in extension" (2-ARY-EXT)

Category "binary constraints in intension" (2-ARY-INT)

Category "global constraints" (GLOBAL)

Category "n-ary constraints in extension" (N-ARY-EXT)

Category "n-ary constraints in intension" (N-ARY-INT)

All categories for solvers registered in all categories

All categories and all solvers (regardless of their ability to support all categories)

This table summarizes the results in all categories for all solvers. Note however that some solvers may not have support for some categories. Therefore, the solvers may have run on a different number of benchmarks and this table should not be used to compare them.