0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2666417-1276647206.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1264 impls, 0 clqs
0.00/0.03 c (round 2) 20 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1799 impls, 0 clqs
0.00/0.04 c (round 3) 31 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 41 chg coeffs, 8 upgd conss, 2199 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 8 upgd conss, 2519 impls, 0 clqs
0.00/0.04 c (round 5) 51 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 8 upgd conss, 2759 impls, 0 clqs
0.00/0.05 c (round 6) 61 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 65 chg coeffs, 8 upgd conss, 2919 impls, 0 clqs
0.00/0.05 c (round 7) 71 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.00/0.05 c (round 8) 81 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 8 upgd conss, 2999 impls, 0 clqs
0.05/0.07 c (0.0s) probing: 151/199 (75.9%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.05/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.05/0.07 c presolving (9 rounds):
0.05/0.07 c 81 deleted vars, 57 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 81 changed coefficients
0.05/0.07 c 3027 implications, 0 cliques
0.05/0.07 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 126 constraints
0.05/0.07 c 110 constraints of type <and>
0.05/0.07 c 7 constraints of type <linear>
0.05/0.07 c 9 constraints of type <logicor>
0.05/0.07 c transformed objective value is always integral (scale: 2)
0.05/0.07 c Presolving Time: 0.04
0.05/0.07 c - non default parameters ----------------------------------------------------------------------
0.05/0.07 c # SCIP version 1.2.1.2
0.05/0.07 c
0.05/0.07 c # frequency for displaying node information lines
0.05/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.05/0.07 c display/freq = 10000
0.05/0.07 c
0.05/0.07 c # maximal time in seconds to run
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.07 c limits/time = 1800
0.05/0.07 c
0.05/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.05/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.05/0.07 c limits/memory = 1620
0.05/0.07 c
0.05/0.07 c # should presolving try to simplify inequalities
0.05/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.07 c constraints/linear/simplifyinequalities = TRUE
0.05/0.07 c
0.05/0.07 c # should presolving try to simplify knapsacks
0.05/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.05/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.05/0.07 c
0.05/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.07 c heuristics/undercover/freq = 0
0.05/0.07 c
0.05/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.05/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.05/0.07 c separating/rapidlearning/freq = 0
0.05/0.07 c
0.05/0.07 c -----------------------------------------------------------------------------------------------
0.05/0.07 c start solving
0.05/0.07 c
0.05/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.05/0.07 c 0.0s| 1 | 0 | 18 | - |1021k| 0 | 9 | 199 | 126 | 199 | 235 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 308 | - |1050k| 0 | 30 | 199 | 126 | 199 | 246 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 325 | - |1107k| 0 | 39 | 199 | 126 | 199 | 265 | 30 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.19 c 0.1s| 1 | 0 | 347 | - |1150k| 0 | 51 | 199 | 126 | 199 | 283 | 48 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 384 | - |1199k| 0 | 53 | 199 | 126 | 199 | 298 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 412 | - |1230k| 0 | 61 | 199 | 126 | 199 | 311 | 76 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 470 | - |1260k| 0 | 68 | 199 | 126 | 199 | 325 | 90 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.50 c 0.4s| 1 | 2 | 470 | - |1260k| 0 | 68 | 199 | 126 | 199 | 325 | 90 | 0 | 17 | 3.000000e+00 | -- | Inf
1.10/1.13 o 7
1.10/1.13 c * 1.0s| 111 | 56 | 1367 | 8.2 |1358k| 39 | - | 199 | 168 | 199 | 160 | 361 | 42 | 648 | 3.000000e+00 | 7.000000e+00 | 133.33%
1.10/1.13 o 3
1.10/1.13 c * 1.0s| 115 | 0 | 1368 | 7.9 |1335k| 39 | - | 199 | 164 | 199 | 152 | 361 | 46 | 648 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.10/1.13 c
1.10/1.13 c SCIP Status : problem is solved [optimal solution found]
1.10/1.13 c Solving Time (sec) : 1.02
1.10/1.13 c Solving Nodes : 115
1.10/1.13 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.10/1.13 c Dual Bound : +3.00000000000000e+00
1.10/1.13 c Gap : 0.00 %
1.10/1.13 s OPTIMUM FOUND
1.10/1.13 v -x105 -x104 -x103 -x102 -x101 x100 x99 x98 x97 -x96 -x70 -x69 -x68 -x67 x66 -x95 -x94 -x93 x92 -x91 x65 x64 x63 x62 x61 x90 x89
1.10/1.13 v -x88 x87 -x86 -x60 -x59 x58 -x57 x56 -x85 x84 x83 x82 -x81 x55 x54 -x53 x52 x51 -x80 x79 -x78 -x77 -x76 x50 -x49 -x48 x47 x46
1.10/1.13 v -x75 -x74 -x73 -x72 x71 x45 x44 -x43 -x42 x41 -x40 x39 -x38 x37 x36 x35 x34 x33 x32 x31 x30 -x29 -x28 x27 x26 x25 x24 x23 x22
1.10/1.13 v x21 x20 x19 -x18 -x17 x16 -x15 x14 -x13 x12 x11 x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
1.10/1.13 c SCIP Status : problem is solved [optimal solution found]
1.10/1.13 c Solving Time : 1.02
1.10/1.13 c Original Problem :
1.10/1.13 c Problem name : HOME/instance-2666417-1276647206.opb
1.10/1.13 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.13 c Constraints : 190 initial, 190 maximal
1.10/1.13 c Presolved Problem :
1.10/1.13 c Problem name : t_HOME/instance-2666417-1276647206.opb
1.10/1.13 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.13 c Constraints : 126 initial, 169 maximal
1.10/1.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.10/1.13 c trivial : 0.00 0 0 0 0 0 0 0 0
1.10/1.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.10/1.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.10/1.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.10/1.13 c implics : 0.00 0 0 0 0 0 0 0 0
1.10/1.13 c probing : 0.01 0 0 0 0 0 0 0 0
1.10/1.13 c and : 0.01 14 57 0 0 0 57 0 57
1.10/1.13 c linear : 0.00 2 8 0 0 0 0 0 24
1.10/1.13 c logicor : 0.00 0 0 0 0 0 0 0 0
1.10/1.13 c root node : - 12 - - 12 - - - -
1.10/1.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.10/1.13 c integral : 0 0 0 104 0 0 20 0 0 174
1.10/1.13 c and : 110 209 662 1 0 8 320 287 0 0
1.10/1.13 c linear : 7 6 653 1 0 23 190 0 0 0
1.10/1.13 c logicor : 9+ 6 161 2 0 0 20 0 0 0
1.10/1.13 c countsols : 0 0 0 2 0 0 0 0 0 0
1.10/1.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.10/1.13 c integral : 0.60 0.00 0.00 0.60 0.00
1.10/1.13 c and : 0.01 0.00 0.01 0.00 0.00
1.10/1.13 c linear : 0.00 0.00 0.00 0.00 0.00
1.10/1.13 c logicor : 0.01 0.00 0.01 0.00 0.00
1.10/1.13 c countsols : 0.00 0.00 0.00 0.00 0.00
1.10/1.13 c Propagators : Time Calls Cutoffs DomReds
1.10/1.13 c vbounds : 0.00 2 0 0
1.10/1.13 c rootredcost : 0.00 1 0 2
1.10/1.13 c pseudoobj : 0.00 352 0 2
1.10/1.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.10/1.13 c propagation : 0.00 31 31 160 21.0 4 9.2 -
1.10/1.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.13 c applied globally : - - - 46 12.5 - - -
1.10/1.13 c applied locally : - - - 0 0.0 - - -
1.10/1.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.10/1.13 c cut pool : 0.00 5 - - 57 - (maximal pool size: 235)
1.10/1.13 c redcost : 0.00 210 0 0 0 0
1.10/1.13 c impliedbounds : 0.00 6 0 0 25 0
1.10/1.13 c intobj : 0.00 0 0 0 0 0
1.10/1.13 c cgmip : 0.00 0 0 0 0 0
1.10/1.13 c gomory : 0.06 6 0 0 136 0
1.10/1.13 c strongcg : 0.02 6 0 0 207 0
1.10/1.13 c cmir : 0.03 6 0 0 76 0
1.10/1.13 c flowcover : 0.05 6 0 0 145 0
1.10/1.13 c clique : 0.00 6 0 0 1 0
1.10/1.13 c zerohalf : 0.00 0 0 0 0 0
1.10/1.13 c mcf : 0.00 1 0 0 0 0
1.10/1.13 c rapidlearning : 0.02 1 0 0 0 0
1.10/1.13 c Pricers : Time Calls Vars
1.10/1.13 c problem variables: 0.00 0 0
1.10/1.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.10/1.13 c relpscost : 0.60 102 0 20 0 0 174
1.10/1.13 c pscost : 0.00 0 0 0 0 0 0
1.10/1.13 c inference : 0.00 0 0 0 0 0 0
1.10/1.13 c mostinf : 0.00 0 0 0 0 0 0
1.10/1.13 c leastinf : 0.00 0 0 0 0 0 0
1.10/1.13 c fullstrong : 0.00 0 0 0 0 0 0
1.10/1.13 c allfullstrong : 0.00 0 0 0 0 0 0
1.10/1.13 c random : 0.00 0 0 0 0 0 0
1.10/1.13 c Primal Heuristics : Time Calls Found
1.10/1.13 c LP solutions : 0.00 - 2
1.10/1.13 c pseudo solutions : 0.00 - 0
1.10/1.13 c crossover : 0.00 0 0
1.10/1.13 c coefdiving : 0.00 0 0
1.10/1.13 c pscostdiving : 0.00 0 0
1.10/1.13 c fracdiving : 0.00 0 0
1.10/1.13 c veclendiving : 0.00 0 0
1.10/1.13 c objpscostdiving : 0.00 0 0
1.10/1.13 c rootsoldiving : 0.00 0 0
1.10/1.13 c linesearchdiving : 0.00 0 0
1.10/1.13 c guideddiving : 0.00 0 0
1.10/1.13 c oneopt : 0.00 1 0
1.10/1.13 c feaspump : 0.01 1 0
1.10/1.13 c trivial : 0.01 2 0
1.10/1.13 c simplerounding : 0.00 0 0
1.10/1.13 c zirounding : 0.00 85 0
1.10/1.13 c rounding : 0.02 160 0
1.10/1.13 c shifting : 0.00 16 0
1.10/1.13 c intshifting : 0.00 0 0
1.10/1.13 c twoopt : 0.00 0 0
1.10/1.13 c fixandinfer : 0.00 0 0
1.10/1.13 c intdiving : 0.00 0 0
1.10/1.13 c actconsdiving : 0.00 0 0
1.10/1.13 c octane : 0.00 0 0
1.10/1.13 c rens : 0.01 1 0
1.10/1.13 c rins : 0.00 0 0
1.10/1.13 c localbranching : 0.00 0 0
1.10/1.13 c mutation : 0.00 0 0
1.10/1.13 c dins : 0.00 0 0
1.10/1.13 c undercover : 0.01 1 0
1.10/1.13 c nlp : 0.00 0 0
1.10/1.13 c trysol : 0.00 0 0
1.10/1.13 c LP : Time Calls Iterations Iter/call Iter/sec
1.10/1.13 c primal LP : 0.00 0 0 0.00 -
1.10/1.13 c dual LP : 0.10 213 1094 5.14 10940.00
1.10/1.13 c lex dual LP : 0.00 0 0 0.00 -
1.10/1.13 c barrier LP : 0.00 0 0 0.00 -
1.10/1.13 c diving/probing LP: 0.00 14 274 19.57 -
1.10/1.13 c strong branching : 0.60 648 7206 11.12 12010.00
1.10/1.13 c (at root node) : - 17 1435 84.41 -
1.10/1.13 c conflict analysis: 0.00 0 0 0.00 -
1.10/1.13 c B&B Tree :
1.10/1.13 c number of runs : 1
1.10/1.13 c nodes : 115
1.10/1.13 c nodes (total) : 115
1.10/1.13 c nodes left : 0
1.10/1.13 c max depth : 39
1.10/1.13 c max depth (total): 39
1.10/1.13 c backtracks : 11 (9.6%)
1.10/1.13 c delayed cutoffs : 5
1.10/1.13 c repropagations : 72 (97 domain reductions, 5 cutoffs)
1.10/1.13 c avg switch length: 2.94
1.10/1.13 c switching time : 0.00
1.10/1.13 c Solution :
1.10/1.13 c Solutions found : 2 (2 improvements)
1.10/1.13 c First Solution : +7.00000000000000e+00 (in run 1, after 111 nodes, 1.01 seconds, depth 39, found by <relaxation>)
1.10/1.13 c Primal Bound : +3.00000000000000e+00 (in run 1, after 115 nodes, 1.02 seconds, depth 39, found by <relaxation>)
1.10/1.13 c Dual Bound : +3.00000000000000e+00
1.10/1.13 c Gap : 0.00 %
1.10/1.13 c Root Dual Bound : +3.00000000000000e+00
1.10/1.13 c Root Iterations : 470
1.10/1.14 c Time complete: 1.13.