MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/knights/
normalized-knights-12-9.xml

Jump to solvers results

General information on the benchmark

Namecsp/knights/
normalized-knights-12-9.xml
MD5SUM88a8a34b19289d35e9ed9938496c3815
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 benchmark44.7012
Satisfiable
(Un)Satisfiability was proved
Number of variables9
Number of constraints36
Maximum constraint arity2
Maximum domain size144
Number of constraints which are defined in extension0
Number of constraints which are defined in intension36
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
AbsconMax 112 pc-w1112253OPTIMUM1 44.7012 65.4216
Sugar v1.13+minisat1112256OPTIMUM1 44.7072 45.3765
AbsconMax 112 pc-d1112254OPTIMUM1 48.2817 74.348
Sugar++ v1.13+minisat-inc1112255OPTIMUM1 68.0786 69.2458
Concrete + CSP4J - MCRW Engine 2008-05-301112251MSAT (TO)1 3600.01 3603.02
Concrete + CSP4J - Tabu Engine 2008-05-301112252MSAT (TO)1 3600.04 3634.12

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:
80 124 114 128 105 82 107 117 94