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-army11-17ls.xml

Jump to solvers results

General information on the benchmark

NamePseudoBoolean/PseudoBoolean-dec-armies/
Pb-army11-17ls.xml
MD5SUM3a369118bc0c88105fbaeba7564c3313
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 benchmark18.4026
Satisfiable
(Un)Satisfiability was proved
Number of variables370
Number of constraints557
Number of domains1
Minimum domain size2
Maximum domain size2
Distribution of domain sizes[{"size":2,"count":370}]
Minimum variable degree3
Maximum variable degree13
Distribution of variable degrees[{"degree":3,"count":8},{"degree":4,"count":8},{"degree":5,"count":8},{"degree":6,"count":8},{"degree":7,"count":250},{"degree":8,"count":8},{"degree":9,"count":8},{"degree":10,"count":8},{"degree":11,"count":8},{"degree":12,"count":8},{"degree":13,"count":48}]
Minimum constraint arity2
Maximum constraint arity121
Distribution of constraint arities[{"arity":2,"count":193},{"arity":3,"count":8},{"arity":4,"count":8},{"arity":5,"count":250},{"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":48},{"arity":121,"count":2}]
Number of extensional constraints0
Number of intensional constraints0
Distribution of constraint types[{"type":"sum","count":557}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
PicatSAT 2019-09-12 (complete)4394911SAT 18.4026 18.4057
Fun-sCOP order+GlueMiniSat (2019-06-15) (complete)4388184SAT 31.3178 27.4816
cosoco 2.O parallel (complete)4397991SAT 59.6599 7.5507
cosoco 2.0 parallel (complete)4409251SAT 65.3909 8.2864
Fun-sCOP hybrid+ManyGlucose (2019-06-15) (complete)4392631SAT 71.4445 11.3146
Fun-sCOP hybrid+ManyGlucose (2019-09-22) (complete)4405491SAT 77.4102 12.2973
Fun-sCOP hybrid+CryptoMiniSat (2019-06-15) (complete)4388185SAT 136.055 132.172
Fun-sCOP order+ManyGlucose (2019-06-15) (complete)4392331SAT 365.712 49.3725
Fun-sCOP order+ManyGlucose (2019-09-22) (complete)4405191SAT 366.602 50.4867
choco-solver 2019-09-20 (complete)4403391SAT 393.141 99.818
choco-solver 2019-09-16 (complete)4398891SAT 396.328 100.127
choco-solver 2019-06-14 (complete)4392931SAT 561.508 142.34
choco-solver 2019-09-20 parallel (complete)4404291SAT 812.565 102.97
choco-solver 2019-09-16 parallel (complete)4399491SAT 876.561 111.395
choco-solver 2019-09-24 parallel (complete)4406691SAT 892.335 113.083
choco-solver 2019-06-14 parallel (complete)4393531SAT 1319.89 181.959
cosoco 2.0 (complete)4396711SAT 2269.52 2269.73
cosoco 2 (complete)4389431SAT 2319.35 2319.41
cosoco 2.0 (complete)4407971SAT 2358.17 2358.03
BTD 19.07.01 (complete)4386869? (TO) 2519.92 2520.01
Concrete 3.12.2 (complete)4400691? (TO) 2520.06 2472.83
Concrete 3.12.3 (complete)4402491? (TO) 2520.06 2474.14
AbsCon 2019-07-23 (complete)4390531? (TO) 2520.07 2509.91
Concrete 3.12.2 (complete)4395811? (TO) 2520.07 2482.44
Concrete 3.10 (complete)4387355? (TO) 2520.08 2466.73
choco-solver 2019-09-24 (complete)4405791? (TO) 2520.12 2506.95

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 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0
0 0 1 0 0 0 0 0 0 0 0 0 1 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 0 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 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 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 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0
0 1 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 1 0 1 0 1 0 1 0 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 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 0 0 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1   </values> </instantiation>