MAX-CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
maxcsp/maxclique/
normalized-san-200-0.9-1_ext.xml

Jump to solvers results

General information on the benchmark

Namemaxcsp/maxclique/
normalized-san-200-0.9-1_ext.xml
MD5SUMec09a804c09aaa322f6fd8e97a237831
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMSAT TO
Best Number of falsified constraints130
Best CPU time to get the best result obtained on this benchmark1632.59
Satisfiable
(Un)Satisfiability was proved
Number of variables201
Number of constraints2190
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension2190
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
toulbar2/BTD 2008-06-271126453OPTIMUM130 43.5474 43.7299
AbsconMax 112 pc-d1126450MSAT (TO)130 1632.59 4000.04
AbsconMax 112 pc-w1126449MSAT (TO)130 1646.05 4000.06
Concrete + CSP4J - MCRW Engine 2008-05-301126447MSAT (TO)130 3600.02 3623.82
Concrete + CSP4J - Tabu Engine 2008-05-301126448MSAT (TO)130 3600.07 3633.62
Sugar++ v1.13+minisat-inc1126451MSAT (TO)260 3600.25 3608.72
Sugar v1.13+minisat1126452MSAT (TO)263 3600.09 3610.42
toulbar2 2008-06-271126454? (TO) 3600.04 3634.21

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: 130
Solution found:
1 1 0 0 1 0 1 1 0 0 1 0 0 0 1 1 0 0 0 0 1 1 1 1 0 1 1 0 0 0 0 1 1 0 0 0 0 1 1 1 0 0 1 0 0 0 0 1 0 0 0 0 1 1 0 1 0 0 0 1 1 1 0 0 0 0 0 1 1 0
1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
0 1 0 0 0 1 1 0 0 0 1 0 0 0 1 0 0 1 1 1 0 1 1 1 1 0 1 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 0 0 1 0 1 -1