2018 XCSP3 competition: parallel solvers tracks: solvers results per benchmarks

Result page for benchmark
Frb/
frb-30-15-1_c18.xml

Jump to solvers results

General information on the benchmark

NameFrb/
frb-30-15-1_c18.xml
MD5SUM57df4fffa2265f6a33845f4cc7b1783a
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 benchmark11.905
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints284
Number of domains1
Minimum domain size15
Maximum domain size15
Distribution of domain sizes[{"size":15,"count":30}]
Minimum variable degree11
Maximum variable degree28
Distribution of variable degrees[{"degree":11,"count":1},{"degree":12,"count":1},{"degree":13,"count":1},{"degree":14,"count":2},{"degree":16,"count":3},{"degree":17,"count":1},{"degree":18,"count":3},{"degree":19,"count":2},{"degree":20,"count":3},{"degree":21,"count":8},{"degree":22,"count":2},{"degree":23,"count":1},{"degree":24,"count":1},{"degree":28,"count":1}]
Minimum constraint arity2
Maximum constraint arity2
Distribution of constraint arities[{"arity":2,"count":284}]
Number of extensional constraints284
Number of intensional constraints0
Distribution of constraint types[{"type":"extension","count":284}]
Optimization problemNO
Type of objective

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
scop order+glucose-syrup (2018-07-07) (complete)4297045SAT 11.905 3.42121
scop both+glucose-syrup (2018-07-07) (complete)4297281SAT 12.5874 3.51012
scop both+glucose-syrup (2018-07-31) (complete)4307465SAT 13.343 4.31111
scop order+glucose-syrup (2018-07-31) (complete)4307229SAT 14.597 4.58953
OscaR - Parallel with EPS 2018-08-14 (complete)4309136SAT 15.635 4.59742
OscaR - Parallel with EPS 2018-07-02 (complete)4291367SAT 16.4675 4.72491
Choco-solver 4.0.7b par (e747e1e) (complete)4297780SAT 17.0678 2.75596

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[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20]
x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29]</list> <values>4 3 1 9 13 2 6 8 1 0 8 1 5 9 0 1 1 12 9 8 13 13 5 5 3 8 7 5 5
9</values> </instantiation>