CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-50-6-0-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-50-6-0-3.xml
MD5SUM8b53de88c2fd3bfb1e1030b07b206fc4
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.027994
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints350
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension350
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
casper zito1063065SAT 0.027994 0.035032
MDG-noprobe 2008-06-271063053SAT 0.027995 0.0348661
Mistral-prime 1.3131063063SAT 0.037994 0.0429799
cpHydra k_401063069SAT 0.039993 0.0398049
casper zao1063064SAT 0.043992 0.0511199
cpHydra k_101063068SAT 0.046991 0.0525579
Mistral-option 1.3141063062SAT 0.048992 0.0500719
MDG-probe 2008-06-271063052SAT 0.052991 0.130753
bpsolver 2008-06-271063057SAT 0.091985 0.093222
Minion/Tailor 2008-07-041106302SAT 0.857869 0.930367
Sugar v1.13+minisat1063056SAT 0.968852 1.09134
Concrete + CPS4J 2008-05-301063051SAT 0.991848 1.01577
choco2_impwdeg 2008-06-261063058SAT 1.01584 1.04972
choco2_dwdeg 2008-06-261063059SAT 1.07684 1.10463
Concrete + CSP4J - WMC Engine 2008-05-301063050SAT 1.08083 1.10204
Abscon 112v4 ESAC1063067SAT 1.10583 1.19502
Sugar v1.13+picosat1063055SAT 1.10683 1.21147
Concrete + CSP4J - Tabu Engine 2008-05-301063049SAT 1.11383 1.17087
Abscon 112v4 AC1063066SAT 1.18582 1.21003
galac M1063060SAT 1.60976 1.67045
SAT4J CSP 2008-06-131063054SAT 1.72274 1.7685
galac E1063061SAT 1.79973 1.89369

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