MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-200/
normalized-aim-200-1-6-unsat-3_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-1-6-unsat-3_ext.xml
MD5SUMc9914501934e2627c987316219695cae
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.78757
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints309
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension309
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-inc1111289OPTIMUM1 2.78757 3.45932
Sugar v1.13+minisat1111290OPTIMUM1 3.39748 3.33245
toulbar2/BTD 2008-06-271111291OPTIMUM1 258.687 259.73
toulbar2 2008-06-271111292OPTIMUM1 783.953 790.651
AbsconMax 112 pc-w1111287OPTIMUM1 2486.51 2526.81
Concrete + CSP4J - MCRW Engine 2008-05-301111285MSAT (TO)1 3600.06 3603.42
Concrete + CSP4J - Tabu Engine 2008-05-301111286MSAT (TO)1 3600.06 3617.22
AbsconMax 112 pc-d1111288MSAT (TO)1 3600.1 3748.23

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