CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/aim-50/
normalized-aim-50-2-0-sat-1_ext.xml

Name	csp/aim-50/ normalized-aim-50-2-0-sat-1_ext.xml
MD5SUM	000aa20ebf6fadca94eb5821ad5a7d8d
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.007998
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	94
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	94
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
Mistral-option 1.314	1053326	SAT	0.007998	0.0152091
MDG-noprobe 2008-06-27	1053317	SAT	0.008998	0.0151299
Mistral-prime 1.313	1053327	SAT	0.009997	0.0158259
casper zao	1053328	SAT	0.011997	0.0190579
casper zito	1053329	SAT	0.013997	0.021732
spider 2008-06-14	1053315	SAT	0.016996	0.0221019
cpHydra k_10	1053332	SAT	0.020996	0.0276569
cpHydra k_40	1053333	SAT	0.020996	0.0277151
MDG-probe 2008-06-27	1053316	SAT	0.022995	0.030802
mddc-solv 2008-06-09	1053314	SAT	0.040992	0.047679
bpsolver 2008-06-27	1053321	SAT	0.207967	0.209013
Minion/Tailor 2008-07-04	1105110	SAT	0.331949	0.395406
Concrete + CSP4J - WMC Engine 2008-05-30	1053312	SAT	0.38594	0.42672
choco2_dwdeg 2008-06-26	1053323	SAT	0.392939	0.414692
Concrete + CPS4J 2008-05-30	1053313	SAT	0.393939	0.424659
choco2_impwdeg 2008-06-26	1053322	SAT	0.454929	0.473403
Concrete + CSP4J - Tabu Engine 2008-05-30	1053311	SAT	0.52292	0.574142
Sugar v1.13+picosat	1053319	SAT	0.603907	0.703339
Sugar v1.13+minisat	1053320	SAT	0.608907	0.704517
SAT4J CSP 2008-06-13	1053318	SAT	0.758884	0.764383
Abscon 112v4 ESAC	1053331	SAT	0.788879	0.848731
galac E	1053325	SAT	0.819874	0.881474
galac M	1053324	SAT	0.854869	0.883805
Abscon 112v4 AC	1053330	SAT	0.871867	0.890333

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

Solution found:

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