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-2664640-1276420934.opb>
0.06/0.09 c original problem has 2080 variables (2080 bin, 0 int, 0 impl, 0 cont) and 4708 constraints
0.06/0.09 c problem read
0.06/0.09 c presolving settings loaded
0.06/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.12 c presolving:
0.09/0.18 c (round 1) 1121 del vars, 178 del conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 40808 impls, 0 clqs
0.19/0.22 c (round 2) 1227 del vars, 1783 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 44511 impls, 0 clqs
0.19/0.23 c (round 3) 1290 del vars, 2050 del conss, 73 chg bounds, 1 chg sides, 2 chg coeffs, 0 upgd conss, 45553 impls, 0 clqs
0.19/0.24 c (round 4) 1352 del vars, 2380 del conss, 138 chg bounds, 61 chg sides, 107 chg coeffs, 0 upgd conss, 46394 impls, 0 clqs
0.19/0.25 c (round 5) 1401 del vars, 2518 del conss, 162 chg bounds, 61 chg sides, 107 chg coeffs, 0 upgd conss, 46394 impls, 0 clqs
0.19/0.25 c (round 6) 1402 del vars, 2519 del conss, 162 chg bounds, 61 chg sides, 107 chg coeffs, 0 upgd conss, 46412 impls, 0 clqs
0.29/0.37 c (round 7) 1402 del vars, 2564 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2098 upgd conss, 46412 impls, 0 clqs
0.29/0.39 c (round 8) 1404 del vars, 2566 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2098 upgd conss, 46412 impls, 0 clqs
0.39/0.41 c (round 9) 1404 del vars, 2566 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 46412 impls, 0 clqs
0.39/0.44 c (round 10) 1459 del vars, 2566 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 49528 impls, 0 clqs
0.39/0.45 c (round 11) 1459 del vars, 2675 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 49528 impls, 0 clqs
0.39/0.48 c (round 12) 1510 del vars, 2675 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 51896 impls, 0 clqs
0.39/0.48 c (round 13) 1510 del vars, 2839 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 51896 impls, 0 clqs
0.39/0.48 c (round 14) 1511 del vars, 2840 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 51896 impls, 0 clqs
0.49/0.51 c (round 15) 1511 del vars, 2841 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 51896 impls, 0 clqs
0.49/0.54 c (round 16) 1587 del vars, 2841 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 52646 impls, 0 clqs
0.49/0.54 c (round 17) 1587 del vars, 3092 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 52652 impls, 0 clqs
0.49/0.55 c (round 18) 1593 del vars, 3098 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 52652 impls, 0 clqs
0.49/0.55 c (round 19) 1594 del vars, 3106 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 52652 impls, 0 clqs
0.59/0.61 c (round 20) 1594 del vars, 3119 del conss, 162 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 52652 impls, 0 clqs
0.59/0.68 c (round 21) 1644 del vars, 3119 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 54852 impls, 0 clqs
0.59/0.68 c (round 22) 1644 del vars, 3168 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 54852 impls, 0 clqs
0.59/0.68 c (round 23) 1646 del vars, 3169 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 54852 impls, 0 clqs
0.69/0.75 c (round 24) 1691 del vars, 3169 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 55440 impls, 0 clqs
0.69/0.75 c (round 25) 1691 del vars, 3201 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 55440 impls, 0 clqs
0.69/0.76 c (round 26) 1692 del vars, 3204 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 55440 impls, 0 clqs
0.69/0.76 c (round 27) 1693 del vars, 3207 del conss, 164 chg bounds, 105 chg sides, 107 chg coeffs, 2142 upgd conss, 55440 impls, 0 clqs
0.69/0.78 c presolving (28 rounds):
0.69/0.78 c 1693 deleted vars, 3207 deleted constraints, 164 tightened bounds, 0 added holes, 105 changed sides, 107 changed coefficients
0.69/0.78 c 55440 implications, 0 cliques
0.69/0.78 c presolved problem has 387 variables (387 bin, 0 int, 0 impl, 0 cont) and 1501 constraints
0.69/0.78 c 1501 constraints of type <logicor>
0.69/0.78 c transformed objective value is always integral (scale: 1)
0.69/0.78 c Presolving Time: 0.57
0.69/0.78 c - non default parameters ----------------------------------------------------------------------
0.69/0.78 c # SCIP version 1.2.1.2
0.69/0.78 c
0.69/0.78 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.78 c conflict/interconss = 0
0.69/0.78 c
0.69/0.78 c # should binary conflicts be preferred?
0.69/0.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.78 c conflict/preferbinary = TRUE
0.69/0.78 c
0.69/0.78 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 0]
0.69/0.78 c constraints/agelimit = 1
0.69/0.78 c
0.69/0.78 c # should enforcement of pseudo solution be disabled?
0.69/0.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.78 c constraints/disableenfops = TRUE
0.69/0.78 c
0.69/0.78 c # frequency for displaying node information lines
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.78 c display/freq = 10000
0.69/0.78 c
0.69/0.78 c # maximal time in seconds to run
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.78 c limits/time = 1799.92
0.69/0.78 c
0.69/0.78 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.78 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.78 c limits/memory = 1620
0.69/0.78 c
0.69/0.78 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.69/0.78 c # [type: int, range: [-1,2147483647], default: 1]
0.69/0.78 c lp/solvefreq = -1
0.69/0.78 c
0.69/0.78 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.69/0.78 c # [type: char, range: {lafpsqd}, default: l]
0.69/0.78 c lp/pricing = a
0.69/0.78 c
0.69/0.78 c # should presolving try to simplify inequalities
0.69/0.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.78 c constraints/linear/simplifyinequalities = TRUE
0.69/0.78 c
0.69/0.78 c # should presolving try to simplify knapsacks
0.69/0.78 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.78 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.78 c
0.69/0.78 c # priority of node selection rule <dfs> in standard mode
0.69/0.78 c # [type: int, range: [-536870912,536870911], default: 0]
0.69/0.78 c nodeselection/dfs/stdpriority = 1000000
0.69/0.78 c
0.69/0.78 c -----------------------------------------------------------------------------------------------
0.69/0.78 c start solving
0.69/0.78 c
0.69/0.78 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.78 c 0.6s| 1 | 2 | 0 | - |6569k| 0 | - | 387 |1501 | 0 | 0 | 0 | 0 | 0 | 8.800000e+02 | -- | Inf
1.59/1.66 c
1.59/1.66 c SCIP Status : problem is solved [infeasible]
1.59/1.66 c Solving Time (sec) : 1.41
1.59/1.66 c Solving Nodes : 1514
1.59/1.66 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.59/1.66 c Dual Bound : +1.00000000000000e+20
1.59/1.66 c Gap : 0.00 %
1.59/1.66 s UNSATISFIABLE
1.59/1.66 c SCIP Status : problem is solved [infeasible]
1.59/1.66 c Solving Time : 1.41
1.59/1.66 c Original Problem :
1.59/1.66 c Problem name : HOME/instance-2664640-1276420934.opb
1.59/1.66 c Variables : 2080 (2080 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.66 c Constraints : 4708 initial, 4708 maximal
1.59/1.66 c Presolved Problem :
1.59/1.66 c Problem name : t_HOME/instance-2664640-1276420934.opb
1.59/1.66 c Variables : 387 (387 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.66 c Constraints : 1501 initial, 1533 maximal
1.59/1.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.66 c trivial : 0.00 69 0 0 0 0 0 0 0
1.59/1.66 c dualfix : 0.00 94 0 0 0 0 0 0 0
1.59/1.66 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.66 c implics : 0.04 0 1036 0 0 0 0 0 0
1.59/1.66 c probing : 0.13 154 123 0 2 0 0 0 0
1.59/1.66 c linear : 0.16 130 87 0 162 0 2566 105 107
1.59/1.66 c logicor : 0.22 0 0 0 0 0 641 0 0
1.59/1.66 c root node : - 221 - - 221 - - - -
1.59/1.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.66 c integral : 0 0 0 0 0 0 0 0 0 0
1.59/1.66 c logicor : 1501+ 0 14083 0 0 839 41349 0 0 0
1.59/1.66 c countsols : 0 0 0 0 0 0 0 0 0 0
1.59/1.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.66 c integral : 0.00 0.00 0.00 0.00 0.00
1.59/1.66 c logicor : 0.36 0.00 0.36 0.00 0.00
1.59/1.66 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.66 c Propagators : Time Calls Cutoffs DomReds
1.59/1.66 c vbounds : 0.00 2 0 0
1.59/1.66 c rootredcost : 0.01 0 0 0
1.59/1.66 c pseudoobj : 0.21 13335 0 0
1.59/1.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.66 c propagation : 0.03 831 793 793 6.3 312 7.1 -
1.59/1.66 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.66 c applied globally : - - - 1105 6.5 - - -
1.59/1.66 c applied locally : - - - 0 0.0 - - -
1.59/1.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.66 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.59/1.66 c redcost : 0.00 0 0 0 0 0
1.59/1.66 c impliedbounds : 0.00 0 0 0 0 0
1.59/1.66 c intobj : 0.00 0 0 0 0 0
1.59/1.66 c cgmip : 0.00 0 0 0 0 0
1.59/1.66 c gomory : 0.00 0 0 0 0 0
1.59/1.66 c strongcg : 0.00 0 0 0 0 0
1.59/1.66 c cmir : 0.00 0 0 0 0 0
1.59/1.66 c flowcover : 0.00 0 0 0 0 0
1.59/1.66 c clique : 0.00 0 0 0 0 0
1.59/1.66 c zerohalf : 0.00 0 0 0 0 0
1.59/1.66 c mcf : 0.00 0 0 0 0 0
1.59/1.66 c rapidlearning : 0.00 0 0 0 0 0
1.59/1.66 c Pricers : Time Calls Vars
1.59/1.66 c problem variables: 0.00 0 0
1.59/1.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.66 c relpscost : 0.00 0 0 0 0 0 0
1.59/1.66 c pscost : 0.00 0 0 0 0 0 0
1.59/1.66 c inference : 0.05 1077 0 0 0 0 2154
1.59/1.66 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.66 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.66 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.66 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.66 c random : 0.00 0 0 0 0 0 0
1.59/1.66 c Primal Heuristics : Time Calls Found
1.59/1.66 c LP solutions : 0.00 - 0
1.59/1.66 c pseudo solutions : 0.00 - 0
1.59/1.66 c oneopt : 0.00 0 0
1.59/1.66 c trivial : 0.02 2 0
1.59/1.66 c simplerounding : 0.00 0 0
1.59/1.66 c zirounding : 0.00 0 0
1.59/1.66 c rounding : 0.00 0 0
1.59/1.66 c shifting : 0.00 0 0
1.59/1.66 c intshifting : 0.00 0 0
1.59/1.66 c twoopt : 0.00 0 0
1.59/1.66 c fixandinfer : 0.00 0 0
1.59/1.66 c feaspump : 0.00 0 0
1.59/1.66 c coefdiving : 0.00 0 0
1.59/1.66 c pscostdiving : 0.00 0 0
1.59/1.66 c fracdiving : 0.00 0 0
1.59/1.66 c veclendiving : 0.00 0 0
1.59/1.66 c intdiving : 0.00 0 0
1.59/1.66 c actconsdiving : 0.00 0 0
1.59/1.66 c objpscostdiving : 0.00 0 0
1.59/1.66 c rootsoldiving : 0.00 0 0
1.59/1.66 c linesearchdiving : 0.00 0 0
1.59/1.66 c guideddiving : 0.00 0 0
1.59/1.66 c octane : 0.00 0 0
1.59/1.66 c rens : 0.00 0 0
1.59/1.66 c rins : 0.00 0 0
1.59/1.66 c localbranching : 0.00 0 0
1.59/1.66 c mutation : 0.00 0 0
1.59/1.66 c crossover : 0.00 0 0
1.59/1.66 c dins : 0.00 0 0
1.59/1.66 c undercover : 0.00 0 0
1.59/1.66 c nlp : 0.00 0 0
1.59/1.66 c trysol : 0.00 0 0
1.59/1.66 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.66 c primal LP : 0.00 0 0 0.00 -
1.59/1.66 c dual LP : 0.00 0 0 0.00 -
1.59/1.66 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.66 c barrier LP : 0.00 0 0 0.00 -
1.59/1.66 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.66 c strong branching : 0.00 0 0 0.00 -
1.59/1.66 c (at root node) : - 0 0 0.00 -
1.59/1.66 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.66 c B&B Tree :
1.59/1.66 c number of runs : 1
1.59/1.66 c nodes : 1514
1.59/1.66 c nodes (total) : 1514
1.59/1.66 c nodes left : 0
1.59/1.66 c max depth : 29
1.59/1.66 c max depth (total): 29
1.59/1.66 c backtracks : 462 (30.5%)
1.59/1.66 c delayed cutoffs : 641
1.59/1.66 c repropagations : 1600 (15619 domain reductions, 394 cutoffs)
1.59/1.66 c avg switch length: 3.19
1.59/1.66 c switching time : 0.07
1.59/1.66 c Solution :
1.59/1.66 c Solutions found : 0 (0 improvements)
1.59/1.66 c Primal Bound : infeasible
1.59/1.66 c Dual Bound : -
1.59/1.66 c Gap : 0.00 %
1.59/1.66 c Root Dual Bound : +8.80000000000000e+02
1.59/1.66 c Root Iterations : 0
1.59/1.68 c Time complete: 1.67.