CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-3-4-sat-4_ext.xml
MD5SUM	69858070671b9ebf642a9e96d77714e1
Bench Category	N-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.009998
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	159
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	159
Number of constraints which are defined in intension	0
Global constraints used (with number of constraints)

Solver Name	TraceID	Answer	CPU time	Wall clock time
MDG-probe 2008-06-27	1053086	SAT	0.009997	0.011731
Mistral-prime 1.313	1053097	SAT	0.009998	0.0163899
MDG-noprobe 2008-06-27	1053087	SAT	0.010998	0.0164451
Mistral-option 1.314	1053096	SAT	0.011997	0.016998
casper zito	1053099	SAT	0.015997	0.0221149
casper zao	1053098	SAT	0.015997	0.021398
spider 2008-06-14	1053085	SAT	0.018996	0.0247249
cpHydra k_40	1053103	SAT	0.019996	0.0277789
cpHydra k_10	1053102	SAT	0.021996	0.021143
bpsolver 2008-06-27	1053091	SAT	0.046992	0.0557089
mddc-solv 2008-06-09	1053084	SAT	0.05899	0.0638559
Minion/Tailor 2008-07-04	1105100	SAT	0.363944	0.393506
Concrete + CSP4J - Tabu Engine 2008-05-30	1053081	SAT	0.395939	0.421203
Concrete + CPS4J 2008-05-30	1053083	SAT	0.405937	0.430617
Concrete + CSP4J - WMC Engine 2008-05-30	1053082	SAT	0.429933	0.483673
choco2_dwdeg 2008-06-26	1053093	SAT	0.485925	0.528464
choco2_impwdeg 2008-06-26	1053092	SAT	0.530918	0.577961
Sugar v1.13+minisat	1053090	SAT	0.641902	0.764585
Sugar v1.13+picosat	1053089	SAT	0.667898	0.801266
Abscon 112v4 ESAC	1053101	SAT	0.77988	0.835108
Abscon 112v4 AC	1053100	SAT	0.78288	0.803079
SAT4J CSP 2008-06-13	1053088	SAT	0.831872	0.868102
galac E	1053095	SAT	0.885865	0.981679
galac M	1053094	SAT	1.14382	1.19883

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:

0 0 1 1 1 1 0 0 1 1 0 0 0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 1 0 1 0 1 1 1 0 1 0 0 1 0 0 0 1 0 0 0 0 1 0 1