0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703158-1278564513.opb>
0.00/0.01 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 163 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 1012 impls, 0 clqs
0.00/0.02 c (round 2) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 7 upgd conss, 1034 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 160/231 (69.3%) - 0 fixings, 0 aggregations, 27 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 9 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 21 changed coefficients
0.00/0.03 c 1088 implications, 0 cliques
0.00/0.03 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 163 constraints
0.00/0.03 c 149 constraints of type <and>
0.00/0.03 c 6 constraints of type <linear>
0.00/0.03 c 8 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.02
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1790
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c heuristics/undercover/freq = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 15 | - |1032k| 0 | 5 | 231 | 163 | 231 | 309 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.00/0.07 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.10/0.11 c 0.1s| 1 | 0 | 222 | - |1046k| 0 | 6 | 231 | 163 | 231 | 314 | 5 | 0 | 0 | 2.000000e+00 | -- | Inf
0.10/0.12 c 0.1s| 1 | 0 | 239 | - |1066k| 0 | 17 | 231 | 163 | 231 | 338 | 29 | 0 | 0 | 2.000000e+00 | -- | Inf
0.10/0.13 c 0.1s| 1 | 0 | 260 | - |1092k| 0 | 23 | 231 | 163 | 231 | 358 | 49 | 0 | 0 | 2.000000e+00 | -- | Inf
0.10/0.15 c 0.1s| 1 | 0 | 287 | - |1135k| 0 | 52 | 231 | 163 | 231 | 369 | 60 | 0 | 0 | 2.000000e+00 | -- | Inf
0.10/0.19 c 0.2s| 1 | 0 | 332 | - |1164k| 0 | 35 | 231 | 163 | 231 | 387 | 78 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 382 | - |1180k| 0 | 44 | 231 | 163 | 231 | 398 | 89 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 2 | 382 | - |1181k| 0 | 44 | 231 | 163 | 231 | 398 | 89 | 0 | 20 | 2.000000e+00 | -- | Inf
1.89/1.90 o 31
1.89/1.90 c * 1.9s| 510 | 147 | 3882 | 6.9 |1576k| 38 | - | 231 | 597 | 231 | 202 |1413 | 434 |1376 | 2.000000e+00 | 3.100000e+01 |1450.00%
1.89/1.93 o 30
1.89/1.93 c * 1.9s| 516 | 143 | 3930 | 6.9 |1583k| 39 | - | 231 | 599 | 231 | 209 |1427 | 436 |1416 | 2.000000e+00 | 3.000000e+01 |1400.00%
2.20/2.21 o 27
2.20/2.21 c * 2.2s| 656 | 210 | 4913 | 6.9 |1717k| 48 | - | 231 | 707 | 231 | 184 |1787 | 544 |1589 | 2.000000e+00 | 2.700000e+01 |1250.00%
2.29/2.30 o 2
2.29/2.30 c * 2.3s| 741 | 0 | 5321 | 6.7 |1574k| 48 | - | 231 | 766 | 231 | 186 |1939 | 603 |1614 | 2.000000e+00 | 2.000000e+00 | 0.00%
2.29/2.30 c
2.29/2.30 c SCIP Status : problem is solved [optimal solution found]
2.29/2.30 c Solving Time (sec) : 2.29
2.29/2.30 c Solving Nodes : 741
2.29/2.30 c Primal Bound : +2.00000000000000e+00 (4 solutions)
2.29/2.30 c Dual Bound : +2.00000000000000e+00
2.29/2.30 c Gap : 0.00 %
2.29/2.30 s OPTIMUM FOUND
2.29/2.30 v -x90 -x89 -x88 x87 -x86 -x85 x84 x83 x82 x81 -x60 -x59 x58 x57 -x56 x80 -x79 -x78 x77 -x76 x55 -x54 -x53 x52 -x51 -x75 x74 -x73
2.29/2.30 v -x72 x71 x50 -x49 x48 x47 -x46 x70 -x69 -x68 -x67 -x66 -x45 x44 -x43 x42 -x41 -x65 -x64 -x63 -x62 -x61 x40 -x39 -x38 x37 -x36
2.29/2.30 v -x35 x34 -x33 x32 x31 x30 x29 -x28 x27 x26 x25 x24 -x23 x22 x21 x20 x19 x18 x17 x16 x15 x14 x13 -x12 x11 -x10 x9 -x8 -x7 x6
2.29/2.30 v -x5 -x4 -x3 x2 -x1
2.29/2.30 c SCIP Status : problem is solved [optimal solution found]
2.29/2.30 c Solving Time : 2.29
2.29/2.30 c Original Problem :
2.29/2.30 c Problem name : HOME/instance-2703158-1278564513.opb
2.29/2.30 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.30 c Constraints : 163 initial, 163 maximal
2.29/2.30 c Presolved Problem :
2.29/2.30 c Problem name : t_HOME/instance-2703158-1278564513.opb
2.29/2.30 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
2.29/2.30 c Constraints : 163 initial, 766 maximal
2.29/2.30 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.29/2.30 c trivial : 0.00 0 0 0 0 0 0 0 0
2.29/2.30 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.29/2.30 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.29/2.30 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.29/2.30 c implics : 0.00 0 2 0 0 0 0 0 0
2.29/2.30 c probing : 0.01 0 0 0 0 0 0 0 0
2.29/2.30 c and : 0.01 0 0 0 0 0 0 0 0
2.29/2.30 c linear : 0.00 1 6 0 0 0 0 0 21
2.29/2.30 c logicor : 0.00 0 0 0 0 0 0 0 0
2.29/2.30 c root node : - 0 - - 0 - - - -
2.29/2.30 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.29/2.30 c integral : 0 0 0 636 0 0 126 0 0 1120
2.29/2.30 c and : 149 1333 2665 2 0 48 3022 1869 0 0
2.29/2.30 c linear : 6 6 2615 2 0 190 1371 0 0 0
2.29/2.30 c logicor : 8+ 6 1010 4 0 11 277 0 0 0
2.29/2.30 c countsols : 0 0 0 4 0 0 0 0 0 0
2.29/2.30 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.29/2.30 c integral : 1.23 0.00 0.00 1.23 0.00
2.29/2.30 c and : 0.04 0.03 0.02 0.00 0.00
2.29/2.30 c linear : 0.03 0.00 0.03 0.00 0.00
2.29/2.30 c logicor : 0.01 0.00 0.01 0.00 0.00
2.29/2.30 c countsols : 0.00 0.00 0.00 0.00 0.00
2.29/2.30 c Propagators : Time Calls Cutoffs DomReds
2.29/2.30 c vbounds : 0.00 2 0 0
2.29/2.30 c rootredcost : 0.00 3 0 0
2.29/2.30 c pseudoobj : 0.00 2334 0 12
2.29/2.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.29/2.30 c propagation : 0.02 249 249 1488 19.8 70 12.1 -
2.29/2.30 c infeasible LP : 0.00 6 6 29 15.0 5 12.2 0
2.29/2.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.29/2.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.29/2.30 c applied globally : - - - 603 15.1 - - -
2.29/2.30 c applied locally : - - - 0 0.0 - - -
2.29/2.30 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.29/2.30 c cut pool : 0.00 5 - - 10 - (maximal pool size: 146)
2.29/2.30 c redcost : 0.01 1335 0 1 0 0
2.29/2.30 c impliedbounds : 0.00 6 0 0 57 0
2.29/2.30 c intobj : 0.00 0 0 0 0 0
2.29/2.30 c cgmip : 0.00 0 0 0 0 0
2.29/2.30 c gomory : 0.03 6 0 0 102 0
2.29/2.30 c strongcg : 0.02 6 0 0 132 0
2.29/2.30 c cmir : 0.01 6 0 0 39 0
2.29/2.30 c flowcover : 0.03 6 0 0 72 0
2.29/2.30 c clique : 0.00 6 0 0 1 0
2.29/2.30 c zerohalf : 0.00 0 0 0 0 0
2.29/2.30 c mcf : 0.00 1 0 0 0 0
2.29/2.30 c rapidlearning : 0.04 1 0 0 0 0
2.29/2.30 c Pricers : Time Calls Vars
2.29/2.30 c problem variables: 0.00 0 0
2.29/2.30 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.29/2.30 c relpscost : 1.23 632 0 126 0 0 1120
2.29/2.30 c pscost : 0.00 0 0 0 0 0 0
2.29/2.30 c inference : 0.00 0 0 0 0 0 0
2.29/2.30 c mostinf : 0.00 0 0 0 0 0 0
2.29/2.30 c leastinf : 0.00 0 0 0 0 0 0
2.29/2.30 c fullstrong : 0.00 0 0 0 0 0 0
2.29/2.30 c allfullstrong : 0.00 0 0 0 0 0 0
2.29/2.30 c random : 0.00 0 0 0 0 0 0
2.29/2.30 c Primal Heuristics : Time Calls Found
2.29/2.30 c LP solutions : 0.00 - 4
2.29/2.30 c pseudo solutions : 0.00 - 0
2.29/2.30 c crossover : 0.00 0 0
2.29/2.30 c veclendiving : 0.00 0 0
2.29/2.30 c objpscostdiving : 0.00 0 0
2.29/2.30 c rootsoldiving : 0.00 0 0
2.29/2.30 c linesearchdiving : 0.00 0 0
2.29/2.30 c guideddiving : 0.00 0 0
2.29/2.30 c intshifting : 0.00 0 0
2.29/2.30 c oneopt : 0.00 3 0
2.29/2.30 c coefdiving : 0.00 1 0
2.29/2.30 c pscostdiving : 0.00 1 0
2.29/2.30 c fracdiving : 0.00 1 0
2.29/2.30 c feaspump : 0.01 1 0
2.29/2.30 c trivial : 0.00 2 0
2.29/2.30 c simplerounding : 0.00 0 0
2.29/2.30 c zirounding : 0.01 558 0
2.29/2.30 c rounding : 0.01 480 0
2.29/2.30 c shifting : 0.07 120 0
2.29/2.30 c twoopt : 0.00 0 0
2.29/2.30 c fixandinfer : 0.00 0 0
2.29/2.30 c intdiving : 0.00 0 0
2.29/2.30 c actconsdiving : 0.00 0 0
2.29/2.30 c octane : 0.00 0 0
2.29/2.30 c rens : 0.02 1 0
2.29/2.30 c rins : 0.00 0 0
2.29/2.30 c localbranching : 0.00 0 0
2.29/2.30 c mutation : 0.00 0 0
2.29/2.30 c dins : 0.00 0 0
2.29/2.30 c undercover : 0.02 1 0
2.29/2.30 c nlp : 0.00 0 0
2.29/2.30 c trysol : 0.00 0 0
2.29/2.30 c LP : Time Calls Iterations Iter/call Iter/sec
2.29/2.30 c primal LP : 0.02 0 0 0.00 0.00
2.29/2.30 c dual LP : 0.46 1408 5089 3.61 11147.72
2.29/2.30 c lex dual LP : 0.00 0 0 0.00 -
2.29/2.30 c barrier LP : 0.00 0 0 0.00 -
2.29/2.30 c diving/probing LP: 0.01 24 232 9.67 -
2.29/2.30 c strong branching : 1.22 1614 11854 7.34 9728.15
2.29/2.30 c (at root node) : - 20 1628 81.40 -
2.29/2.30 c conflict analysis: 0.00 0 0 0.00 -
2.29/2.30 c B&B Tree :
2.29/2.30 c number of runs : 1
2.29/2.30 c nodes : 741
2.29/2.30 c nodes (total) : 741
2.29/2.30 c nodes left : 0
2.29/2.30 c max depth : 48
2.29/2.30 c max depth (total): 48
2.29/2.30 c backtracks : 105 (14.2%)
2.29/2.30 c delayed cutoffs : 100
2.29/2.30 c repropagations : 290 (1012 domain reductions, 72 cutoffs)
2.29/2.30 c avg switch length: 3.23
2.29/2.30 c switching time : 0.05
2.29/2.30 c Solution :
2.29/2.30 c Solutions found : 4 (4 improvements)
2.29/2.30 c First Solution : +3.10000000000000e+01 (in run 1, after 510 nodes, 1.89 seconds, depth 35, found by <relaxation>)
2.29/2.30 c Primal Bound : +2.00000000000000e+00 (in run 1, after 741 nodes, 2.29 seconds, depth 41, found by <relaxation>)
2.29/2.30 c Dual Bound : +2.00000000000000e+00
2.29/2.30 c Gap : 0.00 %
2.29/2.30 c Root Dual Bound : +2.00000000000000e+00
2.29/2.30 c Root Iterations : 382
2.29/2.31 c Time complete: 2.3.