0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2702887-1278575982.opb>
0.39/0.45 c original problem has 38366 variables (38366 bin, 0 int, 0 impl, 0 cont) and 38868 constraints
0.39/0.45 c problem read
0.39/0.45 c No objective function, only one solution is needed.
0.39/0.45 c presolving settings loaded
0.89/0.94 c presolving:
2.09/2.19 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1501 upgd conss, 298296 impls, 1000 clqs
2.99/3.04 c presolving (2 rounds):
2.99/3.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.99/3.04 c 298296 implications, 1000 cliques
2.99/3.04 c presolved problem has 38366 variables (38366 bin, 0 int, 0 impl, 0 cont) and 38868 constraints
2.99/3.04 c 1 constraints of type <knapsack>
2.99/3.04 c 1500 constraints of type <setppc>
2.99/3.04 c 37366 constraints of type <and>
2.99/3.04 c 1 constraints of type <linear>
2.99/3.04 c transformed objective value is always integral (scale: 1)
2.99/3.04 c Presolving Time: 2.34
2.99/3.04 c - non default parameters ----------------------------------------------------------------------
2.99/3.04 c # SCIP version 1.2.1.3
2.99/3.04 c
2.99/3.04 c # frequency for displaying node information lines
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 100]
2.99/3.04 c display/freq = 10000
2.99/3.04 c
2.99/3.04 c # maximal time in seconds to run
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.04 c limits/time = 1789.56
2.99/3.04 c
2.99/3.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.99/3.04 c limits/memory = 1620
2.99/3.04 c
2.99/3.04 c # solving stops, if the given number of solutions were found (-1: no limit)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.04 c limits/solutions = 1
2.99/3.04 c
2.99/3.04 c # maximal number of separation rounds per node (-1: unlimited)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 5]
2.99/3.04 c separating/maxrounds = 1
2.99/3.04 c
2.99/3.04 c # maximal number of separation rounds in the root node (-1: unlimited)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.04 c separating/maxroundsroot = 5
2.99/3.04 c
2.99/3.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.99/3.04 c # [type: int, range: [1,2], default: 1]
2.99/3.04 c timing/clocktype = 2
2.99/3.04 c
2.99/3.04 c # should presolving try to simplify inequalities
2.99/3.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.04 c constraints/linear/simplifyinequalities = TRUE
2.99/3.04 c
2.99/3.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
2.99/3.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.04 c constraints/indicator/addCouplingCons = TRUE
2.99/3.04 c
2.99/3.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.99/3.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.99/3.04 c constraints/knapsack/disaggregation = FALSE
2.99/3.04 c
2.99/3.04 c # should presolving try to simplify knapsacks
2.99/3.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.04 c constraints/knapsack/simplifyinequalities = TRUE
2.99/3.04 c
2.99/3.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.04 c presolving/probing/maxrounds = 0
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/coefdiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/coefdiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/coefdiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 30]
2.99/3.04 c heuristics/crossover/freq = -1
2.99/3.04 c
2.99/3.04 c # number of nodes added to the contingent of the total nodes
2.99/3.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.04 c heuristics/crossover/nodesofs = 750
2.99/3.04 c
2.99/3.04 c # number of nodes without incumbent change that heuristic should wait
2.99/3.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.99/3.04 c heuristics/crossover/nwaitingnodes = 100
2.99/3.04 c
2.99/3.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.99/3.04 c # [type: real, range: [0,1], default: 0.1]
2.99/3.04 c heuristics/crossover/nodesquot = 0.15
2.99/3.04 c
2.99/3.04 c # minimum percentage of integer variables that have to be fixed
2.99/3.04 c # [type: real, range: [0,1], default: 0.666]
2.99/3.04 c heuristics/crossover/minfixingrate = 0.5
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.04 c heuristics/feaspump/freq = -1
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/feaspump/maxlpiterofs = 2000
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/fracdiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/fracdiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/fracdiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/guideddiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/guideddiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/guideddiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/intdiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/intshifting/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/linesearchdiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.04 c heuristics/nlp/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.04 c heuristics/objpscostdiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to total iteration number
2.99/3.04 c # [type: real, range: [0,1], default: 0.01]
2.99/3.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.04 c heuristics/oneopt/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/pscostdiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/pscostdiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.04 c heuristics/rens/freq = -1
2.99/3.04 c
2.99/3.04 c # minimum percentage of integer variables that have to be fixable
2.99/3.04 c # [type: real, range: [0,1], default: 0.5]
2.99/3.04 c heuristics/rens/minfixingrate = 0.3
2.99/3.04 c
2.99/3.04 c # number of nodes added to the contingent of the total nodes
2.99/3.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.04 c heuristics/rens/nodesofs = 2000
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.04 c heuristics/rootsoldiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.99/3.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.04 c heuristics/rounding/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/shifting/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.04 c heuristics/simplerounding/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.04 c heuristics/trivial/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.04 c heuristics/trysol/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.04 c heuristics/veclendiving/freq = -1
2.99/3.04 c
2.99/3.04 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.04 c heuristics/veclendiving/maxlpiterquot = 0.075
2.99/3.04 c
2.99/3.04 c # additional number of allowed LP iterations
2.99/3.04 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.04 c heuristics/veclendiving/maxlpiterofs = 1500
2.99/3.04 c
2.99/3.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.04 c heuristics/zirounding/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.04 c separating/cmir/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.04 c separating/flowcover/freq = -1
2.99/3.04 c
2.99/3.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.99/3.04 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.04 c separating/rapidlearning/freq = 0
2.99/3.04 c
2.99/3.04 c -----------------------------------------------------------------------------------------------
2.99/3.04 c start solving
2.99/3.08 c
4.49/4.55 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.49/4.55 c 4.1s| 1 | 0 | 230 | - | 173M| 0 | 125 | 38k| 38k| 38k| 76k| 0 | 0 | 0 | 0.000000e+00 | -- | Inf
52.67/52.79 c 52.3s| 1 | 0 | 300 | - | 175M| 0 | 129 | 38k| 38k| 38k| 76k| 14 | 0 | 0 | 0.000000e+00 | -- | Inf
105.14/105.28 c 105s| 1 | 0 | 399 | - | 177M| 0 | 136 | 38k| 38k| 38k| 76k| 23 | 0 | 0 | 0.000000e+00 | -- | Inf
156.62/156.79 c 156s| 1 | 0 | 485 | - | 179M| 0 | 136 | 38k| 38k| 38k| 76k| 31 | 0 | 0 | 0.000000e+00 | -- | Inf
209.92/210.03 c 210s| 1 | 0 | 527 | - | 180M| 0 | 138 | 38k| 38k| 38k| 76k| 40 | 0 | 0 | 0.000000e+00 | -- | Inf
263.60/263.76 c 263s| 1 | 0 | 563 | - | 182M| 0 | 150 | 38k| 38k| 38k| 76k| 48 | 0 | 0 | 0.000000e+00 | -- | Inf
309.20/309.35 c 309s| 1 | 2 | 563 | - | 182M| 0 | 150 | 38k| 38k| 38k| 76k| 48 | 0 | 30 | 0.000000e+00 | -- | Inf
348.68/348.88 c * 348s| 55 | 0 | 1431 | 16.1 | 193M| 46 | - | 38k| 38k| 38k|1764 | 271 | 8 | 679 | 0.000000e+00 | 0.000000e+00 | 0.00%
348.78/348.95 c
348.78/348.95 c SCIP Status : problem is solved [optimal solution found]
348.78/348.95 c Solving Time (sec) : 348.50
348.78/348.95 c Solving Nodes : 55
348.78/348.95 c Primal Bound : +0.00000000000000e+00 (1 solutions)
348.78/348.95 c Dual Bound : +0.00000000000000e+00
348.78/348.95 c Gap : 0.00 %
348.88/349.06 s SATISFIABLE
348.88/349.06 v -x846 -x924 -x902 -x875 -x943 -x910 -x954 -x808 -x593 -x780 -x949 -x675 -x801 -x907 -x817 -x603 -x838 -x767 -x701 -x990 -x610 -x906
348.88/349.06 v -x562 -x835 -x721 -x704 -x748 -x958 -x655 -x936 -x867 -x831 -x697 -x986 -x852 -x574 x654 -x511 -x824 -x717 -x665 -x657 -x605
348.88/349.06 v -x584 -x577 -x763 -x878 -x987 -x883 -x590 -x876 -x951 -x912 -x708 -x686 -x705 -x586 -x732 -x963 -x932 -x848 -x734 -x575
348.88/349.06 v -x939 -x979 -x509 -x964 -x948 -x578 -x533 -x515 -x519 -x761 -x567 -x642 -x775 -x970 -x715 -x594 -x581 -x813 -x558 -x984 -x956
348.88/349.06 v -x853 -x788 -x784 -x597 -x589 -x545 -x950 -x972 -x739 -x678 -x786 -x630 -x693 -x635 -x648 -x983 -x947 -x890 -x855 -x832 -x735
348.88/349.06 v -x702 -x681 -x521 -x517 -x795 -x961 -x976 -x687 -x893 -x750 -x798 -x547 -x891 -x649 -x834 -x804 -x754 -x999 -x959 -x909 -x522
348.88/349.06 v -x703 -x962 -x977 -x911 -x864 -x862 -x791 -x766 -x762 -x752 -x674 -x672 -x639 -x617 -x611 -x536 -x994 -x885 -x643 -x995 -x799
348.88/349.06 v -x899 -x886 -x626 -x973 -x793 -x631 -x582 -x770 -x725 -x921 -x659 -x985 -x651 -x628 -x940 -x600 -x820 -x756 -x873 -x714 -x505
348.88/349.06 v -x978 -x901 -x823 -x723 -x696 -x695 -x663 -x656 -x641 -x634 -x621 -x604 -x580 -x579 -x573 -x843 -x711 -x660 -x913 -x888
348.88/349.06 v -x919 -x680 -x946 -x608 -x877 -x685 -x967 -x669 -x774 -x700 -x661 -x895 -x934 -x931 -x882 -x974 -x572 -x969 -x551 -x953 -x537
348.88/349.06 v -x601 -x563 -x925 -x759 -x917 -x960 -x889 -x840 -x792 -x768 -x753 -x749 -x742 -x692 -x627 -x615 -x576 -x564 -x548 -x525 -x524
348.88/349.06 v -x821 -x731 -x662 -x606 -x811 -x812 -x923 -x569 -x747 -x844 -x800 -x612 -x805 -x856 -x698 -x955 -x591 -x645 -x726 -x773 -x1000
348.88/349.06 v -x971 -x918 -x870 -x607 -x539 -x614 -x944 -x905 -x644 -x929 -x861 -x850 -x845 -x839 -x822 -x722 -x718 -x707 -x670 -x658 -x637
348.88/349.06 v -x629 -x609 -x553 -x550 -x534 -x518 -x510 -x736 -x738 -x859 -x622 -x975 -x908 -x776 -x938 -x552 -x860 -x728 -x992 -x744
348.88/349.06 v -x988 -x915 -x535 -x694 -x851 -x842 -x729 -x989 -x880 -x556 -x952 -x746 -x619 -x724 -x797 -x841 -x716 -x709 -x771 -x520 -x504
348.88/349.06 v -x830 -x733 -x872 -x807 -x966 -x854 -x998 -x502 -x980 -x937 -x898 -x897 -x829 -x826 -x810 -x790 -x769 -x765 -x758 -x743 -x719
348.88/349.06 v -x688 -x684 -x682 -x667 -x664 -x647 -x616 -x599 -x596 -x566 -x565 -x557 -x555 -x554 -x857 -x928 -x710 -x982 -x772 -x618 -x532
348.88/349.06 v -x941 -x620 -x945 -x690 -x866 -x942 -x787 -x781 -x802 -x757 -x653 -x818 -x903 -x598 -x602 -x968 -x879 -x571 -x796 -x540 -x595
348.88/349.06 v -x587 -x727 -x513 -x740 -x677 -x561 -x933 -x900 -x755 -x652 -x904 -x789 -x679 -x809 -x588 -x751 -x544 -x865 -x935 -x868 -x815
348.88/349.06 v -x546 -x583 -x896 -x501 -x996 -x991 -x965 -x892 -x881 -x849 -x833 -x827 -x819 -x779 -x777 -x760 -x745 -x741 -x720 -x713
348.88/349.06 v -x706 -x689 -x683 -x676 -x666 -x646 -x640 -x638 x633 -x632 -x625 -x623 -x613 x549 -x542 -x530 -x529 -x526 -x516 -x514 -x508 -x507
348.88/349.06 v -x503 -x858 -x814 -x847 -x506 x837 -x828 -x585 -x926 -x806 -x782 -x997 x671 -x981 -x592 -x527 -x914 -x871 -x816 -x825 -x699
348.88/349.06 v -x538 -x785 -x920 -x874 x730 -x543 x512 -x957 -x894 -x668 -x570 x559 -x523 -x803 -x636 -x624 -x531 x783 -x930 x568 -x869
348.88/349.06 v -x712 x737 -x673 -x541 x927 -x764 -x560 -x691 -x528 -x863 -x922 -x650 -x993 -x836 -x794 x916 x778 -x887 x884 -x500 -x499 -x498
348.88/349.06 v -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477
348.88/349.06 v -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456
348.88/349.06 v -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435
348.88/349.06 v -x434 -x433 -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415
348.88/349.06 v -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394
348.88/349.06 v -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373
348.88/349.06 v -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352
348.88/349.06 v -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331
348.88/349.06 v -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310
348.88/349.06 v -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290
348.88/349.06 v -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269
348.88/349.06 v -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248
348.88/349.06 v -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227
348.88/349.06 v -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 x210 -x209 -x208 -x207 -x206
348.88/349.06 v -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191 -x190 -x189 -x188 -x187 -x186 -x185
348.88/349.06 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164
348.88/349.06 v -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143
348.88/349.06 v -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123
348.88/349.06 v -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102
348.88/349.06 v -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80 -x79 -x78 -x77
348.88/349.06 v -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52
348.88/349.06 v -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 x31 -x30 x29 -x28 -x27
348.88/349.06 v 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 -x1
348.88/349.06 c SCIP Status : problem is solved [optimal solution found]
348.88/349.06 c Solving Time : 348.50
348.88/349.06 c Original Problem :
348.88/349.06 c Problem name : HOME/instance-2702887-1278575982.opb
348.88/349.06 c Variables : 38366 (38366 binary, 0 integer, 0 implicit integer, 0 continuous)
348.88/349.06 c Constraints : 38868 initial, 38868 maximal
348.88/349.06 c Presolved Problem :
348.88/349.06 c Problem name : t_HOME/instance-2702887-1278575982.opb
348.88/349.06 c Variables : 38366 (38366 binary, 0 integer, 0 implicit integer, 0 continuous)
348.88/349.06 c Constraints : 38868 initial, 38876 maximal
348.88/349.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
348.88/349.06 c trivial : 0.01 0 0 0 0 0 0 0 0
348.88/349.06 c dualfix : 0.01 0 0 0 0 0 0 0 0
348.88/349.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
348.88/349.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
348.88/349.06 c implics : 0.02 0 0 0 0 0 0 0 0
348.88/349.06 c probing : 0.00 0 0 0 0 0 0 0 0
348.88/349.06 c knapsack : 0.05 0 0 0 0 0 0 0 0
348.88/349.06 c setppc : 0.06 0 0 0 0 0 0 0 0
348.88/349.06 c and : 1.55 0 0 0 0 0 0 0 0
348.88/349.06 c linear : 0.30 0 0 0 0 0 0 0 0
348.88/349.06 c logicor : 0.00 0 0 0 0 0 0 0 0
348.88/349.06 c root node : - 0 - - 0 - - - -
348.88/349.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
348.88/349.06 c integral : 0 0 0 51 0 0 5 0 0 92
348.88/349.06 c knapsack : 1 5 203 1 0 0 0 0 0 0
348.88/349.06 c setppc : 1500 5 203 1 0 8 1481 0 0 0
348.88/349.06 c and : 37366 51 195 1 0 0 30815 231 0 0
348.88/349.06 c linear : 1 5 195 1 0 0 0 0 0 0
348.88/349.06 c logicor : 0+ 0 17 0 0 0 8 0 0 0
348.88/349.06 c countsols : 0 0 0 1 0 0 0 0 0 0
348.88/349.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
348.88/349.06 c integral : 77.54 0.00 0.00 77.54 0.00
348.88/349.06 c knapsack : 0.47 0.46 0.00 0.00 0.00
348.88/349.06 c setppc : 0.03 0.00 0.03 0.00 0.00
348.88/349.06 c and : 1.70 1.16 0.53 0.01 0.00
348.88/349.06 c linear : 0.03 0.00 0.03 0.00 0.00
348.88/349.06 c logicor : 0.00 0.00 0.00 0.00 0.00
348.88/349.06 c countsols : 0.00 0.00 0.00 0.00 0.00
348.88/349.06 c Propagators : Time Calls Cutoffs DomReds
348.88/349.06 c vbounds : 0.00 1 0 0
348.88/349.06 c rootredcost : 0.00 0 0 0
348.88/349.06 c pseudoobj : 0.00 0 0 0
348.88/349.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
348.88/349.06 c propagation : 0.00 8 8 8 3.0 0 0.0 -
348.88/349.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
348.88/349.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
348.88/349.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
348.88/349.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
348.88/349.06 c applied globally : - - - 8 3.0 - - -
348.88/349.06 c applied locally : - - - 0 0.0 - - -
348.88/349.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
348.88/349.06 c cut pool : 0.01 4 - - 4 - (maximal pool size: 432)
348.88/349.06 c redcost : 0.24 51 0 0 0 0
348.88/349.06 c impliedbounds : 0.03 5 0 0 16 0
348.88/349.06 c intobj : 0.00 0 0 0 0 0
348.88/349.06 c cgmip : 0.00 0 0 0 0 0
348.88/349.06 c gomory : 232.44 5 0 0 0 0
348.88/349.06 c strongcg : 13.98 5 0 0 2500 0
348.88/349.06 c cmir : 0.00 0 0 0 0 0
348.88/349.06 c flowcover : 0.00 0 0 0 0 0
348.88/349.06 c clique : 0.30 5 0 0 30 0
348.88/349.06 c zerohalf : 0.00 0 0 0 0 0
348.88/349.06 c mcf : 10.39 4 0 0 27 0
348.88/349.06 c rapidlearning : 0.00 0 0 0 0 0
348.88/349.06 c Pricers : Time Calls Vars
348.88/349.06 c problem variables: 0.00 0 0
348.88/349.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
348.88/349.06 c relpscost : 77.54 50 0 5 0 0 92
348.88/349.06 c pscost : 0.00 0 0 0 0 0 0
348.88/349.06 c inference : 0.00 0 0 0 0 0 0
348.88/349.06 c mostinf : 0.00 0 0 0 0 0 0
348.88/349.06 c leastinf : 0.00 0 0 0 0 0 0
348.88/349.06 c fullstrong : 0.00 0 0 0 0 0 0
348.88/349.06 c allfullstrong : 0.00 0 0 0 0 0 0
348.88/349.06 c random : 0.00 0 0 0 0 0 0
348.88/349.06 c Primal Heuristics : Time Calls Found
348.88/349.06 c LP solutions : 0.01 - 1
348.88/349.06 c pseudo solutions : 0.00 - 0
348.88/349.06 c trivial : 0.08 1 0
348.88/349.06 c simplerounding : 0.00 0 0
348.88/349.06 c zirounding : 0.00 0 0
348.88/349.06 c rounding : 0.00 0 0
348.88/349.06 c shifting : 0.00 0 0
348.88/349.06 c intshifting : 0.00 0 0
348.88/349.06 c oneopt : 0.00 0 0
348.88/349.06 c twoopt : 0.00 0 0
348.88/349.06 c fixandinfer : 0.00 0 0
348.88/349.06 c feaspump : 0.00 0 0
348.88/349.06 c coefdiving : 0.00 0 0
348.88/349.06 c pscostdiving : 0.00 0 0
348.88/349.06 c fracdiving : 0.00 0 0
348.88/349.06 c veclendiving : 0.00 0 0
348.88/349.06 c intdiving : 0.00 0 0
348.88/349.06 c actconsdiving : 0.00 0 0
348.88/349.06 c objpscostdiving : 0.00 0 0
348.88/349.06 c rootsoldiving : 0.00 0 0
348.88/349.06 c linesearchdiving : 0.00 0 0
348.88/349.06 c guideddiving : 0.00 0 0
348.88/349.06 c octane : 0.00 0 0
348.88/349.06 c rens : 0.00 0 0
348.88/349.06 c rins : 0.00 0 0
348.88/349.06 c localbranching : 0.00 0 0
348.88/349.06 c mutation : 0.00 0 0
348.88/349.06 c crossover : 0.00 0 0
348.88/349.06 c dins : 0.00 0 0
348.88/349.06 c undercover : 0.00 0 0
348.88/349.06 c nlp : 0.00 0 0
348.88/349.06 c trysol : 0.00 0 0
348.88/349.06 c LP : Time Calls Iterations Iter/call Iter/sec
348.88/349.06 c primal LP : 0.28 0 0 0.00 0.00
348.88/349.06 c dual LP : 5.31 98 1431 14.60 269.25
348.88/349.07 c lex dual LP : 0.00 0 0 0.00 -
348.88/349.07 c barrier LP : 0.00 0 0 0.00 -
348.88/349.07 c diving/probing LP: 0.00 0 0 0.00 -
348.88/349.07 c strong branching : 77.53 679 27951 41.16 360.54
348.88/349.07 c (at root node) : - 30 5304 176.80 -
348.88/349.07 c conflict analysis: 0.00 0 0 0.00 -
348.88/349.07 c B&B Tree :
348.88/349.07 c number of runs : 1
348.88/349.07 c nodes : 55
348.88/349.07 c nodes (total) : 55
348.88/349.07 c nodes left : 0
348.88/349.07 c max depth : 46
348.88/349.07 c max depth (total): 46
348.88/349.07 c backtracks : 0 (0.0%)
348.88/349.07 c delayed cutoffs : 0
348.88/349.07 c repropagations : 72 (619 domain reductions, 0 cutoffs)
348.88/349.07 c avg switch length: 4.33
348.88/349.07 c switching time : 0.79
348.88/349.07 c Solution :
348.88/349.07 c Solutions found : 1 (1 improvements)
348.88/349.07 c First Solution : +0.00000000000000e+00 (in run 1, after 55 nodes, 348.42 seconds, depth 46, found by <relaxation>)
348.88/349.07 c Primal Bound : +0.00000000000000e+00 (in run 1, after 55 nodes, 348.42 seconds, depth 46, found by <relaxation>)
348.88/349.07 c Dual Bound : +0.00000000000000e+00
348.88/349.07 c Gap : 0.00 %
348.88/349.07 c Root Dual Bound : +0.00000000000000e+00
348.88/349.07 c Root Iterations : 563
349.48/349.62 c Time complete: 349.51.