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-2664678-1276450293.opb>
0.02/0.09 c original problem has 2718 variables (2718 bin, 0 int, 0 impl, 0 cont) and 4680 constraints
0.02/0.09 c problem read
0.02/0.09 c presolving settings loaded
0.02/0.09 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.09/0.13 c presolving:
0.19/0.23 c (round 1) 1984 del vars, 495 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 81658 impls, 0 clqs
0.19/0.27 c (round 2) 2006 del vars, 2959 del conss, 24 chg bounds, 12 chg sides, 35 chg coeffs, 0 upgd conss, 82631 impls, 0 clqs
0.19/0.27 c (round 3) 2029 del vars, 3036 del conss, 33 chg bounds, 14 chg sides, 37 chg coeffs, 0 upgd conss, 82713 impls, 0 clqs
0.19/0.28 c (round 4) 2041 del vars, 3071 del conss, 41 chg bounds, 14 chg sides, 37 chg coeffs, 0 upgd conss, 82727 impls, 0 clqs
0.19/0.28 c (round 5) 2052 del vars, 3088 del conss, 47 chg bounds, 14 chg sides, 37 chg coeffs, 0 upgd conss, 82804 impls, 0 clqs
0.19/0.29 c (round 6) 2061 del vars, 3109 del conss, 50 chg bounds, 14 chg sides, 37 chg coeffs, 0 upgd conss, 83006 impls, 0 clqs
0.19/0.29 c (round 7) 2064 del vars, 3120 del conss, 51 chg bounds, 14 chg sides, 37 chg coeffs, 0 upgd conss, 83030 impls, 0 clqs
0.19/0.29 c (round 8) 2064 del vars, 3121 del conss, 51 chg bounds, 14 chg sides, 37 chg coeffs, 0 upgd conss, 83030 impls, 0 clqs
0.29/0.38 c (round 9) 2064 del vars, 3198 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 0 upgd conss, 83030 impls, 0 clqs
0.39/0.43 c (round 10) 2064 del vars, 3228 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1403 upgd conss, 83030 impls, 0 clqs
0.39/0.45 c (round 11) 2064 del vars, 3228 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 83030 impls, 0 clqs
0.39/0.47 c (round 12) 2064 del vars, 3234 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 83030 impls, 0 clqs
0.49/0.53 c (round 13) 2114 del vars, 3234 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 88072 impls, 0 clqs
0.49/0.54 c (round 14) 2118 del vars, 3252 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 88110 impls, 0 clqs
0.49/0.55 c (round 15) 2118 del vars, 3253 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 88110 impls, 0 clqs
0.49/0.56 c (round 16) 2118 del vars, 3254 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 88110 impls, 0 clqs
0.59/0.61 c (round 17) 2168 del vars, 3254 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 89288 impls, 0 clqs
0.59/0.63 c (round 18) 2218 del vars, 3254 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 89548 impls, 0 clqs
0.59/0.66 c (0.5s) probing: 594/654 (90.8%) - 6 fixings, 178 aggregations, 1636 implications, 0 bound changes
0.59/0.66 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.59/0.66 c (round 19) 2252 del vars, 3254 del conss, 51 chg bounds, 87 chg sides, 37 chg coeffs, 1482 upgd conss, 89622 impls, 0 clqs
0.59/0.66 c (0.5s) probing: 604/654 (92.4%) - 6 fixings, 178 aggregations, 1636 implications, 0 bound changes
0.59/0.66 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.59/0.66 c presolving (20 rounds):
0.59/0.66 c 2252 deleted vars, 3254 deleted constraints, 51 tightened bounds, 0 added holes, 87 changed sides, 37 changed coefficients
0.59/0.66 c 89622 implications, 0 cliques
0.59/0.66 c presolved problem has 466 variables (466 bin, 0 int, 0 impl, 0 cont) and 1426 constraints
0.59/0.66 c 1426 constraints of type <logicor>
0.59/0.66 c transformed objective value is always integral (scale: 1)
0.59/0.66 c Presolving Time: 0.49
0.59/0.66 c - non default parameters ----------------------------------------------------------------------
0.59/0.66 c # SCIP version 1.2.1.2
0.59/0.66 c
0.59/0.66 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.59/0.66 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.66 c conflict/interconss = 0
0.59/0.66 c
0.59/0.66 c # should binary conflicts be preferred?
0.59/0.66 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.66 c conflict/preferbinary = TRUE
0.59/0.66 c
0.59/0.66 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.59/0.66 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.66 c constraints/agelimit = 1
0.59/0.66 c
0.59/0.66 c # should enforcement of pseudo solution be disabled?
0.59/0.66 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.66 c constraints/disableenfops = TRUE
0.59/0.66 c
0.59/0.66 c # frequency for displaying node information lines
0.59/0.66 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.66 c display/freq = 10000
0.59/0.66 c
0.59/0.66 c # maximal time in seconds to run
0.59/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.66 c limits/time = 1799.92
0.59/0.66 c
0.59/0.66 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.66 c limits/memory = 1620
0.59/0.66 c
0.59/0.66 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.59/0.66 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.66 c lp/solvefreq = -1
0.59/0.66 c
0.59/0.66 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.59/0.66 c # [type: char, range: {lafpsqd}, default: l]
0.59/0.66 c lp/pricing = a
0.59/0.66 c
0.59/0.66 c # should presolving try to simplify inequalities
0.59/0.66 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.66 c constraints/linear/simplifyinequalities = TRUE
0.59/0.66 c
0.59/0.66 c # should presolving try to simplify knapsacks
0.59/0.66 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.66 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.66 c
0.59/0.66 c # priority of node selection rule <dfs> in standard mode
0.59/0.66 c # [type: int, range: [-536870912,536870911], default: 0]
0.59/0.66 c nodeselection/dfs/stdpriority = 1000000
0.59/0.66 c
0.59/0.66 c -----------------------------------------------------------------------------------------------
0.59/0.66 c start solving
0.59/0.66 c
0.59/0.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.66 c 0.5s| 1 | 2 | 0 | - |7534k| 0 | - | 466 |1426 | 0 | 0 | 0 | 0 | 0 | 1.249000e+03 | -- | Inf
0.69/0.77 c
0.69/0.77 c SCIP Status : problem is solved [infeasible]
0.69/0.77 c Solving Time (sec) : 0.61
0.69/0.77 c Solving Nodes : 210
0.69/0.77 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.77 c Dual Bound : +1.00000000000000e+20
0.69/0.77 c Gap : 0.00 %
0.69/0.77 s UNSATISFIABLE
0.69/0.77 c SCIP Status : problem is solved [infeasible]
0.69/0.77 c Solving Time : 0.61
0.69/0.77 c Original Problem :
0.69/0.77 c Problem name : HOME/instance-2664678-1276450293.opb
0.69/0.77 c Variables : 2718 (2718 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.77 c Constraints : 4680 initial, 4680 maximal
0.69/0.77 c Presolved Problem :
0.69/0.77 c Problem name : t_HOME/instance-2664678-1276450293.opb
0.69/0.77 c Variables : 466 (466 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.77 c Constraints : 1426 initial, 1433 maximal
0.69/0.77 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.77 c trivial : 0.01 1 0 0 0 0 0 0 0
0.69/0.77 c dualfix : 0.00 10 0 0 0 0 0 0 0
0.69/0.77 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.77 c implics : 0.06 0 1612 0 0 0 0 0 0
0.69/0.77 c probing : 0.15 6 178 0 0 0 0 0 0
0.69/0.77 c linear : 0.15 51 394 0 51 0 3198 87 37
0.69/0.77 c logicor : 0.10 0 0 0 0 0 56 0 0
0.69/0.77 c root node : - 150 - - 150 - - - -
0.69/0.77 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.77 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.77 c logicor : 1426+ 0 3166 0 0 98 3539 0 0 0
0.69/0.77 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.77 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.77 c logicor : 0.07 0.00 0.07 0.00 0.00
0.69/0.77 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.77 c Propagators : Time Calls Cutoffs DomReds
0.69/0.77 c vbounds : 0.00 2 0 0
0.69/0.77 c rootredcost : 0.00 0 0 0
0.69/0.77 c pseudoobj : 0.04 1527 0 0
0.69/0.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.77 c propagation : 0.00 96 94 94 3.2 12 4.8 -
0.69/0.77 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.77 c applied globally : - - - 106 3.4 - - -
0.69/0.77 c applied locally : - - - 0 0.0 - - -
0.69/0.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.77 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.77 c redcost : 0.00 0 0 0 0 0
0.69/0.77 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.77 c intobj : 0.00 0 0 0 0 0
0.69/0.77 c cgmip : 0.00 0 0 0 0 0
0.69/0.77 c gomory : 0.00 0 0 0 0 0
0.69/0.77 c strongcg : 0.00 0 0 0 0 0
0.69/0.77 c cmir : 0.00 0 0 0 0 0
0.69/0.77 c flowcover : 0.00 0 0 0 0 0
0.69/0.77 c clique : 0.00 0 0 0 0 0
0.69/0.77 c zerohalf : 0.00 0 0 0 0 0
0.69/0.77 c mcf : 0.00 0 0 0 0 0
0.69/0.77 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.77 c Pricers : Time Calls Vars
0.69/0.77 c problem variables: 0.00 0 0
0.69/0.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.77 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.77 c pscost : 0.00 0 0 0 0 0 0
0.69/0.77 c inference : 0.00 168 0 0 0 0 336
0.69/0.77 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.77 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.77 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.77 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.77 c random : 0.00 0 0 0 0 0 0
0.69/0.77 c Primal Heuristics : Time Calls Found
0.69/0.77 c LP solutions : 0.00 - 0
0.69/0.77 c pseudo solutions : 0.00 - 0
0.69/0.77 c oneopt : 0.00 0 0
0.69/0.77 c trivial : 0.01 2 0
0.69/0.77 c simplerounding : 0.00 0 0
0.69/0.77 c zirounding : 0.00 0 0
0.69/0.77 c rounding : 0.00 0 0
0.69/0.77 c shifting : 0.00 0 0
0.69/0.77 c intshifting : 0.00 0 0
0.69/0.77 c twoopt : 0.00 0 0
0.69/0.77 c fixandinfer : 0.00 0 0
0.69/0.77 c feaspump : 0.00 0 0
0.69/0.77 c coefdiving : 0.00 0 0
0.69/0.77 c pscostdiving : 0.00 0 0
0.69/0.77 c fracdiving : 0.00 0 0
0.69/0.77 c veclendiving : 0.00 0 0
0.69/0.77 c intdiving : 0.00 0 0
0.69/0.77 c actconsdiving : 0.00 0 0
0.69/0.77 c objpscostdiving : 0.00 0 0
0.69/0.77 c rootsoldiving : 0.00 0 0
0.69/0.77 c linesearchdiving : 0.00 0 0
0.69/0.77 c guideddiving : 0.00 0 0
0.69/0.77 c octane : 0.00 0 0
0.69/0.77 c rens : 0.00 0 0
0.69/0.77 c rins : 0.00 0 0
0.69/0.77 c localbranching : 0.00 0 0
0.69/0.77 c mutation : 0.00 0 0
0.69/0.77 c crossover : 0.00 0 0
0.69/0.77 c dins : 0.00 0 0
0.69/0.77 c undercover : 0.00 0 0
0.69/0.77 c nlp : 0.00 0 0
0.69/0.77 c trysol : 0.00 0 0
0.69/0.77 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.77 c primal LP : 0.00 0 0 0.00 -
0.69/0.77 c dual LP : 0.00 0 0 0.00 -
0.69/0.77 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.77 c barrier LP : 0.00 0 0 0.00 -
0.69/0.77 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.77 c strong branching : 0.00 0 0 0.00 -
0.69/0.77 c (at root node) : - 0 0 0.00 -
0.69/0.77 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.77 c B&B Tree :
0.69/0.77 c number of runs : 1
0.69/0.77 c nodes : 210
0.69/0.77 c nodes (total) : 210
0.69/0.77 c nodes left : 0
0.69/0.77 c max depth : 28
0.69/0.77 c max depth (total): 28
0.69/0.77 c backtracks : 54 (25.7%)
0.69/0.77 c delayed cutoffs : 127
0.69/0.77 c repropagations : 238 (1713 domain reductions, 54 cutoffs)
0.69/0.77 c avg switch length: 3.40
0.69/0.77 c switching time : 0.02
0.69/0.77 c Solution :
0.69/0.77 c Solutions found : 0 (0 improvements)
0.69/0.77 c Primal Bound : infeasible
0.69/0.77 c Dual Bound : -
0.69/0.77 c Gap : 0.00 %
0.69/0.77 c Root Dual Bound : +1.24900000000000e+03
0.69/0.77 c Root Iterations : 0
0.69/0.79 c Time complete: 0.79.