MAX-CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-2-0-unsat-2_ext.xml
MD5SUMcb66ee77cedabd42a0dae2d031f5b84e
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 benchmark1.9877
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints192
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension192
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-inc1111735OPTIMUM1 1.9877 1.8632
Sugar v1.13+minisat1111736OPTIMUM1 2.39663 2.58024
toulbar2 2008-06-271111738OPTIMUM1 3.66244 3.6823
toulbar2/BTD 2008-06-271111737OPTIMUM1 4.40133 4.45269
AbsconMax 112 pc-w1111733OPTIMUM1 31.8942 32.1166
Concrete + CSP4J - Tabu Engine 2008-05-301111732MSAT (TO)1 3600.01 3601.33
Concrete + CSP4J - MCRW Engine 2008-05-301111731MSAT (TO)1 3600.02 3631.62
AbsconMax 112 pc-d1111734MSAT (TO)1 3600.09 3601.84

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