2019 XCSP3 competition: main track (CSP and COP, sequential and parallel solvers): solvers results per benchmarks

Result page for benchmark
PseudoBoolean/PseudoBoolean-dec-armies/
Pb-army12-21ls.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-dec-armies/
Pb-army12-21ls.xml
MD5SUM23e4294b931acf98fdd35eb0662a4341
Bench CategoryCSP (decision problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark470.531
Satisfiable
(Un)Satisfiability was proved
Number of variables428
Number of constraints644
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":428}]
Minimum variable degree3
Maximum variable degree14
Distribution of variable degrees[{"degree":3,"count":8},{"degree":4,"count":8},{"degree":5,"count":8},{"degree":6,"count":8},{"degree":7,"count":296},{"degree":8,"count":8},{"degree":9,"count":8},{"degree":10,"count":8},{"degree":11,"count":8},{"degree":12,"count":8},{"degree":13,"count":8},{"degree":14,"count":52}]
Minimum constraint arity2
Maximum constraint arity144
Distribution of constraint arities[{"arity":2,"count":222},{"arity":3,"count":8},{"arity":4,"count":8},{"arity":5,"count":296},{"arity":6,"count":8},{"arity":7,"count":8},{"arity":8,"count":8},{"arity":9,"count":8},{"arity":10,"count":8},{"arity":11,"count":8},{"arity":12,"count":8},{"arity":13,"count":52},{"arity":144,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":644}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4395132SAT 470.531 470.55
choco-solver 2019-06-14 (complete)4393152SAT 2067.35 521.12
choco-solver 2019-06-14 parallel (complete)4393752SAT 4591.52 577.08
cosoco 2.0 (complete)4396932? (TO) 2519.51 2520.01
BTD 19.07.01 (complete)4386870? (TO) 2519.83 2520.01
cosoco 2 (complete)4389652? (TO) 2520.02 2519.8
AbsCon 2019-07-23 (complete)4390752? (TO) 2520.04 2509.41
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388188? (TO) 2520.05 2514.52
Concrete 3.12.3 (complete)4402712? (TO) 2520.06 2475.24
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388187? (TO) 2520.07 2514.62
cosoco 2.0 (complete)4408192? (TO) 2520.08 2519.8
Concrete 3.10 (complete)4387356? (TO) 2520.11 2464.33
Concrete 3.12.2 (complete)4396032? (TO) 2520.11 2478.74
choco-solver 2019-09-24 (complete)4406012? (TO) 2520.13 2505.44
Concrete 3.12.2 (complete)4400912? (TO) 2520.13 2472.53
choco-solver 2019-09-16 (complete)4399112? (TO) 2520.52 634.871
choco-solver 2019-09-20 (complete)4403612? (TO) 2520.62 634.799
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392852? (TO) 18270.2 2520.07
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405712? (TO) 18506.9 2520.06
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405412? (TO) 18570 2520.06
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392552? (TO) 18979.5 2520.05
choco-solver 2019-09-16 parallel (complete)4399712? (TO) 20051.5 2520.1
choco-solver 2019-09-24 parallel (complete)4406912? (TO) 20059.7 2520.1
choco-solver 2019-09-20 parallel (complete)4404512? (TO) 20059.8 2520.11
cosoco 2.O parallel (complete)4398212? (TO) 20112 2520.02
cosoco 2.0 parallel (complete)4409472? (TO) 20113.6 2520.02

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:
<instantiation> <list> x[]  </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1
0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1 0 1
0 1 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1   </values> </instantiation>