MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/spot5/
normalized-spot5-505_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/spot5/
normalized-spot5-505_ext.xml
MD5SUM61f4d43c85f192bf38657d944fe37a15
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMSAT TO
Best Number of falsified constraints151
Best CPU time to get the best result obtained on this benchmark3600.05
Satisfiable
(Un)Satisfiability was proved
Number of variables241
Number of constraints2242
Maximum constraint arity3
Maximum domain size4
Number of constraints which are defined in extension2242
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerNumber of falsified constraintsCPU timeWall clock time
Concrete + CSP4J - MCRW Engine 2008-05-301126535MSAT (TO)151 3600.05 3607.22
Concrete + CSP4J - Tabu Engine 2008-05-301126536MSAT (TO)151 3600.07 3602.92
AbsconMax 112 pc-w1126537MSAT (TO)161 1639.83 4000.09
AbsconMax 112 pc-d1126538MSAT (TO)163 1668.97 4000.06
Sugar++ v1.13+minisat-inc1126539MSAT (TO)197 3600.16 3629.21
Sugar v1.13+minisat1126540MSAT (TO)212 3600.1 3621.73
toulbar2 2008-06-271126542? (TO) 3600.06 3602.21
toulbar2/BTD 2008-06-271126541? (TO) 3600.13 3637.11

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