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

Result page for solver cosoco 2.0 (complete)

Category "optimization problem" (COP)

Solver proved unsatisfiability (UNSATISFIABLE) (1 run) [Show/Hide]

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

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

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

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

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

Category "decision problem" (CSP)

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

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

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

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

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

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

Solver didn't output a solution line and terminated with an unexpected exit code (7 runs) [Show/Hide]

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