CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-50-2-0-1.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-50-2-0-1.xml
MD5SUM4e9b0cd45adc1e97ee302e19b3bc6896
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.036993
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints150
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension150
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131063231SAT 0.036993 0.0432799
Mistral-option 1.3141063230SAT 0.046992 0.052843
MDG-noprobe 2008-06-271063221SAT 0.072988 0.149985
cpHydra k_401063237SAT 0.072988 0.088624
cpHydra k_101063236SAT 0.080987 0.087641
casper zito1063233SAT 0.182971 0.189711
MDG-probe 2008-06-271063220SAT 0.197969 0.20467
casper zao1063232SAT 0.202968 0.21092
Minion/Tailor 2008-07-041106298SAT 0.500923 0.556894
Sugar v1.13+picosat1063223SAT 0.730888 0.796236
Sugar v1.13+minisat1063224SAT 0.745886 0.875218
Concrete + CPS4J 2008-05-301063219SAT 0.831873 0.864081
Abscon 112v4 ESAC1063235SAT 0.940856 1.00034
choco2_dwdeg 2008-06-261063227SAT 0.944856 1.00371
Abscon 112v4 AC1063234SAT 1.01684 1.05286
SAT4J CSP 2008-06-131063222SAT 1.18682 1.24648
choco2_impwdeg 2008-06-261063226SAT 1.19482 1.26975
galac M1063228SAT 1.43578 1.50713
galac E1063229SAT 1.54276 1.6068
Concrete + CSP4J - Tabu Engine 2008-05-301063217SAT 5.32219 5.38361
bpsolver 2008-06-271063225SAT 6.47901 6.5099
Concrete + CSP4J - WMC Engine 2008-05-301063218? (TO) 1800.09 1811.32

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