2017 XCSP3 competition: mini-solver track (sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
Sat/Sat-m1-aim100/
aim-100-2-0-unsat-2.xml

Jump to solvers results

General information on the benchmark

NameSat/Sat-m1-aim100/
aim-100-2-0-unsat-2.xml
MD5SUM8177bfdfc8e0bc0efe17d41d3961e832
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.016452
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints192
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":100}]
Minimum variable degree4
Maximum variable degree6
Distribution of variable degrees[{"degree":4,"count":5},{"degree":5,"count":14},{"degree":6,"count":81}]
Minimum constraint arity3
Maximum constraint arity3
Distribution of constraint arities[{"arity":3,"count":192}]
Number of extensional constraints192
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":192}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
cosoco-mini 1.1 (2017-06-27) (complete)4252051UNSAT 0.011691 0.0120289
cosoco-mini 1.12 (complete)4267453UNSAT 0.016452 0.01749
cosoco-mini 1.1 (2017-07-29) (complete)4260272UNSAT 0.016869999 0.13468599
miniBTD 2017-06-30 (complete)4252050UNSAT 0.019864 0.021222
miniBTD 2017-08-10 (complete)4265012UNSAT 0.020028001 0.020591
Naxos 1.1.0 (complete)4252052? (TO) 2400.08 2400

Additionnal information

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

objective function:
Solution found: