MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/queenAttacking/
normalized-queenAttacking-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/queenAttacking/
normalized-queenAttacking-4.xml
MD5SUM92a6a2d917f39136912f84efac51745f
Bench Category2-ARY-INT (binary 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.17867
Satisfiable
(Un)Satisfiability was proved
Number of variables17
Number of constraints126
Maximum constraint arity2
Maximum domain size16
Number of constraints which are defined in extension0
Number of constraints which are defined in intension126
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+minisat1112530OPTIMUM1 2.17867 2.71947
Sugar++ v1.13+minisat-inc1112529OPTIMUM1 2.75158 3.20902
AbsconMax 112 pc-d1112528OPTIMUM1 67.4717 121.547
AbsconMax 112 pc-w1112527OPTIMUM1 80.5948 153.805
Concrete + CSP4J - MCRW Engine 2008-05-301112525MSAT (TO)1 3600.03 3621.32
Concrete + CSP4J - Tabu Engine 2008-05-301112526MSAT (TO)1 3600.05 3614.82

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:
5 0 9 15 4 2 11 13 6 8 14 7 1 10 3 5 12