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-2663704-1276650536.opb>
0.00/0.01 c original problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 191 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) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1000 impls, 0 clqs
0.00/0.04 c (round 2) 17 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 6 upgd conss, 1480 impls, 0 clqs
0.00/0.04 c (round 3) 29 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 6 upgd conss, 1840 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 6 upgd conss, 2080 impls, 0 clqs
0.00/0.05 c (round 5) 53 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 6 upgd conss, 2200 impls, 0 clqs
0.00/0.05 c (round 6) 65 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 6 upgd conss, 2200 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 147/205 (71.7%) - 0 fixings, 0 aggregations, 10 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 (7 rounds):
0.00/0.06 c 65 deleted vars, 50 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 74 changed coefficients
0.00/0.06 c 2220 implications, 0 cliques
0.00/0.06 c presolved problem has 205 variables (205 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.00/0.06 c 125 constraints of type <and>
0.00/0.06 c 5 constraints of type <linear>
0.00/0.06 c 6 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.02
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.07 c
0.00/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.00/0.07 c 0.0s| 1 | 2 | 0 | - | 752k| 0 | - | 205 | 136 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.59/0.62 o 43
0.59/0.62 c * 0.5s| 3385 | 2449 | 0 | 0.0 |2463k| 71 | - | 205 | 354 | 0 | 0 | 0 | 479 | 0 | 1.000000e+00 | 4.300000e+01 |4200.00%
0.89/0.96 o 11
0.89/0.96 c * 0.8s| 5278 | 3543 | 0 | 0.0 |3306k| 71 | - | 205 | 532 | 0 | 0 | 0 | 895 | 0 | 1.000000e+00 | 1.100000e+01 |1000.00%
0.89/0.97 o 3
0.89/0.97 c * 0.8s| 5321 | 3502 | 0 | 0.0 |3291k| 71 | - | 205 | 531 | 0 | 0 | 0 | 901 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.89/0.98 c
0.89/0.98 c SCIP Status : problem is solved [optimal solution found]
0.89/0.98 c Solving Time (sec) : 0.82
0.89/0.98 c Solving Nodes : 5322
0.89/0.98 c Primal Bound : +3.00000000000000e+00 (3 solutions)
0.89/0.98 c Dual Bound : +3.00000000000000e+00
0.89/0.98 c Gap : 0.00 %
0.89/0.99 s OPTIMUM FOUND
0.89/0.99 v -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x60 -x59 -x58 -x57 x56 x55 -x78 -x77 -x76 -x75 -x74 x73 -x54 -x53
0.89/0.99 v -x52 -x51 -x50 x49 -x72 -x71 -x70 x69 -x68 -x67 -x48 -x47 -x46 x45 -x44 x43 -x66 -x65 -x64 -x63 -x62 -x61 -x42 -x41 x40 -x39
0.89/0.99 v -x38 x37 -x36 -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
0.89/0.99 v -x10 -x9 x8 x7 -x6 -x5 -x4 -x3 x2 x1
0.89/0.99 c SCIP Status : problem is solved [optimal solution found]
0.89/0.99 c Solving Time : 0.82
0.89/0.99 c Original Problem :
0.89/0.99 c Problem name : HOME/instance-2663704-1276650536.opb
0.89/0.99 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.99 c Constraints : 191 initial, 191 maximal
0.89/0.99 c Presolved Problem :
0.89/0.99 c Problem name : t_HOME/instance-2663704-1276650536.opb
0.89/0.99 c Variables : 205 (205 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.99 c Constraints : 136 initial, 536 maximal
0.89/0.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.99 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.89/0.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.99 c inttobinary : 0.01 0 0 0 0 0 0 0 0
0.89/0.99 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.99 c probing : 0.01 0 0 0 0 0 0 0 0
0.89/0.99 c and : 0.00 10 50 0 0 0 50 0 50
0.89/0.99 c linear : 0.00 1 4 0 0 0 0 0 24
0.89/0.99 c logicor : 0.00 0 0 0 0 0 0 0 0
0.89/0.99 c root node : - 36 - - 36 - - - -
0.89/0.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.99 c integral : 0 0 0 0 0 0 0 0 0 0
0.89/0.99 c and : 125 0 13121 0 4841 156 19230 0 0 0
0.89/0.99 c linear : 5 0 12964 0 4841 470 8377 0 0 0
0.89/0.99 c logicor : 6+ 0 5865 0 4842 45 1391 0 0 0
0.89/0.99 c countsols : 0 0 0 0 4843 0 0 0 0 0
0.89/0.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.99 c integral : 0.00 0.00 0.00 0.00 0.00
0.89/0.99 c and : 0.10 0.00 0.09 0.00 0.01
0.89/0.99 c linear : 0.22 0.00 0.21 0.00 0.01
0.89/0.99 c logicor : 0.08 0.00 0.07 0.00 0.01
0.89/0.99 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.99 c Propagators : Time Calls Cutoffs DomReds
0.89/0.99 c vbounds : 0.00 2 0 0
0.89/0.99 c rootredcost : 0.01 0 0 0
0.89/0.99 c pseudoobj : 0.01 12823 2 42
0.89/0.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.99 c propagation : 0.08 673 671 5296 30.8 93 29.2 -
0.89/0.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.99 c applied globally : - - - 899 16.4 - - -
0.89/0.99 c applied locally : - - - 3 38.0 - - -
0.89/0.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.99 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.89/0.99 c redcost : 0.00 0 0 0 0 0
0.89/0.99 c impliedbounds : 0.00 0 0 0 0 0
0.89/0.99 c intobj : 0.00 0 0 0 0 0
0.89/0.99 c cgmip : 0.00 0 0 0 0 0
0.89/0.99 c gomory : 0.00 0 0 0 0 0
0.89/0.99 c strongcg : 0.00 0 0 0 0 0
0.89/0.99 c cmir : 0.00 0 0 0 0 0
0.89/0.99 c flowcover : 0.00 0 0 0 0 0
0.89/0.99 c clique : 0.00 0 0 0 0 0
0.89/0.99 c zerohalf : 0.00 0 0 0 0 0
0.89/0.99 c mcf : 0.00 0 0 0 0 0
0.89/0.99 c rapidlearning : 0.00 0 0 0 0 0
0.89/0.99 c Pricers : Time Calls Vars
0.89/0.99 c problem variables: 0.00 0 0
0.89/0.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.99 c relpscost : 0.00 0 0 0 0 0 0
0.89/0.99 c pscost : 0.00 0 0 0 0 0 0
0.89/0.99 c inference : 0.09 4840 0 0 0 0 9680
0.89/0.99 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.99 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.99 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.99 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.99 c random : 0.00 0 0 0 0 0 0
0.89/0.99 c Primal Heuristics : Time Calls Found
0.89/0.99 c LP solutions : 0.00 - 0
0.89/0.99 c pseudo solutions : 0.00 - 3
0.89/0.99 c oneopt : 0.00 0 0
0.89/0.99 c trivial : 0.00 2 0
0.89/0.99 c simplerounding : 0.00 0 0
0.89/0.99 c zirounding : 0.00 0 0
0.89/0.99 c rounding : 0.00 0 0
0.89/0.99 c shifting : 0.00 0 0
0.89/0.99 c intshifting : 0.00 0 0
0.89/0.99 c twoopt : 0.00 0 0
0.89/0.99 c fixandinfer : 0.00 0 0
0.89/0.99 c feaspump : 0.00 0 0
0.89/0.99 c coefdiving : 0.00 0 0
0.89/0.99 c pscostdiving : 0.00 0 0
0.89/0.99 c fracdiving : 0.00 0 0
0.89/0.99 c veclendiving : 0.00 0 0
0.89/0.99 c intdiving : 0.00 0 0
0.89/0.99 c actconsdiving : 0.00 0 0
0.89/0.99 c objpscostdiving : 0.00 0 0
0.89/0.99 c rootsoldiving : 0.00 0 0
0.89/0.99 c linesearchdiving : 0.00 0 0
0.89/0.99 c guideddiving : 0.00 0 0
0.89/0.99 c octane : 0.00 0 0
0.89/0.99 c rens : 0.00 0 0
0.89/0.99 c rins : 0.00 0 0
0.89/0.99 c localbranching : 0.00 0 0
0.89/0.99 c mutation : 0.00 0 0
0.89/0.99 c crossover : 0.00 0 0
0.89/0.99 c dins : 0.00 0 0
0.89/0.99 c undercover : 0.00 0 0
0.89/0.99 c nlp : 0.01 0 0
0.89/0.99 c trysol : 0.00 0 0
0.89/0.99 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.99 c primal LP : 0.00 0 0 0.00 -
0.89/0.99 c dual LP : 0.00 0 0 0.00 -
0.89/0.99 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.99 c barrier LP : 0.00 0 0 0.00 -
0.89/0.99 c diving/probing LP: 0.00 0 0 0.00 -
0.89/0.99 c strong branching : 0.00 0 0 0.00 -
0.89/0.99 c (at root node) : - 0 0 0.00 -
0.89/0.99 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.99 c B&B Tree :
0.89/0.99 c number of runs : 1
0.89/0.99 c nodes : 5322
0.89/0.99 c nodes (total) : 5322
0.89/0.99 c nodes left : 0
0.89/0.99 c max depth : 71
0.89/0.99 c max depth (total): 71
0.89/0.99 c backtracks : 328 (6.2%)
0.89/0.99 c delayed cutoffs : 3726
0.89/0.99 c repropagations : 1316 (2556 domain reductions, 194 cutoffs)
0.89/0.99 c avg switch length: 3.40
0.89/0.99 c switching time : 0.10
0.89/0.99 c Solution :
0.89/0.99 c Solutions found : 3 (3 improvements)
0.89/0.99 c First Solution : +4.30000000000000e+01 (in run 1, after 3385 nodes, 0.50 seconds, depth 42, found by <relaxation>)
0.89/0.99 c Primal Bound : +3.00000000000000e+00 (in run 1, after 5321 nodes, 0.81 seconds, depth 48, found by <relaxation>)
0.89/0.99 c Dual Bound : +3.00000000000000e+00
0.89/0.99 c Gap : 0.00 %
0.89/0.99 c Root Dual Bound : +1.00000000000000e+00
0.89/0.99 c Root Iterations : 0
0.89/0.99 c Time complete: 0.99.