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-2664675-1276448655.opb>
0.00/0.01 c original problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 252 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.02 c presolving:
0.01/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 225 upgd conss, 1476 impls, 0 clqs
0.01/0.03 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 252 upgd conss, 1476 impls, 0 clqs
0.01/0.04 c presolving (3 rounds):
0.01/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 1548 implications, 0 cliques
0.01/0.04 c presolved problem has 132 variables (132 bin, 0 int, 0 impl, 0 cont) and 252 constraints
0.01/0.04 c 252 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.01
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.2
0.01/0.04 c
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = 0
0.01/0.04 c
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = TRUE
0.01/0.04 c
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = 1
0.01/0.04 c
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1800
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = -1
0.01/0.04 c
0.01/0.04 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.01/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = a
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = 1000000
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/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.01/0.04 c 0.0s| 1 | 2 | 0 | - | 682k| 0 | - | 132 | 252 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.01/0.04 o 61
0.01/0.04 c * 0.0s| 21 | 13 | 0 | 0.0 | 695k| 17 | - | 132 | 260 | 0 | 0 | 0 | 8 | 0 | 1.000000e+00 | 6.100000e+01 |6000.00%
0.01/0.05 o 60
0.01/0.05 c * 0.0s| 82 | 10 | 0 | 0.0 | 700k| 20 | - | 132 | 268 | 0 | 0 | 0 | 41 | 0 | 1.000000e+00 | 6.000000e+01 |5900.00%
0.01/0.07 o 59
0.01/0.07 c * 0.1s| 242 | 12 | 0 | 0.0 | 705k| 25 | - | 132 | 275 | 0 | 0 | 0 | 118 | 0 | 1.000000e+00 | 5.900000e+01 |5800.00%
0.01/0.07 o 58
0.01/0.07 c * 0.1s| 244 | 10 | 0 | 0.0 | 706k| 25 | - | 132 | 276 | 0 | 0 | 0 | 119 | 0 | 1.000000e+00 | 5.800000e+01 |5700.00%
0.09/0.12 o 57
0.09/0.12 c * 0.1s| 464 | 17 | 0 | 0.0 | 708k| 25 | - | 132 | 265 | 0 | 0 | 0 | 213 | 0 | 1.000000e+00 | 5.700000e+01 |5600.00%
0.29/0.36 o 56
0.29/0.36 c * 0.3s| 2016 | 12 | 0 | 0.0 | 716k| 25 | - | 132 | 282 | 0 | 0 | 0 | 758 | 0 | 1.000000e+00 | 5.600000e+01 |5500.00%
0.69/0.75 o 55
0.69/0.75 c * 0.6s| 4259 | 19 | 0 | 0.0 | 723k| 27 | - | 132 | 283 | 0 | 0 | 0 |1833 | 0 | 1.000000e+00 | 5.500000e+01 |5400.00%
0.69/0.75 o 54
0.69/0.75 c * 0.6s| 4260 | 17 | 0 | 0.0 | 725k| 27 | - | 132 | 283 | 0 | 0 | 0 |1833 | 0 | 1.000000e+00 | 5.400000e+01 |5300.00%
1.69/1.77 c 1.5s| 10000 | 12 | 0 | 0.0 | 732k| 34 | - | 132 | 306 | 0 | 0 | 0 |4501 | 0 | 5.000000e+00 | 5.400000e+01 | 980.00%
1.89/1.90 c
1.89/1.90 c SCIP Status : problem is solved [optimal solution found]
1.89/1.90 c Solving Time (sec) : 1.62
1.89/1.90 c Solving Nodes : 10662
1.89/1.90 c Primal Bound : +5.40000000000000e+01 (8 solutions)
1.89/1.90 c Dual Bound : +5.40000000000000e+01
1.89/1.90 c Gap : 0.00 %
1.89/1.90 s OPTIMUM FOUND
1.89/1.90 v x132 -x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 -x122 x121 -x120 x119 x118 -x117 x116 -x115 x114 -x113 x112 -x111 -x110
1.89/1.90 v x109 x108 -x107 x106 -x105 -x104 x103 x102 -x101 x100 -x99 -x98 x97 -x96 -x95 -x94 x93 -x92 x91 -x90 -x89 -x88 -x87 -x86 x85
1.89/1.90 v -x84 -x83 -x82 x81 x80 -x79 -x78 x77 -x76 -x75 -x74 x73 -x72 x71 -x70 -x69 -x68 x67 x66 -x65 -x64 x63 -x62 -x61 -x60 x59 x58
1.89/1.90 v -x57 -x56 x55 -x54 -x53 -x52 x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 x39 -x38 -x37 x36 -x35 -x34 x33 -x32 x31
1.89/1.90 v -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 x5 -x4 x3 -x2
1.89/1.90 v x1
1.89/1.90 c SCIP Status : problem is solved [optimal solution found]
1.89/1.90 c Solving Time : 1.62
1.89/1.90 c Original Problem :
1.89/1.90 c Problem name : HOME/instance-2664675-1276448655.opb
1.89/1.90 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.90 c Constraints : 252 initial, 252 maximal
1.89/1.90 c Presolved Problem :
1.89/1.90 c Problem name : t_HOME/instance-2664675-1276448655.opb
1.89/1.90 c Variables : 132 (132 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.90 c Constraints : 252 initial, 327 maximal
1.89/1.90 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.90 c trivial : 0.00 0 0 0 0 0 0 0 0
1.89/1.90 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.89/1.90 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c probing : 0.01 0 0 0 0 0 0 0 0
1.89/1.91 c logicor : 0.00 0 0 0 0 0 0 0 0
1.89/1.91 c root node : - 93 - - 93 - - - -
1.89/1.91 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.91 c integral : 0 0 0 0 0 0 0 0 0 0
1.89/1.91 c logicor : 252+ 0 28480 0 8 4934 39062 0 0 0
1.89/1.91 c countsols : 0 0 0 0 8 0 0 0 0 0
1.89/1.91 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.91 c integral : 0.00 0.00 0.00 0.00 0.00
1.89/1.91 c logicor : 0.52 0.00 0.52 0.00 0.00
1.89/1.91 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.91 c Propagators : Time Calls Cutoffs DomReds
1.89/1.91 c vbounds : 0.00 2 0 0
1.89/1.91 c rootredcost : 0.02 0 0 0
1.89/1.91 c pseudoobj : 0.40 39167 1014 73888
1.89/1.91 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.91 c propagation : 0.47 5932 4879 4879 10.5 33 9.6 -
1.89/1.91 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.91 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.91 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.91 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.91 c applied globally : - - - 4912 10.5 - - -
1.89/1.91 c applied locally : - - - 0 0.0 - - -
1.89/1.91 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.91 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.89/1.91 c redcost : 0.00 0 0 0 0 0
1.89/1.91 c impliedbounds : 0.00 0 0 0 0 0
1.89/1.91 c intobj : 0.00 0 0 0 0 0
1.89/1.91 c cgmip : 0.00 0 0 0 0 0
1.89/1.91 c gomory : 0.00 0 0 0 0 0
1.89/1.91 c strongcg : 0.00 0 0 0 0 0
1.89/1.91 c cmir : 0.00 0 0 0 0 0
1.89/1.91 c flowcover : 0.00 0 0 0 0 0
1.89/1.91 c clique : 0.00 0 0 0 0 0
1.89/1.91 c zerohalf : 0.00 0 0 0 0 0
1.89/1.91 c mcf : 0.00 0 0 0 0 0
1.89/1.91 c rapidlearning : 0.00 0 0 0 0 0
1.89/1.91 c Pricers : Time Calls Vars
1.89/1.91 c problem variables: 0.00 0 0
1.89/1.91 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.91 c relpscost : 0.00 0 0 0 0 0 0
1.89/1.91 c pscost : 0.00 0 0 0 0 0 0
1.89/1.91 c inference : 0.06 7246 0 0 0 0 14492
1.89/1.91 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.91 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.91 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.91 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.91 c random : 0.00 0 0 0 0 0 0
1.89/1.91 c Primal Heuristics : Time Calls Found
1.89/1.91 c LP solutions : 0.00 - 0
1.89/1.91 c pseudo solutions : 0.00 - 8
1.89/1.91 c oneopt : 0.00 0 0
1.89/1.91 c trivial : 0.00 2 0
1.89/1.91 c simplerounding : 0.00 0 0
1.89/1.91 c zirounding : 0.00 0 0
1.89/1.91 c rounding : 0.00 0 0
1.89/1.91 c shifting : 0.00 0 0
1.89/1.91 c intshifting : 0.00 0 0
1.89/1.91 c twoopt : 0.00 0 0
1.89/1.91 c fixandinfer : 0.00 0 0
1.89/1.91 c feaspump : 0.00 0 0
1.89/1.91 c coefdiving : 0.00 0 0
1.89/1.91 c pscostdiving : 0.00 0 0
1.89/1.91 c fracdiving : 0.00 0 0
1.89/1.91 c veclendiving : 0.00 0 0
1.89/1.91 c intdiving : 0.00 0 0
1.89/1.91 c actconsdiving : 0.00 0 0
1.89/1.91 c objpscostdiving : 0.00 0 0
1.89/1.91 c rootsoldiving : 0.00 0 0
1.89/1.91 c linesearchdiving : 0.00 0 0
1.89/1.91 c guideddiving : 0.00 0 0
1.89/1.91 c octane : 0.00 0 0
1.89/1.91 c rens : 0.00 0 0
1.89/1.91 c rins : 0.00 0 0
1.89/1.91 c localbranching : 0.00 0 0
1.89/1.91 c mutation : 0.00 0 0
1.89/1.91 c crossover : 0.00 0 0
1.89/1.91 c dins : 0.00 0 0
1.89/1.91 c undercover : 0.00 0 0
1.89/1.91 c nlp : 0.01 0 0
1.89/1.91 c trysol : 0.01 0 0
1.89/1.91 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.91 c primal LP : 0.00 0 0 0.00 -
1.89/1.91 c dual LP : 0.00 0 0 0.00 -
1.89/1.91 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.91 c barrier LP : 0.00 0 0 0.00 -
1.89/1.91 c diving/probing LP: 0.00 0 0 0.00 -
1.89/1.91 c strong branching : 0.00 0 0 0.00 -
1.89/1.91 c (at root node) : - 0 0 0.00 -
1.89/1.91 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.91 c B&B Tree :
1.89/1.91 c number of runs : 1
1.89/1.91 c nodes : 10662
1.89/1.91 c nodes (total) : 10662
1.89/1.91 c nodes left : 0
1.89/1.91 c max depth : 41
1.89/1.91 c max depth (total): 41
1.89/1.91 c backtracks : 3004 (28.2%)
1.89/1.91 c delayed cutoffs : 3812
1.89/1.91 c repropagations : 7304 (51178 domain reductions, 2540 cutoffs)
1.89/1.91 c avg switch length: 2.49
1.89/1.91 c switching time : 0.12
1.89/1.91 c Solution :
1.89/1.91 c Solutions found : 8 (8 improvements)
1.89/1.91 c First Solution : +6.10000000000000e+01 (in run 1, after 21 nodes, 0.03 seconds, depth 17, found by <relaxation>)
1.89/1.91 c Primal Bound : +5.40000000000000e+01 (in run 1, after 4260 nodes, 0.63 seconds, depth 26, found by <relaxation>)
1.89/1.91 c Dual Bound : +5.40000000000000e+01
1.89/1.91 c Gap : 0.00 %
1.89/1.91 c Root Dual Bound : +0.00000000000000e+00
1.89/1.91 c Root Iterations : 0
1.89/1.91 c Time complete: 1.9.