0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1870271-1245193654.opb>
0.00/0.01 c original problem has 56 variables (56 bin, 0 int, 0 impl, 0 cont) and 56 constraints
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 574 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 574 implications, 0 cliques
0.00/0.02 c presolved problem has 56 variables (56 bin, 0 int, 0 impl, 0 cont) and 56 constraints
0.00/0.02 c 46 constraints of type <and>
0.00/0.02 c 10 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.00
0.00/0.02 c OPT-NLC
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = c 1620
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = c 1791
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = c 10000
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving problem
0.00/0.02 c
0.00/0.02 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 0 | 20 | 353k| 0 | 20 | 56 | 56 | 56 | 56 | 102 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 o 7
0.00/0.02 c s 0.0s| 1 | 0 | 20 | 354k| 0 | 20 | 56 | 56 | 56 | 56 | 102 | 0 | 0 | 0 | 0.000000e+00 | 7.000000e+00 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 52 | 364k| 0 | 20 | 56 | 56 | 56 | 56 | 124 | 22 | 0 | 0 | 0.000000e+00 | 7.000000e+00 | Inf
0.00/0.03 o 3
0.00/0.03 c s 0.0s| 1 | 0 | 52 | 365k| 0 | 20 | 56 | 56 | 56 | 56 | 124 | 22 | 0 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 75 | 374k| 0 | 40 | 56 | 56 | 56 | 56 | 144 | 42 | 0 | 0 | 1.730769e+00 | 3.000000e+00 | 73.33%
0.00/0.04 c 0.0s| 1 | 0 | 83 | 369k| 0 | 0 | 56 | 45 | 45 | 56 | 127 | 47 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.05 c (run 1, node 1) restarting after 13 global fixings of integer variables
0.00/0.05 c
0.00/0.05 (restart) converted 46 cuts from the global cut pool into linear constraints
0.00/0.05 c
0.00/0.05 presolving:
0.00/0.05 c (round 1) 22 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 0 upgd conss, 574 impls, 1 clqs
0.00/0.05 c (round 2) 22 del vars, 27 del conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 28 upgd conss, 574 impls, 1 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 22 deleted vars, 27 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 9 changed coefficients
0.00/0.05 c 574 implications, 1 cliques
0.00/0.05 c presolved problem has 34 variables (34 bin, 0 int, 0 impl, 0 cont) and 64 constraints
0.00/0.05 c 1 constraints of type <knapsack>
0.00/0.05 c 1 constraints of type <setppc>
0.00/0.05 c 26 constraints of type <and>
0.00/0.05 c 36 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.01
0.00/0.05 c
0.00/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.06 c 0.0s| 1 | 0 | 116 | 362k| 0 | 0 | 34 | 64 | 64 | 34 | 90 | 0 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.06 c 0.0s| 1 | 0 | 116 | 333k| 0 | 0 | 34 | 37 | 37 | 34 | 53 | 0 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.06 c (run 2, node 1) restarting after 18 global fixings of integer variables
0.00/0.06 c
0.00/0.06 presolving:
0.00/0.06 c (round 1) 24 del vars, 12 del conss, 0 chg bounds, 1 chg sides, 10 chg coeffs, 0 upgd conss, 574 impls, 1 clqs
0.00/0.06 c presolving (2 rounds):
0.00/0.06 c 24 deleted vars, 12 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 10 changed coefficients
0.00/0.06 c 574 implications, 1 cliques
0.00/0.06 c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 25 constraints
0.00/0.06 c 1 constraints of type <knapsack>
0.00/0.06 c 1 constraints of type <setppc>
0.00/0.06 c 6 constraints of type <and>
0.00/0.06 c 17 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.01
0.00/0.06 c
0.00/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.06 c 0.0s| 1 | 0 | 122 | 307k| 0 | 0 | 10 | 25 | 25 | 10 | 25 | 0 | 0 | 0 | 2.000000e+00 | 3.000000e+00 | 50.00%
0.00/0.06 o 2
0.00/0.06 c * 0.0s| 1 | 0 | 122 | 308k| 0 | - | 10 | 25 | 25 | 10 | 25 | 0 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.04
0.00/0.06 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
0.00/0.06 c Primal Bound : +2.00000000000000e+00 (3 solutions)
0.00/0.06 c Dual Bound : +2.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c NODE 1
0.00/0.06 c DUAL BOUND 2
0.00/0.06 c PRIMAL BOUND 2
0.00/0.06 c GAP 0
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 -x2 x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time : 0.04
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-1870271-1245193654.opb
0.00/0.06 c Variables : 56 (56 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 56 initial, 56 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-1870271-1245193654.opb
0.00/0.06 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 25 initial, 25 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 31 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c knapsack : 0.00 0 0 0 0 0 0 1 4
0.00/0.06 c setppc : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c and : 0.00 0 15 0 0 0 15 0 15
0.00/0.06 c linear : 0.00 0 0 0 0 0 18 0 0
0.00/0.06 c logicor : 0.01 0 0 0 0 0 6 0 0
0.00/0.06 c root node : - 31 - - 31 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 3 0 0 0 0 0 0
0.00/0.06 c knapsack : 1 2 6 0 0 0 0 0 0 0
0.00/0.06 c setppc : 1 2 6 0 0 0 0 0 0 0
0.00/0.06 c and : 6 6 121 3 0 0 16 44 0 0
0.00/0.06 c logicor : 17 6 118 3 0 0 10 0 0 0
0.00/0.06 c countsols : 0 0 0 3 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c setppc : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c and : 0.01 0.00 0.01 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c rootredcost : 0.00 0 0 0
0.00/0.06 c pseudoobj : 0.00 13 0 0
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 0 0.0 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 6 0 5 0 0
0.00/0.06 c impliedbounds : 0.00 3 0 0 45 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 6 0 0 182 0
0.00/0.06 c strongcg : 0.00 6 0 0 182 0
0.00/0.06 c cmir : 0.00 6 0 0 42 0
0.00/0.06 c flowcover : 0.00 6 0 0 88 0
0.00/0.06 c clique : 0.00 6 0 0 2 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 3 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 0 0 0 0 0 0
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 1
0.00/0.06 c pseudo solutions : 0.00 - 0
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 3 0
0.00/0.06 c shifting : 0.00 3 2
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c oneopt : 0.00 1 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.02 6 122 20.33 6100.00
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 3
0.00/0.06 c nodes : 1
0.00/0.06 c nodes (total) : 3
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 0
0.00/0.06 c max depth (total): 0
0.00/0.06 c backtracks : 0 (0.0%)
0.00/0.06 c delayed cutoffs : 0
0.00/0.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.06 c avg switch length: 2.00
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 3 (3 improvements)
0.00/0.06 c Primal Bound : +2.00000000000000e+00 (in run 3, after 1 nodes, 0.04 seconds, depth 0, found by <relaxation>)
0.00/0.06 c Dual Bound : +2.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +2.00000000000000e+00
0.00/0.07 c Time complete: 0.06.