0.89/0.94 c SCIP version 1.1.0.7
0.89/0.94 c LP-Solver Clp 1.8.2
0.89/0.94 c user parameter file <scip.set> not found - using default parameters
0.89/0.94 c read problem <HOME/instance-1868579-1245128593.opb>
0.89/0.94 c original problem has 19944 variables (19944 bin, 0 int, 0 impl, 0 cont) and 50842 constraints
1.19/1.23 c No objective function, only one solution is needed.
1.19/1.23 c start presolving problem
1.19/1.23 c presolving:
1.99/2.07 c (round 1) 297 del vars, 1 del conss, 1 chg bounds, 3472 chg sides, 6944 chg coeffs, 0 upgd conss, 863698 impls, 0 clqs
2.10/2.15 c (round 2) 299 del vars, 596 del conss, 3 chg bounds, 3472 chg sides, 6944 chg coeffs, 0 upgd conss, 863698 impls, 0 clqs
2.10/2.19 c (round 3) 303 del vars, 604 del conss, 7 chg bounds, 3472 chg sides, 6944 chg coeffs, 0 upgd conss, 863698 impls, 0 clqs
2.19/2.24 c presolving (4 rounds):
2.19/2.24 c 422 deleted vars, 841 deleted constraints, 126 tightened bounds, 0 added holes, 3472 changed sides, 6944 changed coefficients
2.19/2.24 c 863698 implications, 0 cliques
2.19/2.27 c presolving detected infeasibility
2.19/2.27 c Presolving Time: 0.93
2.19/2.27 c SATUNSAT-LIN
2.19/2.27 c -----------------------------------------------------------------------------------------------
2.19/2.27 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c separating/flowcover/freq = c -1
2.19/2.27 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c separating/cmir/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/veclendiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/veclendiving/maxlpiterquot = c 0.075
2.19/2.27 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/veclendiving/freq = c -1
2.19/2.27 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/simplerounding/freq = c -1
2.19/2.27 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/shifting/freq = c -1
2.19/2.27 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/rounding/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/rootsoldiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.19/2.27 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
2.19/2.27 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 20]
2.19/2.27 c heuristics/rootsoldiving/freq = c -1
2.19/2.27 c # number of nodes added to the contingent of the total nodes
2.19/2.27 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.19/2.27 c heuristics/rens/nodesofs = c 2000
2.19/2.27 c # minimum percentage of integer variables that have to be fixable
2.19/2.27 c # [type: real, range: [0,1], default: 0.5]
2.19/2.27 c heuristics/rens/minfixingrate = c 0.3
2.19/2.27 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 0]
2.19/2.27 c heuristics/rens/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/pscostdiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/pscostdiving/maxlpiterquot = c 0.075
2.19/2.27 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/pscostdiving/freq = c -1
2.19/2.27 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 1]
2.19/2.27 c heuristics/oneopt/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/objpscostdiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to total iteration number
2.19/2.27 c # [type: real, range: [0,1], default: 0.01]
2.19/2.27 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
2.19/2.27 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 20]
2.19/2.27 c heuristics/objpscostdiving/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/linesearchdiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
2.19/2.27 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/linesearchdiving/freq = c -1
2.19/2.27 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/intshifting/freq = c -1
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/intdiving/maxlpiterquot = c 0.075
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/guideddiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/guideddiving/maxlpiterquot = c 0.075
2.19/2.27 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/guideddiving/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/fracdiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/fracdiving/maxlpiterquot = c 0.075
2.19/2.27 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/fracdiving/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/feaspump/maxlpiterofs = c 2000
2.19/2.27 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 20]
2.19/2.27 c heuristics/feaspump/freq = c -1
2.19/2.27 c # minimum percentage of integer variables that have to be fixed
2.19/2.27 c # [type: real, range: [0,1], default: 0.666]
2.19/2.27 c heuristics/crossover/minfixingrate = c 0.5
2.19/2.27 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.19/2.27 c # [type: real, range: [0,1], default: 0.1]
2.19/2.27 c heuristics/crossover/nodesquot = c 0.15
2.19/2.27 c # number of nodes without incumbent change that heuristic should wait
2.19/2.27 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.19/2.27 c heuristics/crossover/nwaitingnodes = c 100
2.19/2.27 c # number of nodes added to the contingent of the total nodes
2.19/2.27 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.19/2.27 c heuristics/crossover/nodesofs = c 750
2.19/2.27 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 30]
2.19/2.27 c heuristics/crossover/freq = c -1
2.19/2.27 c # additional number of allowed LP iterations
2.19/2.27 c # [type: int, range: [0,2147483647], default: 1000]
2.19/2.27 c heuristics/coefdiving/maxlpiterofs = c 1500
2.19/2.27 c # maximal fraction of diving LP iterations compared to node LP iterations
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.19/2.27 c heuristics/coefdiving/maxlpiterquot = c 0.075
2.19/2.27 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 10]
2.19/2.27 c heuristics/coefdiving/freq = c -1
2.19/2.27 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c presolving/probing/maxrounds = c 0
2.19/2.27 c # should presolving try to simplify knapsacks
2.19/2.27 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.19/2.27 c constraints/knapsack/simplifyinequalities = c TRUE
2.19/2.27 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.19/2.27 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.19/2.27 c constraints/knapsack/disaggregation = c FALSE
2.19/2.27 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c constraints/knapsack/maxnumcardlift = c 0
2.19/2.27 c # should presolving try to simplify inequalities
2.19/2.27 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.19/2.27 c constraints/linear/simplifyinequalities = c TRUE
2.19/2.27 c # maximal number of separation rounds in the root node (-1: unlimited)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c separating/maxroundsroot = c 5
2.19/2.27 c # maximal number of separation rounds per node (-1: unlimited)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 5]
2.19/2.27 c separating/maxrounds = c 1
2.19/2.27 c # solving stops, if the given number of solutions were found (-1: no limit)
2.19/2.27 c # [type: int, range: [-1,2147483647], default: -1]
2.19/2.27 c limits/solutions = c 1
2.19/2.27 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.19/2.27 c limits/memory = c 1620
2.19/2.27 c # maximal time in seconds to run
2.19/2.27 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.19/2.27 c limits/time = c 1791
2.19/2.27 c # frequency for displaying node information lines
2.19/2.27 c # [type: int, range: [-1,2147483647], default: 100]
2.19/2.27 c display/freq = c 10000
2.19/2.27 c -----------------------------------------------------------------------------------------------
2.19/2.27 c start solving problem
2.19/2.27 c
2.19/2.27 c SCIP Status : problem is solved [infeasible]
2.19/2.27 c Solving Time (sec) : 1.11
2.19/2.27 c Solving Nodes : 0
2.19/2.27 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.19/2.27 c Dual Bound : -1.00000000000000e+20
2.19/2.27 c Gap : infinite
2.19/2.27 c NODE 0
2.19/2.27 c DUAL BOUND -1e+20
2.19/2.27 c PRIMAL BOUND 1e+20
2.19/2.27 c GAP 1e+20
2.19/2.27 s UNSATISFIABLE
2.19/2.27 c SCIP Status : problem is solved [infeasible]
2.19/2.27 c Solving Time : 1.11
2.19/2.27 c Original Problem :
2.19/2.27 c Problem name : HOME/instance-1868579-1245128593.opb
2.19/2.27 c Variables : 19944 (19944 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.27 c Constraints : 50842 initial, 50842 maximal
2.19/2.27 c Presolved Problem :
2.19/2.27 c Problem name : t_HOME/instance-1868579-1245128593.opb
2.19/2.27 c Variables : 19522 (19522 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.27 c Constraints : 50001 initial, 50001 maximal
2.19/2.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.19/2.27 c trivial : 0.02 0 0 0 0 0 0 0 0
2.19/2.27 c dualfix : 0.01 0 0 0 0 0 0 0 0
2.19/2.27 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.19/2.27 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.19/2.27 c implics : 0.06 0 296 0 0 0 0 0 0
2.19/2.27 c probing : 0.00 0 0 0 0 0 0 0 0
2.19/2.27 c linear : 0.76 126 0 0 126 0 841 3472 6944
2.19/2.27 c root node : - 0 - - 0 - - - -
2.19/2.27 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.19/2.27 c integral : 0 0 0 0 0 0 0 0 0 0
2.19/2.27 c linear : 50001 0 0 0 0 0 0 0 0 0
2.19/2.27 c countsols : 0 0 0 0 0 0 0 0 0 0
2.19/2.27 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.19/2.27 c integral : 0.00 0.00 0.00 0.00 0.00
2.19/2.27 c linear : 0.00 0.00 0.00 0.00 0.00
2.19/2.27 c countsols : 0.00 0.00 0.00 0.00 0.00
2.19/2.27 c Propagators : Time Calls Cutoffs DomReds
2.19/2.27 c pseudoobj : 0.00 0 0 0
2.19/2.27 c rootredcost : 0.00 0 0 0
2.19/2.27 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.19/2.27 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.27 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.27 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.27 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.27 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.27 c applied globally : - - - 0 0.0 - - -
2.19/2.27 c applied locally : - - - 0 0.0 - - -
2.19/2.27 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.19/2.27 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.19/2.27 c redcost : 0.00 0 0 0 0 0
2.19/2.27 c impliedbounds : 0.00 0 0 0 0 0
2.19/2.27 c intobj : 0.00 0 0 0 0 0
2.19/2.27 c gomory : 0.00 0 0 0 0 0
2.19/2.27 c strongcg : 0.00 0 0 0 0 0
2.19/2.27 c cmir : 0.00 0 0 0 0 0
2.19/2.27 c flowcover : 0.00 0 0 0 0 0
2.19/2.27 c clique : 0.00 0 0 0 0 0
2.19/2.27 c zerohalf : 0.00 0 0 0 0 0
2.19/2.27 c mcf : 0.00 0 0 0 0 0
2.19/2.27 c Pricers : Time Calls Vars
2.19/2.27 c problem variables: 0.00 0 0
2.19/2.27 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.19/2.27 c pscost : 0.00 0 0 0 0 0 0
2.19/2.27 c inference : 0.00 0 0 0 0 0 0
2.19/2.27 c mostinf : 0.00 0 0 0 0 0 0
2.19/2.27 c leastinf : 0.00 0 0 0 0 0 0
2.19/2.27 c fullstrong : 0.00 0 0 0 0 0 0
2.19/2.27 c allfullstrong : 0.00 0 0 0 0 0 0
2.19/2.27 c random : 0.00 0 0 0 0 0 0
2.19/2.27 c relpscost : 0.00 0 0 0 0 0 0
2.19/2.27 c Primal Heuristics : Time Calls Found
2.19/2.27 c LP solutions : 0.00 - 0
2.19/2.27 c pseudo solutions : 0.00 - 0
2.19/2.27 c simplerounding : 0.00 0 0
2.19/2.27 c rounding : 0.00 0 0
2.19/2.27 c shifting : 0.00 0 0
2.19/2.27 c intshifting : 0.00 0 0
2.19/2.27 c oneopt : 0.00 0 0
2.19/2.27 c fixandinfer : 0.00 0 0
2.19/2.27 c feaspump : 0.00 0 0
2.19/2.27 c coefdiving : 0.00 0 0
2.19/2.27 c pscostdiving : 0.00 0 0
2.19/2.27 c fracdiving : 0.00 0 0
2.19/2.27 c veclendiving : 0.00 0 0
2.19/2.27 c intdiving : 0.00 0 0
2.19/2.27 c actconsdiving : 0.00 0 0
2.19/2.27 c objpscostdiving : 0.00 0 0
2.19/2.27 c rootsoldiving : 0.00 0 0
2.19/2.27 c linesearchdiving : 0.00 0 0
2.19/2.27 c guideddiving : 0.00 0 0
2.19/2.27 c octane : 0.00 0 0
2.19/2.27 c rens : 0.00 0 0
2.19/2.27 c rins : 0.00 0 0
2.19/2.27 c localbranching : 0.00 0 0
2.19/2.27 c mutation : 0.00 0 0
2.19/2.27 c crossover : 0.00 0 0
2.19/2.27 c dins : 0.00 0 0
2.19/2.27 c LP : Time Calls Iterations Iter/call Iter/sec
2.19/2.27 c primal LP : 0.00 0 0 0.00 -
2.19/2.27 c dual LP : 0.00 0 0 0.00 -
2.19/2.27 c barrier LP : 0.00 0 0 0.00 -
2.19/2.27 c diving/probing LP: 0.00 0 0 0.00 -
2.19/2.27 c strong branching : 0.00 0 0 0.00 -
2.19/2.27 c (at root node) : - 0 0 0.00 -
2.19/2.27 c conflict analysis: 0.00 0 0 0.00 -
2.19/2.27 c B&B Tree :
2.19/2.27 c number of runs : 1
2.19/2.27 c nodes : 0
2.19/2.27 c nodes (total) : 0
2.19/2.27 c nodes left : 1
2.19/2.27 c max depth : -1
2.19/2.27 c max depth (total): -1
2.19/2.27 c backtracks : 0 (0.0%)
2.19/2.27 c delayed cutoffs : 0
2.19/2.27 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.19/2.27 c avg switch length: 0.00
2.19/2.27 c switching time : 0.00
2.19/2.27 c Solution :
2.19/2.27 c Solutions found : 0 (0 improvements)
2.19/2.27 c Primal Bound : infeasible
2.19/2.27 c Dual Bound : -
2.19/2.27 c Gap : infinite
2.19/2.27 c Root Dual Bound : -
2.39/2.48 c Time complete: 2.48.