CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/pseudo/aim/
normalized-aim-50-3-4-1.xml

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-50-3-4-1.xml
MD5SUMbe47c9d3d6f784dcf49c41b44e5137d6
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.018996
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints220
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension220
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-prime 1.3131062937SAT 0.018996 0.0247571
MDG-noprobe 2008-06-271062927SAT 0.025995 0.0321589
casper zito1062939SAT 0.035993 0.043444
cpHydra k_401062943SAT 0.040993 0.0482099
cpHydra k_101062942SAT 0.042993 0.0486189
casper zao1062938SAT 0.046992 0.0543931
Mistral-option 1.3141062936SAT 0.063989 0.070323
bpsolver 2008-06-271062931SAT 0.080986 0.090591
MDG-probe 2008-06-271062926SAT 0.362944 0.369399
Minion/Tailor 2008-07-041106299SAT 0.598908 0.659705
Sugar v1.13+picosat1062929SAT 0.842871 0.950115
Sugar v1.13+minisat1062930SAT 0.855868 0.962413
choco2_impwdeg 2008-06-261062932SAT 0.900862 0.938331
Abscon 112v4 ESAC1062941SAT 0.957854 0.999517
choco2_dwdeg 2008-06-261062933SAT 0.966852 0.997744
Abscon 112v4 AC1062940SAT 0.992848 0.996441
Concrete + CPS4J 2008-05-301062925SAT 1.00385 1.0522
Concrete + CSP4J - WMC Engine 2008-05-301062924SAT 1.10983 1.16733
galac M1062934SAT 1.35879 1.4978
Concrete + CSP4J - Tabu Engine 2008-05-301062923SAT 1.63875 1.68682
galac E1062935SAT 1.69074 1.93645
SAT4J CSP 2008-06-131062928SAT 1.74073 1.76317

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