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-2663651-1276649367.opb>
0.00/0.01 c original problem has 352 variables (352 bin, 0 int, 0 impl, 0 cont) and 265 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.05 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1240 impls, 0 clqs
0.00/0.05 c (round 2) 20 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 5 upgd conss, 1912 impls, 0 clqs
0.00/0.06 c (round 3) 36 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 5 upgd conss, 2360 impls, 0 clqs
0.00/0.06 c (round 4) 52 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 5 upgd conss, 2584 impls, 0 clqs
0.00/0.06 c (round 5) 68 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 5 upgd conss, 2584 impls, 0 clqs
0.00/0.08 c (0.1s) probing: 151/284 (53.2%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.08 c (0.1s) probing aborted: 100/100 successive totally useless probings
0.00/0.08 c presolving (6 rounds):
0.00/0.08 c 68 deleted vars, 56 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 86 changed coefficients
0.00/0.08 c 2600 implications, 0 cliques
0.00/0.08 c presolved problem has 284 variables (284 bin, 0 int, 0 impl, 0 cont) and 205 constraints
0.00/0.08 c 196 constraints of type <and>
0.00/0.08 c 4 constraints of type <linear>
0.00/0.08 c 5 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 2)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1800
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c lp/solvefreq = -1
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c heuristics/undercover/freq = 0
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/rapidlearning/freq = 0
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.08 c
0.00/0.08 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.08 c 0.1s| 1 | 2 | 0 | - | 957k| 0 | - | 284 | 205 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.89/0.99 o 3
0.89/0.99 c * 0.8s| 4822 | 1297 | 0 | 0.0 |2528k| 146 | - | 284 | 395 | 0 | 0 | 0 | 568 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.89/0.99 c
0.89/0.99 c SCIP Status : problem is solved [optimal solution found]
0.89/0.99 c Solving Time (sec) : 0.84
0.89/0.99 c Solving Nodes : 4823
0.89/0.99 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.89/0.99 c Dual Bound : +3.00000000000000e+00
0.89/0.99 c Gap : 0.00 %
0.89/0.99 s OPTIMUM FOUND
0.89/0.99 v -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 x87 -x86 -x85 -x84 -x83 -x82 x81 -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x80 -x79
0.89/0.99 v -x78 -x77 -x76 -x75 -x74 x73 x56 -x55 -x54 -x53 -x52 -x51 -x50 x49 -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 -x48 -x47 -x46 -x45
0.89/0.99 v -x44 x43 -x42 x41 x40 -x39 x38 -x37 -x36 x35 x34 x33 x32 -x31 -x30 -x29 -x28 -x27 -x26 x25 -x24 x23 -x22 -x21 x20 x19 -x18 x17
0.89/0.99 v -x16 x15 -x14 x13 -x12 x11 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.84
0.89/0.99 c Original Problem :
0.89/0.99 c Problem name : HOME/instance-2663651-1276649367.opb
0.89/0.99 c Variables : 352 (352 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.99 c Constraints : 265 initial, 265 maximal
0.89/0.99 c Presolved Problem :
0.89/0.99 c Problem name : t_HOME/instance-2663651-1276649367.opb
0.89/0.99 c Variables : 284 (284 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.99 c Constraints : 205 initial, 396 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.00 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.02 0 0 0 0 0 0 0 0
0.89/0.99 c and : 0.01 8 56 0 0 0 56 0 56
0.89/0.99 c linear : 0.01 1 3 0 0 0 0 0 30
0.89/0.99 c logicor : 0.00 0 0 0 0 0 0 0 0
0.89/0.99 c root node : - 64 - - 64 - - - -
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 : 196 0 10668 0 4322 102 21404 0 0 0
0.89/0.99 c linear : 4 0 10566 0 4322 503 6265 0 0 0
0.89/0.99 c logicor : 5+ 0 3637 0 4316 52 902 0 0 0
0.89/0.99 c countsols : 0 0 0 0 4323 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.14 0.00 0.09 0.00 0.05
0.89/0.99 c linear : 0.27 0.00 0.27 0.00 0.00
0.89/0.99 c logicor : 0.02 0.00 0.00 0.00 0.02
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.01 2 0 0
0.89/0.99 c rootredcost : 0.00 0 0 0
0.89/0.99 c pseudoobj : 0.01 10361 0 14
0.89/0.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.99 c propagation : 0.16 489 488 5483 54.6 55 46.5 -
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/1.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/1.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/1.00 c applied globally : - - - 495 17.2 - - -
0.89/1.00 c applied locally : - - - 74 44.3 - - -
0.89/1.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/1.00 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.89/1.00 c redcost : 0.00 0 0 0 0 0
0.89/1.00 c impliedbounds : 0.00 0 0 0 0 0
0.89/1.00 c intobj : 0.00 0 0 0 0 0
0.89/1.00 c cgmip : 0.00 0 0 0 0 0
0.89/1.00 c gomory : 0.00 0 0 0 0 0
0.89/1.00 c strongcg : 0.00 0 0 0 0 0
0.89/1.00 c cmir : 0.00 0 0 0 0 0
0.89/1.00 c flowcover : 0.00 0 0 0 0 0
0.89/1.00 c clique : 0.00 0 0 0 0 0
0.89/1.00 c zerohalf : 0.00 0 0 0 0 0
0.89/1.00 c mcf : 0.00 0 0 0 0 0
0.89/1.00 c rapidlearning : 0.00 0 0 0 0 0
0.89/1.00 c Pricers : Time Calls Vars
0.89/1.00 c problem variables: 0.00 0 0
0.89/1.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/1.00 c relpscost : 0.00 0 0 0 0 0 0
0.89/1.00 c pscost : 0.00 0 0 0 0 0 0
0.89/1.00 c inference : 0.13 4322 0 0 0 0 8644
0.89/1.00 c mostinf : 0.00 0 0 0 0 0 0
0.89/1.00 c leastinf : 0.00 0 0 0 0 0 0
0.89/1.00 c fullstrong : 0.00 0 0 0 0 0 0
0.89/1.00 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/1.00 c random : 0.00 0 0 0 0 0 0
0.89/1.00 c Primal Heuristics : Time Calls Found
0.89/1.00 c LP solutions : 0.00 - 0
0.89/1.00 c pseudo solutions : 0.01 - 1
0.89/1.00 c oneopt : 0.00 0 0
0.89/1.00 c trivial : 0.00 2 0
0.89/1.00 c simplerounding : 0.00 0 0
0.89/1.00 c zirounding : 0.00 0 0
0.89/1.00 c rounding : 0.00 0 0
0.89/1.00 c shifting : 0.00 0 0
0.89/1.00 c intshifting : 0.00 0 0
0.89/1.00 c twoopt : 0.00 0 0
0.89/1.00 c fixandinfer : 0.00 0 0
0.89/1.00 c feaspump : 0.00 0 0
0.89/1.00 c coefdiving : 0.00 0 0
0.89/1.00 c pscostdiving : 0.00 0 0
0.89/1.00 c fracdiving : 0.00 0 0
0.89/1.00 c veclendiving : 0.00 0 0
0.89/1.00 c intdiving : 0.00 0 0
0.89/1.00 c actconsdiving : 0.00 0 0
0.89/1.00 c objpscostdiving : 0.00 0 0
0.89/1.00 c rootsoldiving : 0.00 0 0
0.89/1.00 c linesearchdiving : 0.00 0 0
0.89/1.00 c guideddiving : 0.00 0 0
0.89/1.00 c octane : 0.00 0 0
0.89/1.00 c rens : 0.00 0 0
0.89/1.00 c rins : 0.00 0 0
0.89/1.00 c localbranching : 0.00 0 0
0.89/1.00 c mutation : 0.00 0 0
0.89/1.00 c crossover : 0.00 0 0
0.89/1.00 c dins : 0.00 0 0
0.89/1.00 c undercover : 0.00 0 0
0.89/1.00 c nlp : 0.00 0 0
0.89/1.00 c trysol : 0.00 0 0
0.89/1.00 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/1.00 c primal LP : 0.00 0 0 0.00 -
0.89/1.00 c dual LP : 0.00 0 0 0.00 -
0.89/1.00 c lex dual LP : 0.00 0 0 0.00 -
0.89/1.00 c barrier LP : 0.00 0 0 0.00 -
0.89/1.00 c diving/probing LP: 0.00 0 0 0.00 -
0.89/1.00 c strong branching : 0.00 0 0 0.00 -
0.89/1.00 c (at root node) : - 0 0 0.00 -
0.89/1.00 c conflict analysis: 0.00 0 0 0.00 -
0.89/1.00 c B&B Tree :
0.89/1.00 c number of runs : 1
0.89/1.00 c nodes : 4823
0.89/1.00 c nodes (total) : 4823
0.89/1.00 c nodes left : 0
0.89/1.00 c max depth : 146
0.89/1.00 c max depth (total): 146
0.89/1.00 c backtracks : 246 (5.1%)
0.89/1.00 c delayed cutoffs : 1456
0.89/1.00 c repropagations : 625 (1985 domain reductions, 157 cutoffs)
0.89/1.00 c avg switch length: 2.86
0.89/1.00 c switching time : 0.08
0.89/1.00 c Solution :
0.89/1.00 c Solutions found : 1 (1 improvements)
0.89/1.00 c First Solution : +3.00000000000000e+00 (in run 1, after 4822 nodes, 0.83 seconds, depth 115, found by <relaxation>)
0.89/1.00 c Primal Bound : +3.00000000000000e+00 (in run 1, after 4822 nodes, 0.83 seconds, depth 115, found by <relaxation>)
0.89/1.00 c Dual Bound : +3.00000000000000e+00
0.89/1.00 c Gap : 0.00 %
0.89/1.00 c Root Dual Bound : +1.00000000000000e+00
0.89/1.00 c Root Iterations : 0
0.89/1.00 c Time complete: 1.