CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/ukVg/
normalized-crossword-m1c-uk-vg12-16_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg12-16_ext.xml
MD5SUMf287c84d8577f2bfbdab74ac2a5f1147
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark38.7951
Satisfiable
(Un)Satisfiability was proved
Number of variables192
Number of constraints28
Maximum constraint arity16
Maximum domain size26
Number of constraints which are defined in extension28
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Abscon 112v4 AC1068604UNSAT 38.7951 39.1826
Abscon 112v4 ESAC1068605UNSAT 42.2626 42.6969
cpHydra k_101068606UNSAT 42.3326 42.5676
cpHydra k_401068607UNSAT 42.6155 42.8835
MDG-noprobe 2008-06-271068591UNSAT 53.4099 53.458
Mistral-prime 1.3131068601UNSAT 70.8392 71.1234
Mistral-option 1.3141068600UNSAT 73.7598 73.9284
Concrete + CPS4J 2008-05-301068587UNSAT 102.551 102.667
MDG-probe 2008-06-271068590UNSAT 127.349 128.568
choco2_dwdeg 2008-06-261068597UNSAT 168.867 170.489
mddc-solv 2008-06-091068588UNSAT 257.618 259.646
casper zito1068603UNSAT 408.287 408.411
casper zao1068602UNSAT 467.097 467.732
choco2_impwdeg 2008-06-261068596UNSAT 939.667 944.348
Minion/Tailor 2008-07-041107320UNSAT 1368.84 1373.17
galac E1068599UNSAT 1462.49 1470.73
SAT4J CSP 2008-06-131068592? 87.2367 84.0879
Concrete + CSP4J - Tabu Engine 2008-05-301068585? (TO) 1800 1800.92
spider 2008-06-141068589? (TO) 1800.04 1801.51
Concrete + CSP4J - WMC Engine 2008-05-301068586? (TO) 1800.05 1803.22
galac M1068598? (TO) 1800.06 1812.01
bpsolver 2008-06-271068595? (TO) 1800.09 1808.36
Sugar v1.13+picosat1068593? (TO) 1800.15 1803.73
Sugar v1.13+minisat1068594? (TO) 1800.17 1804.14

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found: