CSP 2006 Competition (second round): benchmarks results per solver

Result page for solver Abscon 109 AC

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

Solver proved unsatisfiability (UNSATISFIABLE) (498 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) (584 runs) [Show/Hide]

Solver timed out (no solution given) (113 runs) [Show/Hide]

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

Solver proved unsatisfiability (UNSATISFIABLE) (268 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) (293 runs) [Show/Hide]

Solver didn't decide (UNKNOWN) (1 run) [Show/Hide]

Solver timed out (no solution given) (212 runs) [Show/Hide]

Category "global constraints" (GLOBAL)

Solver proved unsatisfiability (UNSATISFIABLE) (22 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) (105 runs) [Show/Hide]

Solver timed out (no solution given) (5 runs) [Show/Hide]

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

Solver proved unsatisfiability (UNSATISFIABLE) (111 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) (166 runs) [Show/Hide]

Solver timed out (no solution given) (122 runs) [Show/Hide]

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

Solver proved unsatisfiability (UNSATISFIABLE) (51 runs) [Show/Hide]

Solver found a solution (SATISFIABLE) (439 runs) [Show/Hide]

Solver didn't decide (UNKNOWN) (123 runs) [Show/Hide]

Solver timed out (no solution given) (312 runs) [Show/Hide]