MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-200/
normalized-aim-200-2-0-unsat-2_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-2-0-unsat-2_ext.xml
MD5SUMf87bd53afda0bc6ecd840615fd2e648e
Bench CategoryN-ARY-EXT (n-ary 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 benchmark2.54061
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints383
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension383
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
Sugar++ v1.13+minisat-inc1111281OPTIMUM1 2.54061 2.71838
Sugar v1.13+minisat1111282OPTIMUM1 3.22051 3.48797
AbsconMax 112 pc-w1111279OPTIMUM1 43.4114 44.0522
toulbar2 2008-06-271111284OPTIMUM1 426.483 428.232
toulbar2/BTD 2008-06-271111283OPTIMUM1 1531.4 1544.49
Concrete + CSP4J - Tabu Engine 2008-05-301111278MSAT (TO)1 3600.04 3630.02
AbsconMax 112 pc-d1111280MSAT (TO)1 3600.05 3692.44
Concrete + CSP4J - MCRW Engine 2008-05-301111277MSAT (TO)1 3600.09 3601.43

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:
1 1 0 1 0 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 1 1 0 1 1 0
1 1 0 1 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 0 0 1 0 0 1 0 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 0 0 0 1 0 0 1 0 0 1 0 0 1 1 1 0 0 1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 1 0 0 1 1 1 0 0 1 1 0 1 1 1 1