CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/aim-100/
normalized-aim-100-3-4-sat-4_ext.xml
MD5SUM5ab54db73308b33bd9b24a33e38c0135
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.014997
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints317
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension317
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-prime 1.3131054977SAT 0.014997 0.0219359
MDG-noprobe 2008-06-271054967SAT 0.015997 0.0219101
Mistral-option 1.3141054976SAT 0.022996 0.028581
cpHydra k_101054982SAT 0.026995 0.0341361
cpHydra k_401054983SAT 0.027995 0.0333501
casper zao1054978SAT 0.037993 0.042848
spider 2008-06-141054965SAT 0.05699 0.0641031
mddc-solv 2008-06-091054964SAT 0.06199 0.067917
casper zito1054979SAT 0.084986 0.0902361
MDG-probe 2008-06-271054966SAT 0.086986 0.0906191
bpsolver 2008-06-271054971SAT 0.12198 0.129084
Minion/Tailor 2008-07-041105127SAT 0.441931 0.458395
Concrete + CSP4J - WMC Engine 2008-05-301054962SAT 0.499923 0.532069
Concrete + CPS4J 2008-05-301054963SAT 0.500923 0.529582
Concrete + CSP4J - Tabu Engine 2008-05-301054961SAT 0.59091 0.602981
choco2_impwdeg 2008-06-261054972SAT 0.622904 0.677473
choco2_dwdeg 2008-06-261054973SAT 0.752884 0.78715
Sugar v1.13+minisat1054970SAT 0.830872 0.923831
Sugar v1.13+picosat1054969SAT 0.871866 0.94331
SAT4J CSP 2008-06-131054968SAT 0.960853 1.03141
Abscon 112v4 ESAC1054981SAT 0.998847 1.05478
Abscon 112v4 AC1054980SAT 1.04284 1.09912
galac E1054975SAT 1.11483 1.19107
galac M1054974SAT 1.18382 1.27002

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