MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-1-6-unsat-4_ext.xml
MD5SUM4428e7a4652a04be44453e1e0e642b1b
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.04254
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints316
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension316
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-inc1111265OPTIMUM1 3.04254 3.48422
Sugar v1.13+minisat1111266OPTIMUM1 3.9424 4.22899
AbsconMax 112 pc-w1111263OPTIMUM1 35.3796 35.7775
toulbar2 2008-06-271111268OPTIMUM1 462.184 466.133
toulbar2/BTD 2008-06-271111267OPTIMUM1 613.418 615.823
Concrete + CSP4J - MCRW Engine 2008-05-301111261MSAT (TO)1 3600 3634.12
AbsconMax 112 pc-d1111264MSAT (TO)1 3600.04 3612.53
Concrete + CSP4J - Tabu Engine 2008-05-301111262MSAT (TO)1 3600.07 3601.52

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