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

Result page for solver R1: Concrete 3.4 (complete)

Category "optimization problem" (COP)

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

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

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

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

Solver timed out (no solution given) (134 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 (237 runs) [Show/Hide]

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

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