CSP 2008 Competition: solvers results per benchmarks

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

Name	csp/aim-50/ normalized-aim-50-6-0-sat-4_ext.xml
MD5SUM	e7463865184f91144af9492a7dc22538
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.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables	50
Number of constraints	273
Maximum constraint arity	3
Maximum domain size	2
Number of constraints which are defined in extension	273
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-prime 1.313	1052821	SAT	0.010997	0.018828
MDG-noprobe 2008-06-27	1052811	SAT	0.011997	0.0190361
MDG-probe 2008-06-27	1052810	SAT	0.011998	0.0132119
Mistral-option 1.314	1052820	SAT	0.012997	0.020618
casper zao	1052822	SAT	0.016997	0.0260579
casper zito	1052823	SAT	0.017997	0.0249129
cpHydra k_40	1052827	SAT	0.021996	0.0301079
cpHydra k_10	1052826	SAT	0.023995	0.0303999
spider 2008-06-14	1052809	SAT	0.024995	0.0490289
bpsolver 2008-06-27	1052815	SAT	0.06199	0.067501
mddc-solv 2008-06-09	1052808	SAT	0.069989	0.0760991
Minion/Tailor 2008-07-04	1105088	SAT	0.416936	0.456325
Concrete + CPS4J 2008-05-30	1052807	SAT	0.438932	0.477064
Concrete + CSP4J - WMC Engine 2008-05-30	1052806	SAT	0.438933	0.485335
choco2_impwdeg 2008-06-26	1052816	SAT	0.505922	0.518721
choco2_dwdeg 2008-06-26	1052817	SAT	0.535918	0.586565
Sugar v1.13+minisat	1052814	SAT	0.748885	0.852849
Abscon 112v4 AC	1052824	SAT	0.84887	0.906933
SAT4J CSP 2008-06-13	1052812	SAT	0.854869	0.870404
Abscon 112v4 ESAC	1052825	SAT	0.871867	0.892507
Sugar v1.13+picosat	1052813	SAT	0.902861	0.975651
galac M	1052818	SAT	0.997847	1.03565
galac E	1052819	SAT	1.20182	1.26514
Concrete + CSP4J - Tabu Engine 2008-05-30	1052805	SAT	2.91156	2.93887

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