MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/radar-8-24-3-2/
normalized-radar-8-24-3-2-1.xml

Jump to solvers results

General information on the benchmark

Namecsp/radar-8-24-3-2/
normalized-radar-8-24-3-2-1.xml
MD5SUM41c546e7ed00f23c3960c433d0b9277c
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark2.28265
Satisfiable
(Un)Satisfiability was proved
Number of variables144
Number of constraints64
Maximum constraint arity13
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension64
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar++ v1.13+minisat-inc1112159OPTIMUM1 2.28265 2.51591
Sugar v1.13+minisat1112160OPTIMUM1 2.32565 2.49715
AbsconMax 112 pc-d1112158OPTIMUM1 828.226 851.797
AbsconMax 112 pc-w1112157OPTIMUM1 1133.59 1138.19
Concrete + CSP4J - MCRW Engine 2008-05-301112155MSAT (TO)1 3600.01 3625.13
Concrete + CSP4J - Tabu Engine 2008-05-301112156MSAT (TO)2 3600.03 3607.92

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Number of falsified constraints: 1
Solution found:
3 0 1 0 3 3 3 0 0 0 3 3 3 3 1 1 3 3 3 2 1 1 3 3 3 1 3 1 0 0 3 3 3 3 0 2 3 0 3 3 0 3 0 3 0 1 2 1 1 0 2 3 0 0 3 1 0 0 1 2 0 1 1 0 1 2 3 3 0 3
2 3 3 0 0 3 3 0 0 3 3 0 0 0 1 2 2 1 3 3 2 0 0 0 0 0 0 0 0 0 0 0 0 1 2 3 3 3 1 0 3 3 1 0 3 2 3 3 3 1 3 2 3 3 0 1 2 3 3 3 2 2 1 3 3 3 2 1 0 3
3 3 0 0