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-2703043-1278564419.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.01 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.04 c (0.0s) probing: 160/231 (69.3%) - 0 fixings, 0 aggregations, 27 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 9 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 21 changed coefficients
0.00/0.04 c 1088 implications, 0 cliques
0.00/0.04 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 163 constraints
0.00/0.04 c 149 constraints of type <and>
0.00/0.04 c 6 constraints of type <linear>
0.00/0.04 c 8 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.3
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1790
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 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 | 19 | - |1032k| 0 | 11 | 231 | 163 | 231 | 309 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.05/0.08 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.09/0.15 c 0.1s| 1 | 0 | 250 | - |1048k| 0 | 23 | 231 | 163 | 231 | 315 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 267 | - |1105k| 0 | 32 | 231 | 163 | 231 | 345 | 36 | 0 | 0 | 2.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 0 | 315 | - |1140k| 0 | 45 | 231 | 163 | 231 | 366 | 57 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 341 | - |1206k| 0 | 52 | 231 | 163 | 231 | 380 | 71 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 390 | - |1255k| 0 | 63 | 231 | 163 | 231 | 398 | 89 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 448 | - |1281k| 0 | 50 | 231 | 163 | 231 | 418 | 109 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.46 c 0.4s| 1 | 2 | 448 | - |1281k| 0 | 50 | 231 | 163 | 231 | 418 | 109 | 0 | 10 | 2.000000e+00 | -- | Inf
2.89/2.97 o 3
2.89/2.97 c * 3.0s| 814 | 104 | 8814 | 10.3 |1756k| 40 | - | 231 | 734 | 231 | 214 |2577 | 571 |1504 | 2.000000e+00 | 3.000000e+00 | 50.00%
2.99/3.03 o 2
2.99/3.03 c * 3.0s| 878 | 0 | 9079 | 9.8 |1604k| 40 | - | 231 | 725 | 231 | 173 |2643 | 632 |1508 | 2.000000e+00 | 2.000000e+00 | 0.00%
2.99/3.03 c
2.99/3.03 c SCIP Status : problem is solved [optimal solution found]
2.99/3.03 c Solving Time (sec) : 3.02
2.99/3.03 c Solving Nodes : 878
2.99/3.03 c Primal Bound : +2.00000000000000e+00 (2 solutions)
2.99/3.03 c Dual Bound : +2.00000000000000e+00
2.99/3.03 c Gap : 0.00 %
2.99/3.03 s OPTIMUM FOUND
2.99/3.03 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.99/3.03 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.99/3.03 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.99/3.03 v -x5 -x4 -x3 x2 -x1
2.99/3.03 c SCIP Status : problem is solved [optimal solution found]
2.99/3.03 c Solving Time : 3.02
2.99/3.03 c Original Problem :
2.99/3.03 c Problem name : HOME/instance-2703043-1278564419.opb
2.99/3.03 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.03 c Constraints : 163 initial, 163 maximal
2.99/3.03 c Presolved Problem :
2.99/3.03 c Problem name : t_HOME/instance-2703043-1278564419.opb
2.99/3.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.03 c Constraints : 163 initial, 736 maximal
2.99/3.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.03 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.03 c implics : 0.00 0 2 0 0 0 0 0 0
2.99/3.03 c probing : 0.01 0 0 0 0 0 0 0 0
2.99/3.03 c and : 0.01 0 0 0 0 0 0 0 0
2.99/3.03 c linear : 0.00 1 6 0 0 0 0 0 21
2.99/3.03 c logicor : 0.00 0 0 0 0 0 0 0 0
2.99/3.03 c root node : - 53 - - 53 - - - -
2.99/3.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.03 c integral : 0 0 0 755 0 0 134 0 0 1430
2.99/3.03 c and : 149 1553 3325 0 0 66 4249 2561 0 0
2.99/3.03 c linear : 6 6 3257 0 0 191 1759 0 0 0
2.99/3.03 c logicor : 8+ 6 1341 1 0 6 393 0 0 0
2.99/3.03 c countsols : 0 0 0 2 0 0 0 0 0 0
2.99/3.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.03 c integral : 1.39 0.00 0.00 1.39 0.00
2.99/3.03 c and : 0.06 0.03 0.03 0.00 0.00
2.99/3.03 c linear : 0.03 0.00 0.03 0.00 0.00
2.99/3.03 c logicor : 0.01 0.00 0.01 0.00 0.00
2.99/3.03 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.03 c Propagators : Time Calls Cutoffs DomReds
2.99/3.03 c vbounds : 0.00 2 0 0
2.99/3.03 c rootredcost : 0.00 1 0 4
2.99/3.03 c pseudoobj : 0.00 2996 0 1
2.99/3.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.03 c propagation : 0.02 263 263 1548 19.8 30 13.0 -
2.99/3.03 c infeasible LP : 0.00 6 6 23 16.1 2 2.0 0
2.99/3.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.03 c applied globally : - - - 632 15.5 - - -
2.99/3.03 c applied locally : - - - 0 0.0 - - -
2.99/3.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.03 c cut pool : 0.00 5 - - 32 - (maximal pool size: 212)
2.99/3.03 c redcost : 0.01 1555 0 0 0 0
2.99/3.03 c impliedbounds : 0.00 6 0 0 79 0
2.99/3.03 c intobj : 0.00 0 0 0 0 0
2.99/3.03 c cgmip : 0.00 0 0 0 0 0
2.99/3.03 c gomory : 0.05 6 0 0 3 0
2.99/3.03 c strongcg : 0.05 6 0 0 195 0
2.99/3.03 c cmir : 0.02 6 0 0 57 0
2.99/3.03 c flowcover : 0.03 6 0 0 114 0
2.99/3.03 c clique : 0.00 6 0 0 0 0
2.99/3.03 c zerohalf : 0.00 0 0 0 0 0
2.99/3.03 c mcf : 0.00 1 0 0 0 0
2.99/3.03 c rapidlearning : 0.08 1 0 0 0 0
2.99/3.03 c Pricers : Time Calls Vars
2.99/3.03 c problem variables: 0.00 0 0
2.99/3.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.03 c relpscost : 1.39 753 0 134 0 0 1430
2.99/3.03 c pscost : 0.00 0 0 0 0 0 0
2.99/3.03 c inference : 0.00 0 0 0 0 0 0
2.99/3.03 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.03 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.03 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.03 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.03 c random : 0.00 0 0 0 0 0 0
2.99/3.03 c Primal Heuristics : Time Calls Found
2.99/3.03 c LP solutions : 0.00 - 2
2.99/3.03 c pseudo solutions : 0.00 - 0
2.99/3.03 c crossover : 0.00 0 0
2.99/3.03 c linesearchdiving : 0.00 0 0
2.99/3.03 c guideddiving : 0.00 0 0
2.99/3.03 c intshifting : 0.00 0 0
2.99/3.03 c oneopt : 0.00 1 0
2.99/3.03 c coefdiving : 0.01 1 0
2.99/3.03 c pscostdiving : 0.01 1 0
2.99/3.03 c fracdiving : 0.00 1 0
2.99/3.03 c veclendiving : 0.00 1 0
2.99/3.03 c feaspump : 0.01 1 0
2.99/3.03 c objpscostdiving : 0.01 1 0
2.99/3.03 c rootsoldiving : 0.01 1 0
2.99/3.03 c trivial : 0.00 2 0
2.99/3.03 c simplerounding : 0.00 0 0
2.99/3.03 c zirounding : 0.01 692 0
2.99/3.03 c rounding : 0.02 534 0
2.99/3.03 c shifting : 0.10 114 0
2.99/3.03 c twoopt : 0.00 0 0
2.99/3.03 c fixandinfer : 0.00 0 0
2.99/3.03 c intdiving : 0.00 0 0
2.99/3.03 c actconsdiving : 0.00 0 0
2.99/3.03 c octane : 0.00 0 0
2.99/3.03 c rens : 0.02 1 0
2.99/3.03 c rins : 0.00 0 0
2.99/3.03 c localbranching : 0.00 0 0
2.99/3.03 c mutation : 0.00 0 0
2.99/3.03 c dins : 0.00 0 0
2.99/3.03 c undercover : 0.02 1 0
2.99/3.03 c nlp : 0.00 0 0
2.99/3.03 c trysol : 0.00 0 0
2.99/3.03 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.03 c primal LP : 0.03 0 0 0.00 0.00
2.99/3.03 c dual LP : 0.74 1597 8501 5.32 11457.04
2.99/3.03 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.03 c barrier LP : 0.00 0 0 0.00 -
2.99/3.03 c diving/probing LP: 0.03 120 578 4.82 17000.00
2.99/3.03 c strong branching : 1.37 1508 12927 8.57 9442.80
2.99/3.03 c (at root node) : - 10 905 90.50 -
2.99/3.03 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.03 c B&B Tree :
2.99/3.03 c number of runs : 1
2.99/3.03 c nodes : 878
2.99/3.03 c nodes (total) : 878
2.99/3.03 c nodes left : 0
2.99/3.03 c max depth : 40
2.99/3.03 c max depth (total): 40
2.99/3.03 c backtracks : 121 (13.8%)
2.99/3.03 c delayed cutoffs : 159
2.99/3.03 c repropagations : 411 (1267 domain reductions, 90 cutoffs)
2.99/3.03 c avg switch length: 3.42
2.99/3.03 c switching time : 0.09
2.99/3.03 c Solution :
2.99/3.03 c Solutions found : 2 (2 improvements)
2.99/3.03 c First Solution : +3.00000000000000e+00 (in run 1, after 814 nodes, 2.96 seconds, depth 40, found by <relaxation>)
2.99/3.03 c Primal Bound : +2.00000000000000e+00 (in run 1, after 878 nodes, 3.02 seconds, depth 33, found by <relaxation>)
2.99/3.03 c Dual Bound : +2.00000000000000e+00
2.99/3.03 c Gap : 0.00 %
2.99/3.03 c Root Dual Bound : +2.00000000000000e+00
2.99/3.03 c Root Iterations : 448
2.99/3.04 c Time complete: 3.04.