CSP 2006 Competition (second round): solvers results per benchmarks

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

Name	dimacs/aim-50/ aim-50-2-0-sat-1_ext.xml
MD5SUM	e97bb273bf110a27a8a915866839babf
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.017997
Satisfiable	YES
(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
Tramontane 2006-12-04	243012	SAT	0.017997	0.0201529
Mistral 2006-12-04	243011	SAT	0.018996	0.0277689
CSPtoSAT+minisat 0.3	243014	SAT	0.018996	0.0271781
sugar 0.40	243013	SAT	0.048992	0.920372
CSP4J - MAC 2006-12-19	243007	SAT	0.347946	0.388407
CSP4J - MAC 2007-01-16	272807	SAT	0.354945	0.38689
CSP4J - Combo 2006-12-19	243006	SAT	0.362944	0.393131
BPrologCSPSolver70a 2006-12-13	243002	SAT	0.426934	0.433735
sat4jCSP 1.7 RC BF3	243010	SAT	0.686895	0.521771
Abscon 109 AC	243005	SAT	0.71789	0.7588
SAT4JCSP-CACHED 1.7 RC BF3	243009	SAT	0.723889	0.585573
Abscon 109 ESAC	243004	SAT	0.738887	0.784207
galac 1	243008	SAT	0.933857	1.03871
galacJ beta 1	243003	SAT	0.946855	1.02805