0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2663723-1276650880.opb>
0.00/0.01 c original problem has 264 variables (264 bin, 0 int, 0 impl, 0 cont) and 199 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 876 impls, 0 clqs
0.00/0.04 c (round 2) 19 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 4 upgd conss, 1324 impls, 0 clqs
0.00/0.04 c (round 3) 35 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.00/0.05 c (round 4) 51 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 137/213 (64.3%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (5 rounds):
0.00/0.06 c 51 deleted vars, 42 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 66 changed coefficients
0.00/0.06 c 1560 implications, 0 cliques
0.00/0.06 c presolved problem has 213 variables (213 bin, 0 int, 0 impl, 0 cont) and 154 constraints
0.00/0.06 c 147 constraints of type <and>
0.00/0.06 c 3 constraints of type <linear>
0.00/0.06 c 4 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 2)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c lp/solvefreq = -1
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c heuristics/undercover/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 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.06 c 0.0s| 1 | 2 | 0 | - | 745k| 0 | - | 213 | 154 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.09/1.13 o 13
1.09/1.13 c * 1.0s| 5427 | 2838 | 0 | 0.0 |3156k| 96 | - | 213 | 613 | 0 | 0 | 0 |1050 | 0 | 1.000000e+00 | 1.300000e+01 |1200.00%
1.39/1.42 o 5
1.39/1.42 c * 1.2s| 6674 | 3296 | 0 | 0.0 |3655k| 96 | - | 213 | 655 | 0 | 0 | 0 |1284 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.49/1.57 o 3
1.49/1.57 c * 1.4s| 7243 | 3152 | 0 | 0.0 |3633k| 96 | - | 213 | 542 | 0 | 0 | 0 |1396 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
1.49/1.58 c
1.49/1.58 c SCIP Status : problem is solved [optimal solution found]
1.49/1.58 c Solving Time (sec) : 1.38
1.49/1.58 c Solving Nodes : 7243
1.49/1.58 c Primal Bound : +3.00000000000000e+00 (3 solutions)
1.49/1.58 c Dual Bound : +3.00000000000000e+00
1.49/1.58 c Gap : 0.00 %
1.49/1.58 s OPTIMUM FOUND
1.49/1.58 v -x72 -x71 -x70 -x69 -x68 -x67 x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x48 -x47 -x46 -x45 x44 -x43 -x42 x41 -x56 -x55
1.49/1.58 v -x54 -x53 -x52 -x51 x50 -x49 -x40 -x39 -x38 -x37 -x36 -x35 -x34 x33 -x32 x31 -x30 -x29 x28 -x27 x26 x25 -x24 -x23 -x22 -x21 x20
1.49/1.58 v -x19 -x18 x17 x16 -x15 x14 -x13 x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
1.49/1.58 c SCIP Status : problem is solved [optimal solution found]
1.49/1.58 c Solving Time : 1.38
1.49/1.58 c Original Problem :
1.49/1.58 c Problem name : HOME/instance-2663723-1276650880.opb
1.49/1.58 c Variables : 264 (264 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.58 c Constraints : 199 initial, 199 maximal
1.49/1.58 c Presolved Problem :
1.49/1.58 c Problem name : t_HOME/instance-2663723-1276650880.opb
1.49/1.58 c Variables : 213 (213 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.58 c Constraints : 154 initial, 660 maximal
1.49/1.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.59 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c probing : 0.01 0 0 0 0 0 0 0 0
1.49/1.59 c and : 0.01 6 42 0 0 0 42 0 42
1.49/1.59 c linear : 0.01 1 2 0 0 0 0 0 24
1.49/1.59 c logicor : 0.00 0 0 0 0 0 0 0 0
1.49/1.59 c root node : - 64 - - 64 - - - -
1.49/1.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.59 c integral : 0 0 0 0 0 0 0 0 0 0
1.49/1.59 c and : 147 0 17259 0 5813 340 28196 0 0 0
1.49/1.59 c linear : 3 0 16916 0 5813 1501 12859 0 0 0
1.49/1.59 c logicor : 4+ 0 6465 0 5814 71 1844 0 0 0
1.49/1.59 c countsols : 0 0 0 0 5816 0 0 0 0 0
1.49/1.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.59 c integral : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c and : 0.25 0.00 0.20 0.00 0.05
1.49/1.59 c linear : 0.48 0.00 0.48 0.00 0.00
1.49/1.59 c logicor : 0.11 0.00 0.10 0.00 0.01
1.49/1.59 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.59 c Propagators : Time Calls Cutoffs DomReds
1.49/1.59 c vbounds : 0.00 2 0 0
1.49/1.59 c rootredcost : 0.00 0 0 0
1.49/1.59 c pseudoobj : 0.04 16984 1 279
1.49/1.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.59 c propagation : 0.23 1601 1338 11089 43.0 81 51.1 -
1.49/1.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.59 c applied globally : - - - 1112 17.5 - - -
1.49/1.59 c applied locally : - - - 285 44.5 - - -
1.49/1.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.59 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.49/1.59 c redcost : 0.00 0 0 0 0 0
1.49/1.59 c impliedbounds : 0.00 0 0 0 0 0
1.49/1.59 c intobj : 0.00 0 0 0 0 0
1.49/1.59 c cgmip : 0.00 0 0 0 0 0
1.49/1.59 c gomory : 0.00 0 0 0 0 0
1.49/1.59 c strongcg : 0.00 0 0 0 0 0
1.49/1.59 c cmir : 0.00 0 0 0 0 0
1.49/1.59 c flowcover : 0.00 0 0 0 0 0
1.49/1.59 c clique : 0.00 0 0 0 0 0
1.49/1.59 c zerohalf : 0.00 0 0 0 0 0
1.49/1.59 c mcf : 0.00 0 0 0 0 0
1.49/1.59 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.59 c Pricers : Time Calls Vars
1.49/1.59 c problem variables: 0.00 0 0
1.49/1.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.59 c relpscost : 0.00 0 0 0 0 0 0
1.49/1.59 c pscost : 0.00 0 0 0 0 0 0
1.49/1.59 c inference : 0.16 5813 0 0 0 0 11626
1.49/1.59 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.59 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.59 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.59 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.59 c random : 0.00 0 0 0 0 0 0
1.49/1.59 c Primal Heuristics : Time Calls Found
1.49/1.59 c LP solutions : 0.00 - 0
1.49/1.59 c pseudo solutions : 0.00 - 3
1.49/1.59 c oneopt : 0.00 0 0
1.49/1.59 c trivial : 0.00 2 0
1.49/1.59 c simplerounding : 0.00 0 0
1.49/1.59 c zirounding : 0.00 0 0
1.49/1.59 c rounding : 0.00 0 0
1.49/1.59 c shifting : 0.00 0 0
1.49/1.59 c intshifting : 0.00 0 0
1.49/1.59 c twoopt : 0.00 0 0
1.49/1.59 c fixandinfer : 0.00 0 0
1.49/1.59 c feaspump : 0.00 0 0
1.49/1.59 c coefdiving : 0.00 0 0
1.49/1.59 c pscostdiving : 0.00 0 0
1.49/1.59 c fracdiving : 0.00 0 0
1.49/1.59 c veclendiving : 0.00 0 0
1.49/1.59 c intdiving : 0.00 0 0
1.49/1.59 c actconsdiving : 0.00 0 0
1.49/1.59 c objpscostdiving : 0.00 0 0
1.49/1.59 c rootsoldiving : 0.00 0 0
1.49/1.59 c linesearchdiving : 0.00 0 0
1.49/1.59 c guideddiving : 0.00 0 0
1.49/1.59 c octane : 0.00 0 0
1.49/1.59 c rens : 0.00 0 0
1.49/1.59 c rins : 0.00 0 0
1.49/1.59 c localbranching : 0.00 0 0
1.49/1.59 c mutation : 0.00 0 0
1.49/1.59 c crossover : 0.00 0 0
1.49/1.59 c dins : 0.00 0 0
1.49/1.59 c undercover : 0.00 0 0
1.49/1.59 c nlp : 0.00 0 0
1.49/1.59 c trysol : 0.00 0 0
1.49/1.59 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.59 c primal LP : 0.00 0 0 0.00 -
1.49/1.59 c dual LP : 0.00 0 0 0.00 -
1.49/1.59 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.59 c barrier LP : 0.00 0 0 0.00 -
1.49/1.59 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.59 c strong branching : 0.00 0 0 0.00 -
1.49/1.59 c (at root node) : - 0 0 0.00 -
1.49/1.59 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.59 c B&B Tree :
1.49/1.59 c number of runs : 1
1.49/1.59 c nodes : 7243
1.49/1.59 c nodes (total) : 7243
1.49/1.59 c nodes left : 0
1.49/1.59 c max depth : 96
1.49/1.59 c max depth (total): 96
1.49/1.59 c backtracks : 854 (11.8%)
1.49/1.59 c delayed cutoffs : 3755
1.49/1.59 c repropagations : 1656 (6211 domain reductions, 486 cutoffs)
1.49/1.59 c avg switch length: 3.73
1.49/1.59 c switching time : 0.10
1.49/1.59 c Solution :
1.49/1.59 c Solutions found : 3 (3 improvements)
1.49/1.59 c First Solution : +1.30000000000000e+01 (in run 1, after 5427 nodes, 0.99 seconds, depth 75, found by <relaxation>)
1.49/1.59 c Primal Bound : +3.00000000000000e+00 (in run 1, after 7243 nodes, 1.37 seconds, depth 78, found by <relaxation>)
1.49/1.59 c Dual Bound : +3.00000000000000e+00
1.49/1.59 c Gap : 0.00 %
1.49/1.59 c Root Dual Bound : +1.00000000000000e+00
1.49/1.59 c Root Iterations : 0
1.49/1.59 c Time complete: 1.59.