CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/pseudo/aim/
normalized-aim-50-3-4-4.xml
MD5SUM656b15a0710b6fdc6e25b9bd46b50ac7
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.038993
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
MDG-noprobe 2008-06-271062990SAT 0.038993 0.0457811
Mistral-option 1.3141062999SAT 0.044992 0.0535309
Mistral-prime 1.3131063000SAT 0.044992 0.049496
casper zito1063002SAT 0.055991 0.0622779
cpHydra k_101063005SAT 0.05699 0.0635379
cpHydra k_401063006SAT 0.056991 0.0631689
casper zao1063001SAT 0.06099 0.0667939
bpsolver 2008-06-271062994SAT 0.078987 0.0865681
MDG-probe 2008-06-271062989SAT 0.349946 0.358133
Minion/Tailor 2008-07-041106300SAT 0.608906 0.657274
Sugar v1.13+minisat1062993SAT 0.784879 0.854194
Sugar v1.13+picosat1062992SAT 0.813875 0.88772
Concrete + CPS4J 2008-05-301062988SAT 0.90986 0.962041
choco2_dwdeg 2008-06-261062996SAT 0.972851 0.989895
Abscon 112v4 ESAC1063004SAT 0.993847 1.04798
Abscon 112v4 AC1063003SAT 1.02684 1.05394
choco2_impwdeg 2008-06-261062995SAT 1.04384 1.10345
Concrete + CSP4J - WMC Engine 2008-05-301062987SAT 1.07983 1.14472
Concrete + CSP4J - Tabu Engine 2008-05-301062986SAT 1.16082 1.21103
galac M1062997SAT 1.38479 1.45491
galac E1062998SAT 1.41678 1.46599
SAT4J CSP 2008-06-131062991SAT 1.75873 1.76287

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