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

Some explanations

• #Benchs: Number of benchs for this solver
• Solved: Total number of solved instances (this is the sum of the SAT and UNSAT columns)
• UNSAT.: solver proved unsatitisfiability ("s UNSATISFIABLE" was output)
• SAT.: solver found a solution ("s SATISFIABLE" was output) and the provided implicant satisfies each constraint
• SAT (timeout): solver exceeded the time limit but was able to find a solution ("s SATISFIABLE" was output) and the provided implicant satisfies each constraint
• 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 answered SATISFIABLE 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 CERT.: solver gave an implicant but it appears that it doesn't satisfy every constraint
• WRONG UNSAT.: solver proved unsatisfiability but was wrong ("s UNSATISFIABLE" was output)
• 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)