MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/composed-25-1-40/
normalized-composed-25-1-40-0_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/composed-25-1-40/
normalized-composed-25-1-40-0_ext.xml
MD5SUMb62793c8560f268511dfeafda304a0f0
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of falsified constraints1
Best CPU time to get the best result obtained on this benchmark0.037993
Satisfiable
(Un)Satisfiability was proved
Number of variables33
Number of constraints262
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension262
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-271114838OPTIMUM1 0.037993 0.0384099
toulbar2/BTD 2008-06-271114837OPTIMUM1 0.237963 0.245
Sugar++ v1.13+minisat-inc1114835OPTIMUM1 2.68459 2.55409
Sugar v1.13+minisat1114836OPTIMUM1 3.44648 3.71625
AbsconMax 112 pc-d1114834OPTIMUM1 31.1713 31.7544
AbsconMax 112 pc-w1114833OPTIMUM1 31.3662 32.7681
Concrete + CSP4J - MCRW Engine 2008-05-301114831MSAT (TO)1 3600.05 3627.82
Concrete + CSP4J - Tabu Engine 2008-05-301114832MSAT (TO)1 3600.09 3621.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:
0 2 6 0 3 8 0 1 1 2 1 5 0 2 0 4 4 9 0 1 0 6 1 3 4 7 3 2 8 4 3 0 0