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-2703049-1278564423.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.02 c presolving:
0.00/0.02 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) 10 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 8 upgd conss, 1286 impls, 0 clqs
0.02/0.04 c (0.0s) probing: 176/270 (65.2%) - 0 fixings, 0 aggregations, 29 implications, 0 bound changes
0.02/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.04 c presolving (3 rounds):
0.02/0.04 c 10 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 24 changed coefficients
0.02/0.04 c 1344 implications, 0 cliques
0.02/0.04 c presolved problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.02/0.04 c 174 constraints of type <and>
0.02/0.04 c 7 constraints of type <linear>
0.02/0.04 c 9 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 1)
0.02/0.04 c Presolving Time: 0.02
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 1.2.1.3
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1790
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 1620
0.02/0.04 c
0.02/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.04 c # [type: int, range: [1,2], default: 1]
0.02/0.04 c timing/clocktype = 2
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/indicator/addCouplingCons = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c heuristics/undercover/freq = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.05 c 0.0s| 1 | 0 | 20 | - |1187k| 0 | 11 | 270 | 190 | 270 | 361 | 0 | 0 | 0 | 2.000000e+00 | -- | Inf
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.02/0.09 c [src/scip/scip.c:1025] Warning: Copying of aggregated variables not implemented yet
0.19/0.20 c 0.2s| 1 | 0 | 288 | - |1203k| 0 | 15 | 270 | 190 | 270 | 367 | 6 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 303 | - |1249k| 0 | 27 | 270 | 190 | 270 | 399 | 38 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 330 | - |1284k| 0 | 30 | 270 | 190 | 270 | 422 | 61 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 354 | - |1335k| 0 | 50 | 270 | 190 | 270 | 448 | 87 | 0 | 0 | 2.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 391 | - |1387k| 0 | 59 | 270 | 190 | 270 | 464 | 103 | 0 | 0 | 2.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 430 | - |1452k| 0 | 77 | 270 | 190 | 270 | 499 | 138 | 0 | 0 | 2.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 2 | 430 | - |1453k| 0 | 77 | 270 | 190 | 270 | 499 | 138 | 0 | 10 | 2.000000e+00 | -- | Inf
2.99/3.08 o 15
2.99/3.08 c c 3.1s| 610 | 382 | 7942 | 12.3 |2116k| 45 | - | 270 | 707 | 270 | 232 |2573 | 517 |1577 | 2.000000e+00 | 1.500000e+01 | 650.00%
3.39/3.40 o 2
3.39/3.40 c * 3.4s| 731 | 0 | 8677 | 11.3 |1889k| 56 | - | 270 | 820 | 270 | 225 |2930 | 641 |1772 | 2.000000e+00 | 2.000000e+00 | 0.00%
3.39/3.41 c
3.39/3.41 c SCIP Status : problem is solved [optimal solution found]
3.39/3.41 c Solving Time (sec) : 3.39
3.39/3.41 c Solving Nodes : 731
3.39/3.41 c Primal Bound : +2.00000000000000e+00 (2 solutions)
3.39/3.41 c Dual Bound : +2.00000000000000e+00
3.39/3.41 c Gap : 0.00 %
3.39/3.41 s OPTIMUM FOUND
3.39/3.41 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
3.39/3.41 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
3.39/3.41 v -x46 -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
3.39/3.41 v -x23 x22 x21 -x20 -x19 x18 -x17 x16 x15 -x14 -x13 x12 x11 -x10 -x9 x8 x7 x6 -x5 -x4 -x3 x2 -x1
3.39/3.41 c SCIP Status : problem is solved [optimal solution found]
3.39/3.41 c Solving Time : 3.39
3.39/3.41 c Original Problem :
3.39/3.41 c Problem name : HOME/instance-2703049-1278564423.opb
3.39/3.41 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.41 c Constraints : 190 initial, 190 maximal
3.39/3.41 c Presolved Problem :
3.39/3.41 c Problem name : t_HOME/instance-2703049-1278564423.opb
3.39/3.41 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
3.39/3.41 c Constraints : 190 initial, 820 maximal
3.39/3.41 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.39/3.41 c trivial : 0.00 0 0 0 0 0 0 0 0
3.39/3.41 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.39/3.41 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.39/3.41 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.39/3.41 c implics : 0.00 0 2 0 0 0 0 0 0
3.39/3.41 c probing : 0.01 0 0 0 0 0 0 0 0
3.39/3.41 c and : 0.01 0 0 0 0 0 0 0 0
3.39/3.41 c linear : 0.00 1 7 0 0 0 0 0 24
3.39/3.41 c logicor : 0.00 0 0 0 0 0 0 0 0
3.39/3.41 c root node : - 7 - - 7 - - - -
3.39/3.41 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.39/3.41 c integral : 0 0 0 655 0 2 118 0 0 1230
3.39/3.41 c and : 174 1446 2995 1 0 67 3097 2820 0 0
3.39/3.41 c linear : 7 6 2927 1 0 131 1043 0 0 0
3.39/3.41 c logicor : 9+ 6 1001 1 0 2 154 0 0 0
3.39/3.41 c countsols : 0 0 0 1 0 0 0 0 0 0
3.39/3.41 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.39/3.41 c integral : 1.68 0.00 0.00 1.68 0.00
3.39/3.41 c and : 0.06 0.04 0.02 0.00 0.00
3.39/3.41 c linear : 0.03 0.00 0.03 0.00 0.00
3.39/3.41 c logicor : 0.01 0.00 0.01 0.00 0.00
3.39/3.41 c countsols : 0.00 0.00 0.00 0.00 0.00
3.39/3.41 c Propagators : Time Calls Cutoffs DomReds
3.39/3.41 c vbounds : 0.00 2 0 0
3.39/3.41 c rootredcost : 0.00 1 0 1
3.39/3.41 c pseudoobj : 0.00 2628 0 4
3.39/3.41 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.39/3.41 c propagation : 0.02 200 200 1510 21.8 42 22.5 -
3.39/3.41 c infeasible LP : 0.00 11 11 25 10.7 2 23.5 0
3.39/3.41 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.41 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.39/3.41 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.39/3.41 c applied globally : - - - 641 16.5 - - -
3.39/3.41 c applied locally : - - - 0 0.0 - - -
3.39/3.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.39/3.41 c cut pool : 0.00 5 - - 21 - (maximal pool size: 240)
3.39/3.41 c redcost : 0.01 1446 0 0 0 0
3.39/3.41 c impliedbounds : 0.00 6 0 0 96 0
3.39/3.41 c intobj : 0.00 0 0 0 0 0
3.39/3.41 c cgmip : 0.00 0 0 0 0 0
3.39/3.41 c gomory : 0.04 6 0 0 81 0
3.39/3.41 c strongcg : 0.03 6 0 0 228 0
3.39/3.41 c cmir : 0.02 6 0 0 51 0
3.39/3.41 c flowcover : 0.04 6 0 0 112 0
3.39/3.41 c clique : 0.00 6 0 0 1 0
3.39/3.41 c zerohalf : 0.00 0 0 0 0 0
3.39/3.41 c mcf : 0.00 1 0 0 0 0
3.39/3.41 c rapidlearning : 0.12 1 0 0 0 0
3.39/3.41 c Pricers : Time Calls Vars
3.39/3.41 c problem variables: 0.00 0 0
3.39/3.41 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.39/3.41 c relpscost : 1.68 654 2 118 0 0 1230
3.39/3.41 c pscost : 0.00 0 0 0 0 0 0
3.39/3.41 c inference : 0.00 0 0 0 0 0 0
3.39/3.41 c mostinf : 0.00 0 0 0 0 0 0
3.39/3.41 c leastinf : 0.00 0 0 0 0 0 0
3.39/3.41 c fullstrong : 0.00 0 0 0 0 0 0
3.39/3.41 c allfullstrong : 0.00 0 0 0 0 0 0
3.39/3.41 c random : 0.00 0 0 0 0 0 0
3.39/3.41 c Primal Heuristics : Time Calls Found
3.39/3.41 c LP solutions : 0.00 - 1
3.39/3.41 c pseudo solutions : 0.00 - 0
3.39/3.41 c crossover : 0.00 0 0
3.39/3.41 c guideddiving : 0.00 0 0
3.39/3.41 c intshifting : 0.00 0 0
3.39/3.41 c oneopt : 0.00 1 0
3.39/3.41 c pscostdiving : 0.02 2 0
3.39/3.41 c fracdiving : 0.01 2 0
3.39/3.41 c veclendiving : 0.01 2 0
3.39/3.41 c linesearchdiving : 0.01 2 0
3.39/3.41 c coefdiving : 0.02 3 1
3.39/3.41 c feaspump : 0.02 2 0
3.39/3.41 c objpscostdiving : 0.03 2 0
3.39/3.41 c rootsoldiving : 0.03 2 0
3.39/3.41 c trivial : 0.00 2 0
3.39/3.41 c simplerounding : 0.00 0 0
3.39/3.41 c zirounding : 0.01 613 0
3.39/3.41 c rounding : 0.03 500 0
3.39/3.41 c shifting : 0.18 146 0
3.39/3.41 c twoopt : 0.00 0 0
3.39/3.41 c fixandinfer : 0.00 0 0
3.39/3.41 c intdiving : 0.00 0 0
3.39/3.41 c actconsdiving : 0.00 0 0
3.39/3.41 c octane : 0.00 0 0
3.39/3.41 c rens : 0.02 1 0
3.39/3.41 c rins : 0.00 0 0
3.39/3.41 c localbranching : 0.00 0 0
3.39/3.41 c mutation : 0.00 0 0
3.39/3.41 c dins : 0.00 0 0
3.39/3.41 c undercover : 0.02 1 0
3.39/3.41 c nlp : 0.00 0 0
3.39/3.41 c trysol : 0.00 0 0
3.39/3.41 c LP : Time Calls Iterations Iter/call Iter/sec
3.39/3.41 c primal LP : 0.03 0 0 0.00 0.00
3.39/3.41 c dual LP : 0.66 1505 7115 4.73 10715.56
3.39/3.41 c lex dual LP : 0.00 0 0 0.00 -
3.39/3.41 c barrier LP : 0.00 0 0 0.00 -
3.39/3.41 c diving/probing LP: 0.10 319 1562 4.90 15165.49
3.39/3.41 c strong branching : 1.66 1772 15459 8.72 9307.25
3.39/3.41 c (at root node) : - 10 734 73.40 -
3.39/3.41 c conflict analysis: 0.00 0 0 0.00 -
3.39/3.41 c B&B Tree :
3.39/3.41 c number of runs : 1
3.39/3.41 c nodes : 731
3.39/3.41 c nodes (total) : 731
3.39/3.41 c nodes left : 0
3.39/3.41 c max depth : 56
3.39/3.41 c max depth (total): 56
3.39/3.41 c backtracks : 82 (11.2%)
3.39/3.41 c delayed cutoffs : 61
3.39/3.41 c repropagations : 247 (810 domain reductions, 51 cutoffs)
3.39/3.41 c avg switch length: 2.72
3.39/3.41 c switching time : 0.06
3.39/3.41 c Solution :
3.39/3.41 c Solutions found : 2 (2 improvements)
3.39/3.41 c First Solution : +1.50000000000000e+01 (in run 1, after 610 nodes, 3.07 seconds, depth 51, found by <coefdiving>)
3.39/3.41 c Primal Bound : +2.00000000000000e+00 (in run 1, after 731 nodes, 3.39 seconds, depth 50, found by <relaxation>)
3.39/3.41 c Dual Bound : +2.00000000000000e+00
3.39/3.41 c Gap : 0.00 %
3.39/3.41 c Root Dual Bound : +2.00000000000000e+00
3.39/3.41 c Root Iterations : 430
3.39/3.42 c Time complete: 3.41.