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

Result page for solver AbsCon-basic 2017-06-11 (complete)

Category "optimization problem" (COP)

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

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

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

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

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