2017 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): benchmarks results per solver

Result page for solver R1: cosoco-sat 1.1 (complete)

Category "optimization problem" (COP)

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

Solver found optimum (OPTIMUM FOUND) (96 runs) [Show/Hide]

Solver timed out but found at least a solution (12 runs) [Show/Hide]

Solver does not handle one of the constraint (68 runs) [Show/Hide]

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

Solver exceeded the memory limit (no solution given) (18 runs) [Show/Hide]

Solver was terminated by a signal (4 runs) [Show/Hide]

Solver answered SATISFIABLE but gave no complete certificate (70 runs) [Show/Hide]

Category "decision problem" (CSP)

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

Solver found a solution (SATISFIABLE) for a SAT/UNSAT instance (226 runs) [Show/Hide]

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

Solver does not handle one of the constraint (18 runs) [Show/Hide]

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