2018 XCSP3 competition: fast COP track: solvers results per benchmarks

Result page for benchmark
PizzaVoucher/
PizzaVoucher-15b_c18.xml

Jump to solvers results

General information on the benchmark

NamePizzaVoucher/
PizzaVoucher-15b_c18.xml
MD5SUMb017fe45b316a2eca4ba7804b3adba5f
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark42
Best CPU time to get the best result obtained on this benchmark252.063
Satisfiable
(Un)Satisfiability was proved
Number of variables62
Number of constraints163
Number of domains19
Minimum domain size1
Maximum domain size33
Distribution of domain sizes[{"size":1,"count":2},{"size":2,"count":36},{"size":3,"count":5},{"size":4,"count":2},{"size":5,"count":1},{"size":7,"count":1},{"size":33,"count":15}]
Minimum variable degree2
Maximum variable degree47
Distribution of variable degrees[{"degree":2,"count":47},{"degree":46,"count":10},{"degree":47,"count":5}]
Minimum constraint arity2
Maximum constraint arity16
Distribution of constraint arities[{"arity":2,"count":131},{"arity":16,"count":32}]
Number of extensional constraints0
Number of intensional constraints131
Distribution of constraint types[{"type":"intension","count":131},{"type":"count","count":32}]
Optimization problemYES
Type of objectivemin SUM

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerobjective functionCPU timeWall clock time
Mistral-2.0 2018-08-01 (complete)4312620SAT (TO)42 252.014 252.01
Sat4j-CSP 2018-07-11 (complete)4301763SAT (TO)42 252.063 247.919
Concrete 3.9.2-SuperNG (complete)4302732SAT (TO)44 252.077 236.738
Choco-solver 4.0.7b seq (e747e1e) (complete)4301762SAT (TO)45 252.09 247.912
Concrete 3.9.2 (complete)4302382SAT (TO)47 252.06 237.444
cosoco 1.12 (complete)4301764SAT (TO)49 252.014 252.01
OscaR - Conflict Ordering with restarts 2018-08-17 (complete)4312218SAT (TO)54 252.061 246.128
OscaR - Conflict Ordering with restarts 2018-08-14 (complete)4310008SAT (TO)64 252.028 245.817
OscaR - Hybrid 2018-08-14 (complete)4310358? (TO) 252.044 247.129

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: 42
Solution found:
<instantiation type="solution"> <list> v[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] np[0] np[1] np[2]
np[3] np[4] np[5] np[6] np[7] np[8] np[9] np[10] np[11] np[12] np[13] np[14] np[15] nf[0] nf[1] nf[2] nf[3] nf[4] nf[5] nf[6] nf[7] nf[8]
nf[9] nf[10] nf[11] nf[12] nf[13] nf[14] nf[15] pp[0] pp[1] pp[2] pp[3] pp[4] pp[5] pp[6] pp[7] pp[8] pp[9] pp[10] pp[11] pp[12] pp[13]
pp[14] </list> <values> 4 -16 15 15 3 15 4 -4 16 -15 3 15 -3 -15 8 0 0 1 1 0 0 0 0 0 0 0 0 0 0 2 1 0 0 2 2 0 0 0 1 0 0 0 0 0 0 4 1 0 6 0 0 0
0 0 5 0 11 0 0 8 12 0 </values> </instantiation>