CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-200/
normalized-aim-200-2-0-sat-3_ext.xml
MD5SUM65c49088f06904047b1e43c75dea9802
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.031994
Satisfiable
(Un)Satisfiability was proved
Number of variables200
Number of constraints387
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension387
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
Mistral-option 1.3141054019SAT 0.031994 0.0548151
MDG-probe 2008-06-271054009SAT 0.060989 0.061134
Mistral-prime 1.3131054020SAT 0.070988 0.0768469
MDG-noprobe 2008-06-271054010SAT 0.084986 0.0858061
cpHydra k_401054026SAT 0.088986 0.095788
cpHydra k_101054025SAT 0.090985 0.095687
spider 2008-06-141054008SAT 0.150976 0.154224
mddc-solv 2008-06-091054007SAT 0.170973 0.176578
casper zao1054021SAT 0.25496 0.261801
casper zito1054022SAT 0.315951 0.329622
Concrete + CPS4J 2008-05-301054006SAT 0.605907 0.641774
Minion/Tailor 2008-07-041105059SAT 0.664898 0.710799
Sugar v1.13+picosat1054012SAT 0.874866 0.985063
Sugar v1.13+minisat1054013SAT 0.941856 1.05681
Abscon 112v4 ESAC1054024SAT 1.04184 1.09373
choco2_impwdeg 2008-06-261054015SAT 1.06284 1.10218
SAT4J CSP 2008-06-131054011SAT 1.11483 1.15959
Abscon 112v4 AC1054023SAT 1.12483 1.16127
galac E1054018SAT 1.20282 1.23598
galac M1054017SAT 1.61275 1.64786
choco2_dwdeg 2008-06-261054016SAT 1.74273 1.77961
bpsolver 2008-06-271054014? (TO) 1800.05 1810.41
Concrete + CSP4J - WMC Engine 2008-05-301054005? (TO) 1800.08 1817.02
Concrete + CSP4J - Tabu Engine 2008-05-301054004? (TO) 1800.09 1807.92

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