MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-2/
normalized-composed-25-1-2-6_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-2/
normalized-composed-25-1-2-6_ext.xml
MD5SUMf14de84cd112e4424460358fb75649df
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints2
Best CPU time to get the best result obtained on this benchmark0.05999
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints224
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension224
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
toulbar2 2008-06-271114622OPTIMUM2 0.05999 0.066199
toulbar2/BTD 2008-06-271114621OPTIMUM2 0.185971 0.198365
Sugar++ v1.13+minisat-inc1114619OPTIMUM2 2.43363 2.93106
Sugar v1.13+minisat1114620OPTIMUM2 2.70959 2.98293
AbsconMax 112 pc-w1114617MSAT (TO)2 1575.46 4000.06
AbsconMax 112 pc-d1114618MSAT (TO)2 1592.21 4000.07
Concrete + CSP4J - MCRW Engine 2008-05-301114615MSAT (TO)2 3600.04 3616.62
Concrete + CSP4J - Tabu Engine 2008-05-301114616MSAT (TO)2 3600.07 3605.22

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: 2
Solution found:
0 1 6 9 7 1 0 3 3 0 5 1 9 0 0 4 0 0 8 0 6 1 2 0 6 7 0 6 0 9 4 5 9