MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-2-0-unsat-3_ext.xml
MD5SUM9cbd833f9b40063f36b783537b176db9
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 benchmark3.67444
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints388
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension388
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-inc1111257OPTIMUM1 3.67444 4.00912
Sugar v1.13+minisat1111258OPTIMUM1 4.89125 5.25194
AbsconMax 112 pc-w1111255OPTIMUM1 33.3729 33.8454
toulbar2 2008-06-271111260OPTIMUM1 72.194 72.8285
toulbar2/BTD 2008-06-271111259OPTIMUM1 263.636 265.916
Concrete + CSP4J - MCRW Engine 2008-05-301111253MSAT (TO)1 3600.03 3601.82
Concrete + CSP4J - Tabu Engine 2008-05-301111254MSAT (TO)1 3600.07 3600.23
AbsconMax 112 pc-d1111256MSAT (TO)1 3600.1 3617.44

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