MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/allsquaresUnsat/
normalized-squaresUnsat-3-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/allsquaresUnsat/
normalized-squaresUnsat-3-3.xml
MD5SUMd52d7f42566472c69f278146e9cf2c15
Bench CategoryGLOBAL (global constraints)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints3
Best CPU time to get the best result obtained on this benchmark0.800877
Satisfiable
(Un)Satisfiability was proved
Number of variables18
Number of constraints18
Maximum constraint arity4
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension13
Global constraints used (with number of constraints)cumulative(2),weightedsum(3)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Sugar v1.13+minisat1108902OPTIMUM3 0.800877 0.820603
Sugar++ v1.13+minisat-inc1108901OPTIMUM3 0.833872 2.74656

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: 3
Solution found:
3 1 0 1 2 0 0 1 1 0 0 1 0 0 1 0 0 0