CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-100/
normalized-aim-100-3-4-sat-1_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-3-4-sat-1_ext.xml
MD5SUM115f57b50c513b86ba582232a398f2d2
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.016997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints320
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension320
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
MDG-noprobe 2008-06-271054829SAT 0.016997 0.0223221
Mistral-option 1.3141054838SAT 0.017996 0.02584
Mistral-prime 1.3131054839SAT 0.021995 0.028299
MDG-probe 2008-06-271054828SAT 0.022995 0.0305089
cpHydra k_101054844SAT 0.030994 0.0348911
cpHydra k_401054845SAT 0.033994 0.040414
spider 2008-06-141054827SAT 0.035994 0.043173
casper zao1054840SAT 0.039992 0.0400111
casper zito1054841SAT 0.05899 0.0650669
mddc-solv 2008-06-091054826SAT 0.072988 0.0784661
bpsolver 2008-06-271054833SAT 0.095984 0.104321
Concrete + CPS4J 2008-05-301054825SAT 0.489924 0.520723
Minion/Tailor 2008-07-041105121SAT 0.52192 0.567271
choco2_dwdeg 2008-06-261054835SAT 0.587909 0.630261
Concrete + CSP4J - Tabu Engine 2008-05-301054823SAT 0.597908 0.626919
choco2_impwdeg 2008-06-261054834SAT 0.6499 0.679433
Concrete + CSP4J - WMC Engine 2008-05-301054824SAT 0.751885 0.791881
Sugar v1.13+minisat1054832SAT 0.803877 0.873438
Sugar v1.13+picosat1054831SAT 0.931857 1.01292
Abscon 112v4 AC1054842SAT 0.942856 0.978286
Abscon 112v4 ESAC1054843SAT 0.98285 1.04288
SAT4J CSP 2008-06-131054830SAT 1.07983 1.1095
galac E1054837SAT 1.10883 1.13029
galac M1054836SAT 1.3328 1.3939

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