CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-3-4-sat-2_ext.xml
MD5SUM06510fcfcaaf03a16dba4e22bc6012db
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.015997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints316
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension316
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-271055082SAT 0.015997 0.0230969
Mistral-prime 1.3131055092SAT 0.015997 0.015154
Mistral-option 1.3141055091SAT 0.017997 0.016955
cpHydra k_401055098SAT 0.026995 0.0331699
cpHydra k_101055097SAT 0.026995 0.0329781
spider 2008-06-141055080SAT 0.036994 0.0435749
casper zao1055093SAT 0.044992 0.050745
mddc-solv 2008-06-091055079SAT 0.077987 0.0838869
MDG-probe 2008-06-271055081SAT 0.106983 0.113249
bpsolver 2008-06-271055086SAT 0.137978 0.14626
casper zito1055094SAT 0.179972 0.180603
Concrete + CPS4J 2008-05-301055078SAT 0.499923 0.548906
Concrete + CSP4J - WMC Engine 2008-05-301055077SAT 0.506922 0.528913
Concrete + CSP4J - Tabu Engine 2008-05-301055076SAT 0.51892 0.531373
Minion/Tailor 2008-07-041105132SAT 0.527919 0.569938
choco2_dwdeg 2008-06-261055088SAT 0.756884 0.787904
choco2_impwdeg 2008-06-261055087SAT 0.761883 0.792229
Sugar v1.13+minisat1055085SAT 0.878866 0.961399
Sugar v1.13+picosat1055084SAT 0.920859 1.03368
Abscon 112v4 AC1055095SAT 0.940856 0.993468
Abscon 112v4 ESAC1055096SAT 0.98085 0.992007
SAT4J CSP 2008-06-131055083SAT 1.00685 1.029
galac M1055089SAT 1.21381 1.25539
galac E1055090SAT 1.24981 1.31169

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