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

Result page for solver Abscon 109 ESAC

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

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

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

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

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

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

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

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

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

Solver exceeded the memory limit (no solution given) (1 run) [Show/Hide]

Category "global constraints" (GLOBAL)

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

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

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

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

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

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

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

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

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

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

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

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